./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:29:02,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:29:02,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:29:02,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:29:02,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:29:02,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:29:02,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:29:02,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:29:02,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:29:02,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:29:02,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:29:02,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:29:02,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:29:02,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:29:02,903 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:29:02,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:29:02,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:29:02,903 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:29:02,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:29:02,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:29:02,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:29:02,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:29:02,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:29:02,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:29:02,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:29:02,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:29:02,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:29:02,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:29:02,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:29:02,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:29:02,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:29:02,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:29:02,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:29:02,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:29:02,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:29:02,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:29:02,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:29:02,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:29:02,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:29:02,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:29:02,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:29:02,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:29:02,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:29:02,906 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2025-03-08 04:29:03,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:29:03,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:29:03,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:29:03,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:29:03,134 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:29:03,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2025-03-08 04:29:04,255 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef78d074/fb7c421e815344cebf22faec3da843ca/FLAG66e01068a [2025-03-08 04:29:04,514 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:29:04,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2025-03-08 04:29:04,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef78d074/fb7c421e815344cebf22faec3da843ca/FLAG66e01068a [2025-03-08 04:29:04,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef78d074/fb7c421e815344cebf22faec3da843ca [2025-03-08 04:29:04,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:29:04,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:29:04,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:29:04,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:29:04,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:29:04,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:29:04" (1/1) ... [2025-03-08 04:29:04,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e828a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:04, skipping insertion in model container [2025-03-08 04:29:04,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:29:04" (1/1) ... [2025-03-08 04:29:04,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:29:05,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-03-08 04:29:05,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-03-08 04:29:05,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-03-08 04:29:05,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-03-08 04:29:05,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-03-08 04:29:05,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-03-08 04:29:05,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:29:05,070 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:29:05,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-03-08 04:29:05,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-03-08 04:29:05,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-03-08 04:29:05,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-03-08 04:29:05,115 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-03-08 04:29:05,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-03-08 04:29:05,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:29:05,136 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:29:05,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05 WrapperNode [2025-03-08 04:29:05,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:29:05,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:29:05,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:29:05,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:29:05,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,166 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2025-03-08 04:29:05,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:29:05,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:29:05,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:29:05,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:29:05,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,185 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-03-08 04:29:05,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:29:05,196 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:29:05,196 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:29:05,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:29:05,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (1/1) ... [2025-03-08 04:29:05,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:29:05,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:05,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:29:05,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:29:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:29:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:29:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:29:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:29:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:29:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:29:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:29:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:29:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:29:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:29:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:29:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:29:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:29:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:29:05,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:29:05,306 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:29:05,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:29:05,482 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 04:29:05,482 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:29:05,489 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:29:05,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:29:05,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:29:05 BoogieIcfgContainer [2025-03-08 04:29:05,490 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:29:05,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:29:05,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:29:05,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:29:05,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:29:04" (1/3) ... [2025-03-08 04:29:05,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d1c9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:29:05, skipping insertion in model container [2025-03-08 04:29:05,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:05" (2/3) ... [2025-03-08 04:29:05,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d1c9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:29:05, skipping insertion in model container [2025-03-08 04:29:05,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:29:05" (3/3) ... [2025-03-08 04:29:05,497 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2025-03-08 04:29:05,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:29:05,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-token-1.i that has 1 procedures, 44 locations, 1 initial locations, 9 loop locations, and 6 error locations. [2025-03-08 04:29:05,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:29:05,554 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e052354, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:29:05,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 04:29:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 04:29:05,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:05,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 04:29:05,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:05,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1337638754, now seen corresponding path program 1 times [2025-03-08 04:29:05,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:29:05,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446401231] [2025-03-08 04:29:05,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:29:05,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 04:29:05,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 04:29:05,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:05,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:29:05,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446401231] [2025-03-08 04:29:05,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446401231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:05,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:29:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536178535] [2025-03-08 04:29:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:05,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:29:05,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:29:05,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:29:05,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:29:05,988 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:06,073 INFO L93 Difference]: Finished difference Result 84 states and 130 transitions. [2025-03-08 04:29:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:29:06,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 04:29:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:06,080 INFO L225 Difference]: With dead ends: 84 [2025-03-08 04:29:06,080 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 04:29:06,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:29:06,084 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:06,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 86 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:29:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 04:29:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 04:29:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2025-03-08 04:29:06,105 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2025-03-08 04:29:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:06,105 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2025-03-08 04:29:06,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2025-03-08 04:29:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 04:29:06,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:06,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:06,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:29:06,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:06,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1482836824, now seen corresponding path program 1 times [2025-03-08 04:29:06,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:29:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796125098] [2025-03-08 04:29:06,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:29:06,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 04:29:06,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 04:29:06,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:06,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:06,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:29:06,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796125098] [2025-03-08 04:29:06,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796125098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:06,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:06,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:29:06,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893987251] [2025-03-08 04:29:06,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:06,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:29:06,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:29:06,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:29:06,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:29:06,207 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:06,264 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-03-08 04:29:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:29:06,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 04:29:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:06,264 INFO L225 Difference]: With dead ends: 57 [2025-03-08 04:29:06,264 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 04:29:06,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:29:06,265 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:06,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 46 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:29:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 04:29:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2025-03-08 04:29:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-03-08 04:29:06,273 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2025-03-08 04:29:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:06,273 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-03-08 04:29:06,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-03-08 04:29:06,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 04:29:06,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:06,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:06,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:29:06,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:06,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:06,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1519940054, now seen corresponding path program 1 times [2025-03-08 04:29:06,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:29:06,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175470053] [2025-03-08 04:29:06,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:29:06,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:29:06,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:29:06,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:06,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:29:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175470053] [2025-03-08 04:29:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175470053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:06,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 04:29:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23393030] [2025-03-08 04:29:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:06,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:29:06,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:29:06,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:29:06,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:29:06,727 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:06,913 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2025-03-08 04:29:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:29:06,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 04:29:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:06,913 INFO L225 Difference]: With dead ends: 54 [2025-03-08 04:29:06,914 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 04:29:06,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:29:06,915 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:06,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:29:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 04:29:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2025-03-08 04:29:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-03-08 04:29:06,925 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 12 [2025-03-08 04:29:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:06,925 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-08 04:29:06,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-03-08 04:29:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 04:29:06,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:06,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:06,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:29:06,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:06,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:06,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1519960908, now seen corresponding path program 1 times [2025-03-08 04:29:06,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:29:06,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518292464] [2025-03-08 04:29:06,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:29:06,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:29:06,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:29:06,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:06,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:06,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:29:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518292464] [2025-03-08 04:29:06,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518292464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:06,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:06,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:29:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052980714] [2025-03-08 04:29:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:06,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:29:06,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:29:06,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:29:06,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:29:06,978 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:07,034 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-03-08 04:29:07,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:29:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 04:29:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:07,035 INFO L225 Difference]: With dead ends: 44 [2025-03-08 04:29:07,035 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 04:29:07,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:29:07,036 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:07,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:29:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 04:29:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 04:29:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-03-08 04:29:07,041 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 12 [2025-03-08 04:29:07,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:07,041 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-03-08 04:29:07,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-03-08 04:29:07,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:29:07,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:07,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:07,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:29:07,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:07,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:07,042 INFO L85 PathProgramCache]: Analyzing trace with hash 273880422, now seen corresponding path program 1 times [2025-03-08 04:29:07,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:29:07,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194701614] [2025-03-08 04:29:07,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:29:07,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:29:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:29:07,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:07,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:29:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194701614] [2025-03-08 04:29:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194701614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:07,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:29:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423629467] [2025-03-08 04:29:07,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:07,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:29:07,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:29:07,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:29:07,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:29:07,436 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:07,551 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2025-03-08 04:29:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:29:07,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 04:29:07,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:07,552 INFO L225 Difference]: With dead ends: 66 [2025-03-08 04:29:07,552 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 04:29:07,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:29:07,553 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:07,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:29:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 04:29:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2025-03-08 04:29:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-03-08 04:29:07,558 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 16 [2025-03-08 04:29:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:07,559 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-03-08 04:29:07,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-03-08 04:29:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:29:07,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:07,559 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:07,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 04:29:07,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:07,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:07,560 INFO L85 PathProgramCache]: Analyzing trace with hash -39724975, now seen corresponding path program 1 times [2025-03-08 04:29:07,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:29:07,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392014502] [2025-03-08 04:29:07,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:07,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:29:07,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:29:07,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:29:07,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:07,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:07,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:29:07,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392014502] [2025-03-08 04:29:07,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392014502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:29:07,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924637866] [2025-03-08 04:29:07,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:07,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:07,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:07,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:29:07,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:29:08,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:29:08,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:29:08,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:08,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:08,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 04:29:08,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:29:08,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 04:29:08,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:29:08,155 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:29:08,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 04:29:08,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:08,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-03-08 04:29:08,196 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 04:29:08,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-08 04:29:08,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-08 04:29:08,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-03-08 04:29:08,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-08 04:29:08,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-08 04:29:08,246 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:29:08,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 04:29:08,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:08,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:08,410 INFO L349 Elim1Store]: treesize reduction 988, result has 2.1 percent of original size [2025-03-08 04:29:08,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 528 treesize of output 656 [2025-03-08 04:29:08,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:08,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:08,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:08,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:08,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2025-03-08 04:29:08,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-08 04:29:08,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:08,494 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:29:08,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2025-03-08 04:29:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:08,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:29:08,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:29:08,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2025-03-08 04:29:08,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:29:08,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2025-03-08 04:29:08,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:29:08,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 63 [2025-03-08 04:29:08,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:29:08,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2025-03-08 04:29:09,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:29:09,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1767 treesize of output 1408 [2025-03-08 04:29:10,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2855 treesize of output 2235 [2025-03-08 04:29:10,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2083 treesize of output 1991 [2025-03-08 04:29:10,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1993 treesize of output 1987 [2025-03-08 04:29:10,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1987 treesize of output 1977 [2025-03-08 04:29:17,290 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0)))) (and (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse4 (store v_ArrVal_337 8 2))) (let ((.cse1 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse1 1) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse1 0) (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse7 (store .cse6 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse5 (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse5 1) (= .cse5 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse11 (store .cse10 v_arrayElimCell_17 v_ArrVal_338)) (.cse9 (store v_ArrVal_337 8 2))) (let ((.cse8 (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse8 1) (= .cse8 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse17 (store v_prenex_19 8 2)) (.cse16 (store .cse18 v_arrayElimCell_16 v_prenex_21))) (let ((.cse13 (select (select (store (store .cse18 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse16 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse15 (select (select (store (store (store .cse18 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse14 (select (select (store .cse16 v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse13) (= .cse14 1) (= .cse15 0) (= .cse13 1) (= .cse15 1) (= .cse14 0)))))) (= v_prenex_20 v_arrayElimCell_17))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_16) 0)) (forall ((v_prenex_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse20 (select (select (store (store .cse22 v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse21 (select (select (store (store (store .cse22 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse20 0) (= 0 .cse21) (= .cse20 1) (= 1 .cse21))))) (not (= 2 (select v_arrayElimArr_6 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= v_prenex_25 v_arrayElimCell_17) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse25 (select (select (store (store .cse24 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse23 (select (select (store (store (store .cse24 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse23 1) (= .cse23 0)))) (= .cse25 0) (= .cse25 1))))) (not (= 2 (select v_arrayElimArr_7 8))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse26 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse26 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse26 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse29 (store v_ArrVal_337 8 2))) (let ((.cse27 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse27 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse27 0) (= (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17)))))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse32 (store .cse31 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse30 (select (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse30 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse30 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse31 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_326 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse35 (store .cse34 v_arrayElimCell_16 v_prenex_32))) (let ((.cse33 (select (select (store .cse35 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (= .cse33 1) (= (select (select (store (store .cse34 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse35 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse33 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (and (forall ((v_prenex_20 Int)) (or (not (= (select .cse0 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse40 (store .cse39 v_arrayElimCell_17 v_prenex_21)) (.cse41 (store v_prenex_19 8 2))) (let ((.cse36 (select (select (store .cse40 v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse37 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse38 (select (select (store (store .cse39 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse40 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse36 1) (= .cse36 0) (= .cse37 0) (= .cse38 1) (= .cse37 1) (= .cse38 0) (= v_prenex_20 v_arrayElimCell_17)))))))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse45 (store .cse44 v_arrayElimCell_17 v_prenex_21))) (let ((.cse42 (select (select (store .cse45 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse43 (select (select (store (store .cse44 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse45 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse42 1) (= .cse42 0) (= .cse43 1) (= .cse43 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse48 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse50 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse49 (store .cse48 v_arrayElimCell_17 v_prenex_21)) (.cse51 (store v_prenex_19 8 2))) (let ((.cse46 (select (select (store .cse49 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse47 (select (select (store .cse50 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse46 1) (= .cse46 0) (= .cse47 0) (= .cse47 1) (= (select (select (store (store .cse48 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse49 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse50 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse56 (store .cse55 v_arrayElimCell_17 v_prenex_21)) (.cse54 (store v_prenex_19 8 2))) (let ((.cse52 (select (select (store .cse56 v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse53 (select (select (store (store .cse55 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse56 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse52 1) (= .cse52 0) (= .cse53 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse53 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse60 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse61 (store v_prenex_19 8 2))) (let ((.cse57 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse59 (select (select (store .cse60 v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse58 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse60 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse57 1) (= .cse58 0) (= .cse57 0) (= .cse59 0) (= .cse59 1) (= .cse58 1))))) (= v_prenex_20 v_arrayElimCell_17))) (not (= (select .cse0 v_prenex_20) 0)))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse62 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse62 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse62 0)))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse63 (store v_prenex_22 8 2)) (.cse66 (store .cse67 v_arrayElimCell_17 v_prenex_24))) (let ((.cse64 (select (select (store (store .cse67 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse66 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse65 (select (select (store .cse66 v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse64 1) (= .cse65 0) (= .cse64 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse65 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse69 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse70 (store .cse69 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse68 (select (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse68 0) (= .cse68 1) (= (select (select (store (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse73 (store .cse72 v_arrayElimCell_17 v_prenex_32)) (.cse71 (store v_prenex_30 8 2))) (let ((.cse74 (select (select (store .cse73 v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse72 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse73 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse74 0) (= .cse74 1))))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse75 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse75 1) (= .cse75 0)))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse77 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse78 (store .cse77 v_arrayElimCell_17 v_prenex_29)) (.cse79 (store v_prenex_27 8 2))) (let ((.cse76 (select (select (store .cse78 v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse76 1) (= .cse76 0) (= (select (select (store (store .cse77 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse78 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse78 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse82 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse83 (store .cse82 v_arrayElimCell_17 v_prenex_21)) (.cse85 (store v_prenex_19 8 2))) (let ((.cse80 (select (select (store .cse83 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse81 (select (select (store .cse84 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse80 1) (= .cse80 0) (= .cse81 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse81 1) (= (select (select (store (store .cse82 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse83 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse84 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int)) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse89 (store .cse87 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse90 (store .cse89 v_arrayElimCell_17 v_prenex_24)) (.cse88 (store .cse87 v_arrayElimCell_16 v_prenex_24)) (.cse92 (store v_prenex_22 8 2))) (let ((.cse86 (select (select (store .cse88 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse91 (select (select (store .cse90 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse86 0) (= .cse86 1) (= (select (select (store (store .cse87 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse88 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse89 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse90 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse91 1) (= .cse91 0))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse95 (store .cse96 v_arrayElimCell_16 v_prenex_21))) (let ((.cse93 (select (select (store (store .cse96 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse95 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse94 (select (select (store .cse95 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse93) (= .cse94 1) (= .cse93 1) (= .cse94 0)))))) (= v_prenex_20 v_arrayElimCell_16))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse98 (store .cse97 v_arrayElimCell_17 v_prenex_32))) (let ((.cse99 (select (select (store .cse98 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse97 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse98 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse99 0) (= .cse99 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (forall ((v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse103 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse104 (store .cse103 v_arrayElimCell_16 v_prenex_29)) (.cse102 (store v_prenex_27 8 2))) (let ((.cse101 (select (select (store .cse104 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse100 (store (store .cse103 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse100 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse101 0) (= .cse101 1) (= (select (select (store .cse100 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse103 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse104 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 Int) (v_ArrVal_326 Int)) (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse107 (store .cse108 v_arrayElimCell_16 v_prenex_21))) (let ((.cse105 (select (select (store (store .cse108 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse107 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse106 (select (select (store .cse107 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse105) (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (= .cse106 1) (= .cse105 1) (= .cse106 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse112 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse113 (store .cse112 v_arrayElimCell_17 v_prenex_21)) (.cse111 (store v_prenex_19 8 2))) (let ((.cse109 (select (select (store .cse113 v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse110 (select (select (store (store .cse112 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse113 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse109 1) (= .cse109 0) (= .cse110 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse110 0) (= v_prenex_20 v_arrayElimCell_17))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse115 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse116 (store .cse115 v_arrayElimCell_16 v_ArrVal_338)) (.cse118 (store v_ArrVal_337 8 2))) (let ((.cse114 (select (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse117 (select (select (store (store (store .cse115 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse114 0) (= .cse114 1) (= (select (select (store (store .cse115 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse117 0) (= .cse117 1)))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse121 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse122 (store .cse121 v_arrayElimCell_17 v_prenex_21))) (let ((.cse119 (select (select (store .cse122 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse120 (select (select (store (store .cse121 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse122 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse119 1) (= .cse119 0) (= .cse120 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse120 0) (= v_prenex_20 v_arrayElimCell_17))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_31 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse128 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse124 (store .cse128 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse125 (store .cse124 v_arrayElimCell_17 v_prenex_32)) (.cse127 (store v_prenex_30 8 2))) (let ((.cse123 (select (select (store (store .cse128 v_arrayElimCell_16 v_prenex_32) v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse126 (select (select (store .cse125 v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse123 1) (= (select (select (store (store .cse124 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse125 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse123 0) (= .cse126 1) (= .cse126 0))))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse129 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse129 1) (= .cse129 0)))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse130 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse130 0) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse130 1)))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse133 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse134 (store .cse133 v_arrayElimCell_17 v_ArrVal_338)) (.cse132 (store v_ArrVal_337 8 2))) (let ((.cse131 (select (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse131 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse131 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse133 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse136 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse137 (store .cse136 v_arrayElimCell_16 v_ArrVal_338)) (.cse139 (store v_ArrVal_337 8 2))) (let ((.cse135 (select (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse138 (select (select (store (store (store .cse136 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse135 0) (= .cse135 1) (= (select (select (store (store .cse136 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse138 0) (= .cse138 1)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse143 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse144 (store .cse143 v_arrayElimCell_17 v_prenex_21)) (.cse145 (store v_prenex_19 8 2))) (let ((.cse140 (select (select (store .cse144 v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse141 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse142 (select (select (store (store .cse143 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse144 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse140 1) (= .cse140 0) (= .cse141 0) (= .cse142 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse141 1) (= .cse142 0) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (or .cse12 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse146 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse146 1) (= .cse146 0))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse147 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse147 0) (not (= 2 (select v_arrayElimArr_7 8))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)) (= .cse147 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse149 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse148 (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse148 0) (not (= (select .cse0 v_arrayElimCell_17) 0)) (not (= (store (store v_arrayElimArr_9 12 (select v_arrayElimArr_8 12)) 8 2) v_arrayElimArr_8)) (= .cse148 1) (not (= (select v_arrayElimArr_9 12) 2)) (= (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse151 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse152 (store .cse151 v_arrayElimCell_16 v_prenex_29))) (let ((.cse150 (select (select (store .cse152 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse150 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (= .cse150 1) (= (select (select (store (store .cse151 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse152 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store .cse152 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse153 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_arrayElimArr_10) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_arrayElimCell_17) 0)) (= .cse153 0) (= .cse153 1) (not (= (select v_arrayElimArr_10 12) 2)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse156 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse157 (store .cse156 v_arrayElimCell_16 v_prenex_24))) (let ((.cse154 (select (select (store .cse157 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse155 (select (select (store (store .cse156 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse157 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse154 0) (= .cse154 1) (= .cse155 0) (= .cse155 1) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int)) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse159 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse160 (select (select (store (store .cse159 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse158 (select (select (store (store (store .cse159 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse158 1) (= .cse158 0)))) (= .cse160 0) (= .cse160 1))))) (not (= 2 (select v_arrayElimArr_7 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse162 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse163 (store .cse162 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse161 (select (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse161 0) (= .cse161 1) (= (select (select (store (store .cse162 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse167 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse166 (store .cse167 v_arrayElimCell_17 v_prenex_24))) (let ((.cse164 (select (select (store (store .cse167 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse166 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse165 (select (select (store .cse166 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse164 1) (= .cse165 0) (= .cse164 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse165 1)))))) .cse12) (or (and (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse0 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse168 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse168 1) (= .cse168 0)))))) (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse169 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse169 1) (= .cse169 0)))) (not (= 0 (select .cse0 v_prenex_25)))))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse171 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse172 (store .cse171 v_arrayElimCell_17 v_prenex_29))) (let ((.cse170 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse170 1) (= .cse170 0) (= (select (select (store (store .cse171 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse172 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse176 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse177 (store .cse176 v_arrayElimCell_17 v_prenex_24)) (.cse174 (store v_prenex_22 8 2))) (let ((.cse173 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24)) (.cse175 (select (select (store .cse177 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store .cse173 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse175 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse173 v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse176 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse177 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse175 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse183 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse182 (store v_prenex_19 8 2)) (.cse181 (store .cse183 v_arrayElimCell_16 v_prenex_21))) (let ((.cse178 (select (select (store (store .cse183 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse181 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse180 (select (select (store (store (store .cse183 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse179 (select (select (store .cse181 v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse178) (= .cse179 1) (= .cse180 0) (= .cse178 1) (= .cse180 1) (= .cse179 0)))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse187 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332)) (.cse185 (store v_prenex_27 8 2))) (let ((.cse186 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse184 (store .cse187 v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse184 v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 0) (= (select (select (store (store .cse187 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse184 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 1) (= 0 (select (select (store .cse184 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0)))))) .cse12))) is different from true [2025-03-08 04:29:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 04:29:19,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924637866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:29:19,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:29:19,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 14 [2025-03-08 04:29:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122981759] [2025-03-08 04:29:19,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:29:19,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:29:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:29:19,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:29:19,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=1, NotChecked=22, Total=182 [2025-03-08 04:29:19,083 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:23,202 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0)))) (and (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse4 (store v_ArrVal_337 8 2))) (let ((.cse1 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse1 1) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse1 0) (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse7 (store .cse6 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse5 (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse5 1) (= .cse5 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse11 (store .cse10 v_arrayElimCell_17 v_ArrVal_338)) (.cse9 (store v_ArrVal_337 8 2))) (let ((.cse8 (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse8 1) (= .cse8 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse17 (store v_prenex_19 8 2)) (.cse16 (store .cse18 v_arrayElimCell_16 v_prenex_21))) (let ((.cse13 (select (select (store (store .cse18 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse16 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse15 (select (select (store (store (store .cse18 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse14 (select (select (store .cse16 v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse13) (= .cse14 1) (= .cse15 0) (= .cse13 1) (= .cse15 1) (= .cse14 0)))))) (= v_prenex_20 v_arrayElimCell_17))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_16) 0)) (forall ((v_prenex_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse20 (select (select (store (store .cse22 v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse21 (select (select (store (store (store .cse22 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse20 0) (= 0 .cse21) (= .cse20 1) (= 1 .cse21))))) (not (= 2 (select v_arrayElimArr_6 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= v_prenex_25 v_arrayElimCell_17) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse25 (select (select (store (store .cse24 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse23 (select (select (store (store (store .cse24 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse23 1) (= .cse23 0)))) (= .cse25 0) (= .cse25 1))))) (not (= 2 (select v_arrayElimArr_7 8))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse26 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse26 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse26 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse29 (store v_ArrVal_337 8 2))) (let ((.cse27 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse27 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse27 0) (= (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17)))))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse32 (store .cse31 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse30 (select (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse30 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse30 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse31 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_326 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse35 (store .cse34 v_arrayElimCell_16 v_prenex_32))) (let ((.cse33 (select (select (store .cse35 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (= .cse33 1) (= (select (select (store (store .cse34 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse35 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse33 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (and (forall ((v_prenex_20 Int)) (or (not (= (select .cse0 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse40 (store .cse39 v_arrayElimCell_17 v_prenex_21)) (.cse41 (store v_prenex_19 8 2))) (let ((.cse36 (select (select (store .cse40 v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse37 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse38 (select (select (store (store .cse39 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse40 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse36 1) (= .cse36 0) (= .cse37 0) (= .cse38 1) (= .cse37 1) (= .cse38 0) (= v_prenex_20 v_arrayElimCell_17)))))))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse45 (store .cse44 v_arrayElimCell_17 v_prenex_21))) (let ((.cse42 (select (select (store .cse45 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse43 (select (select (store (store .cse44 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse45 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse42 1) (= .cse42 0) (= .cse43 1) (= .cse43 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse48 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse50 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse49 (store .cse48 v_arrayElimCell_17 v_prenex_21)) (.cse51 (store v_prenex_19 8 2))) (let ((.cse46 (select (select (store .cse49 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse47 (select (select (store .cse50 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse46 1) (= .cse46 0) (= .cse47 0) (= .cse47 1) (= (select (select (store (store .cse48 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse49 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse50 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse56 (store .cse55 v_arrayElimCell_17 v_prenex_21)) (.cse54 (store v_prenex_19 8 2))) (let ((.cse52 (select (select (store .cse56 v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse53 (select (select (store (store .cse55 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse56 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse52 1) (= .cse52 0) (= .cse53 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse53 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse60 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse61 (store v_prenex_19 8 2))) (let ((.cse57 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse59 (select (select (store .cse60 v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse58 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse60 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse57 1) (= .cse58 0) (= .cse57 0) (= .cse59 0) (= .cse59 1) (= .cse58 1))))) (= v_prenex_20 v_arrayElimCell_17))) (not (= (select .cse0 v_prenex_20) 0)))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse62 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse62 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse62 0)))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse63 (store v_prenex_22 8 2)) (.cse66 (store .cse67 v_arrayElimCell_17 v_prenex_24))) (let ((.cse64 (select (select (store (store .cse67 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse66 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse65 (select (select (store .cse66 v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse64 1) (= .cse65 0) (= .cse64 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse65 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse69 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse70 (store .cse69 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse68 (select (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse68 0) (= .cse68 1) (= (select (select (store (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse73 (store .cse72 v_arrayElimCell_17 v_prenex_32)) (.cse71 (store v_prenex_30 8 2))) (let ((.cse74 (select (select (store .cse73 v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse72 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse73 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse74 0) (= .cse74 1))))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 0) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse75 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse75 1) (= .cse75 0)))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse77 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse78 (store .cse77 v_arrayElimCell_17 v_prenex_29)) (.cse79 (store v_prenex_27 8 2))) (let ((.cse76 (select (select (store .cse78 v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse76 1) (= .cse76 0) (= (select (select (store (store .cse77 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse78 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse78 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse82 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse83 (store .cse82 v_arrayElimCell_17 v_prenex_21)) (.cse85 (store v_prenex_19 8 2))) (let ((.cse80 (select (select (store .cse83 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse81 (select (select (store .cse84 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse80 1) (= .cse80 0) (= .cse81 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse81 1) (= (select (select (store (store .cse82 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse83 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse84 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int)) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse89 (store .cse87 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse90 (store .cse89 v_arrayElimCell_17 v_prenex_24)) (.cse88 (store .cse87 v_arrayElimCell_16 v_prenex_24)) (.cse92 (store v_prenex_22 8 2))) (let ((.cse86 (select (select (store .cse88 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse91 (select (select (store .cse90 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse86 0) (= .cse86 1) (= (select (select (store (store .cse87 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse88 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse89 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse90 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse91 1) (= .cse91 0))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse95 (store .cse96 v_arrayElimCell_16 v_prenex_21))) (let ((.cse93 (select (select (store (store .cse96 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse95 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse94 (select (select (store .cse95 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse93) (= .cse94 1) (= .cse93 1) (= .cse94 0)))))) (= v_prenex_20 v_arrayElimCell_16))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse98 (store .cse97 v_arrayElimCell_17 v_prenex_32))) (let ((.cse99 (select (select (store .cse98 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse97 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse98 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse99 0) (= .cse99 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (forall ((v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse103 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse104 (store .cse103 v_arrayElimCell_16 v_prenex_29)) (.cse102 (store v_prenex_27 8 2))) (let ((.cse101 (select (select (store .cse104 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse100 (store (store .cse103 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse100 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse101 0) (= .cse101 1) (= (select (select (store .cse100 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse103 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse104 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 Int) (v_ArrVal_326 Int)) (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse107 (store .cse108 v_arrayElimCell_16 v_prenex_21))) (let ((.cse105 (select (select (store (store .cse108 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse107 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse106 (select (select (store .cse107 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse105) (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (= .cse106 1) (= .cse105 1) (= .cse106 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse112 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse113 (store .cse112 v_arrayElimCell_17 v_prenex_21)) (.cse111 (store v_prenex_19 8 2))) (let ((.cse109 (select (select (store .cse113 v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse110 (select (select (store (store .cse112 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse113 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse109 1) (= .cse109 0) (= .cse110 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse110 0) (= v_prenex_20 v_arrayElimCell_17))))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse115 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse116 (store .cse115 v_arrayElimCell_16 v_ArrVal_338)) (.cse118 (store v_ArrVal_337 8 2))) (let ((.cse114 (select (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse117 (select (select (store (store (store .cse115 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse114 0) (= .cse114 1) (= (select (select (store (store .cse115 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse117 0) (= .cse117 1)))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse121 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse122 (store .cse121 v_arrayElimCell_17 v_prenex_21))) (let ((.cse119 (select (select (store .cse122 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse120 (select (select (store (store .cse121 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse122 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse119 1) (= .cse119 0) (= .cse120 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse120 0) (= v_prenex_20 v_arrayElimCell_17))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_31 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse128 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse124 (store .cse128 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse125 (store .cse124 v_arrayElimCell_17 v_prenex_32)) (.cse127 (store v_prenex_30 8 2))) (let ((.cse123 (select (select (store (store .cse128 v_arrayElimCell_16 v_prenex_32) v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse126 (select (select (store .cse125 v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse123 1) (= (select (select (store (store .cse124 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse125 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse123 0) (= .cse126 1) (= .cse126 0))))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse129 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse129 1) (= .cse129 0)))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse130 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse130 0) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse130 1)))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse133 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse134 (store .cse133 v_arrayElimCell_17 v_ArrVal_338)) (.cse132 (store v_ArrVal_337 8 2))) (let ((.cse131 (select (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse131 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse131 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse133 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse136 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse137 (store .cse136 v_arrayElimCell_16 v_ArrVal_338)) (.cse139 (store v_ArrVal_337 8 2))) (let ((.cse135 (select (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse138 (select (select (store (store (store .cse136 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse135 0) (= .cse135 1) (= (select (select (store (store .cse136 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse138 0) (= .cse138 1)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse143 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse144 (store .cse143 v_arrayElimCell_17 v_prenex_21)) (.cse145 (store v_prenex_19 8 2))) (let ((.cse140 (select (select (store .cse144 v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse141 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse142 (select (select (store (store .cse143 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse144 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse140 1) (= .cse140 0) (= .cse141 0) (= .cse142 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse141 1) (= .cse142 0) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (or .cse12 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse146 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse146 1) (= .cse146 0))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse147 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse147 0) (not (= 2 (select v_arrayElimArr_7 8))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)) (= .cse147 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse149 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse148 (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse148 0) (not (= (select .cse0 v_arrayElimCell_17) 0)) (not (= (store (store v_arrayElimArr_9 12 (select v_arrayElimArr_8 12)) 8 2) v_arrayElimArr_8)) (= .cse148 1) (not (= (select v_arrayElimArr_9 12) 2)) (= (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse151 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse152 (store .cse151 v_arrayElimCell_16 v_prenex_29))) (let ((.cse150 (select (select (store .cse152 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse150 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (= .cse150 1) (= (select (select (store (store .cse151 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse152 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store .cse152 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse153 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_arrayElimArr_10) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_arrayElimCell_17) 0)) (= .cse153 0) (= .cse153 1) (not (= (select v_arrayElimArr_10 12) 2)))))) (= (select .cse19 8) 0) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse156 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse157 (store .cse156 v_arrayElimCell_16 v_prenex_24))) (let ((.cse154 (select (select (store .cse157 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse155 (select (select (store (store .cse156 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse157 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse154 0) (= .cse154 1) (= .cse155 0) (= .cse155 1) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int)) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse159 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse160 (select (select (store (store .cse159 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse158 (select (select (store (store (store .cse159 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse158 1) (= .cse158 0)))) (= .cse160 0) (= .cse160 1))))) (not (= 2 (select v_arrayElimArr_7 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse162 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse163 (store .cse162 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse161 (select (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse161 0) (= .cse161 1) (= (select (select (store (store .cse162 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse167 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse166 (store .cse167 v_arrayElimCell_17 v_prenex_24))) (let ((.cse164 (select (select (store (store .cse167 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse166 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse165 (select (select (store .cse166 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse164 1) (= .cse165 0) (= .cse164 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse165 1)))))) .cse12) (or (and (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse0 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse168 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse168 1) (= .cse168 0)))))) (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse169 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse169 1) (= .cse169 0)))) (not (= 0 (select .cse0 v_prenex_25)))))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse171 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse172 (store .cse171 v_arrayElimCell_17 v_prenex_29))) (let ((.cse170 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse170 1) (= .cse170 0) (= (select (select (store (store .cse171 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse172 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse176 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse177 (store .cse176 v_arrayElimCell_17 v_prenex_24)) (.cse174 (store v_prenex_22 8 2))) (let ((.cse173 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24)) (.cse175 (select (select (store .cse177 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store .cse173 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse175 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse173 v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse176 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse177 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse175 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse183 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse182 (store v_prenex_19 8 2)) (.cse181 (store .cse183 v_arrayElimCell_16 v_prenex_21))) (let ((.cse178 (select (select (store (store .cse183 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse181 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse180 (select (select (store (store (store .cse183 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse179 (select (select (store .cse181 v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse178) (= .cse179 1) (= .cse180 0) (= .cse178 1) (= .cse180 1) (= .cse179 0)))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse187 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332)) (.cse185 (store v_prenex_27 8 2))) (let ((.cse186 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse184 (store .cse187 v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse184 v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 0) (= (select (select (store (store .cse187 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse184 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 1) (= 0 (select (select (store .cse184 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0)))))) .cse12))) is different from true [2025-03-08 04:29:27,276 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0)))) (and (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse4 (store v_ArrVal_337 8 2))) (let ((.cse1 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse1 1) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse1 0) (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse4) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse7 (store .cse6 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse5 (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse5 1) (= .cse5 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse11 (store .cse10 v_arrayElimCell_17 v_ArrVal_338)) (.cse9 (store v_ArrVal_337 8 2))) (let ((.cse8 (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse8 1) (= .cse8 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse17 (store v_prenex_19 8 2)) (.cse16 (store .cse18 v_arrayElimCell_16 v_prenex_21))) (let ((.cse13 (select (select (store (store .cse18 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse16 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse15 (select (select (store (store (store .cse18 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse14 (select (select (store .cse16 v_prenex_20 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse13) (= .cse14 1) (= .cse15 0) (= .cse13 1) (= .cse15 1) (= .cse14 0)))))) (= v_prenex_20 v_arrayElimCell_17))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_16) 0)) (forall ((v_prenex_17 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse20 (select (select (store (store .cse22 v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse21 (select (select (store (store (store .cse22 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse20 0) (= 0 .cse21) (= .cse20 1) (= 1 .cse21))))) (not (= 2 (select v_arrayElimArr_6 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= v_prenex_25 v_arrayElimCell_17) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse25 (select (select (store (store .cse24 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse23 (select (select (store (store (store .cse24 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse23 1) (= .cse23 0)))) (= .cse25 0) (= .cse25 1))))) (not (= 2 (select v_arrayElimArr_7 8))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse26 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse26 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse26 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse29 (store v_ArrVal_337 8 2))) (let ((.cse27 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338))) (or (= .cse27 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse27 0) (= (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse29) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17)))))) (or .cse12 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse32 (store .cse31 v_arrayElimCell_17 v_ArrVal_338))) (let ((.cse30 (select (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse30 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse30 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse31 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_326 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse35 (store .cse34 v_arrayElimCell_16 v_prenex_32))) (let ((.cse33 (select (select (store .cse35 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (= .cse33 1) (= (select (select (store (store .cse34 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse35 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse33 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (and (forall ((v_prenex_20 Int)) (or (not (= (select .cse0 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse40 (store .cse39 v_arrayElimCell_17 v_prenex_21)) (.cse41 (store v_prenex_19 8 2))) (let ((.cse36 (select (select (store .cse40 v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse37 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse41) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse38 (select (select (store (store .cse39 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse40 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse36 1) (= .cse36 0) (= .cse37 0) (= .cse38 1) (= .cse37 1) (= .cse38 0) (= v_prenex_20 v_arrayElimCell_17)))))))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse45 (store .cse44 v_arrayElimCell_17 v_prenex_21))) (let ((.cse42 (select (select (store .cse45 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse43 (select (select (store (store .cse44 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse45 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse42 1) (= .cse42 0) (= .cse43 1) (= .cse43 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse48 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse50 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse49 (store .cse48 v_arrayElimCell_17 v_prenex_21)) (.cse51 (store v_prenex_19 8 2))) (let ((.cse46 (select (select (store .cse49 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse47 (select (select (store .cse50 v_prenex_20 .cse51) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse46 1) (= .cse46 0) (= .cse47 0) (= .cse47 1) (= (select (select (store (store .cse48 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse49 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse50 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse56 (store .cse55 v_arrayElimCell_17 v_prenex_21)) (.cse54 (store v_prenex_19 8 2))) (let ((.cse52 (select (select (store .cse56 v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse53 (select (select (store (store .cse55 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse56 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse52 1) (= .cse52 0) (= .cse53 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse54) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse53 0) (= v_prenex_20 v_arrayElimCell_17)))))) (not (= (select .cse0 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse60 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse61 (store v_prenex_19 8 2))) (let ((.cse57 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse59 (select (select (store .cse60 v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse58 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse60 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse57 1) (= .cse58 0) (= .cse57 0) (= .cse59 0) (= .cse59 1) (= .cse58 1))))) (= v_prenex_20 v_arrayElimCell_17))) (not (= (select .cse0 v_prenex_20) 0)))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse62 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse62 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse62 0)))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse63 (store v_prenex_22 8 2)) (.cse66 (store .cse67 v_arrayElimCell_17 v_prenex_24))) (let ((.cse64 (select (select (store (store .cse67 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse66 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse65 (select (select (store .cse66 v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse63) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse64 1) (= .cse65 0) (= .cse64 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse65 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse69 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse70 (store .cse69 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse68 (select (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse68 0) (= .cse68 1) (= (select (select (store (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse70 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse73 (store .cse72 v_arrayElimCell_17 v_prenex_32)) (.cse71 (store v_prenex_30 8 2))) (let ((.cse74 (select (select (store .cse73 v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse71) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store .cse72 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse73 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse74 0) (= .cse74 1))))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 0) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse75 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse75 1) (= .cse75 0)))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse77 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse78 (store .cse77 v_arrayElimCell_17 v_prenex_29)) (.cse79 (store v_prenex_27 8 2))) (let ((.cse76 (select (select (store .cse78 v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse76 1) (= .cse76 0) (= (select (select (store (store .cse77 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse78 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse78 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse82 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse83 (store .cse82 v_arrayElimCell_17 v_prenex_21)) (.cse85 (store v_prenex_19 8 2))) (let ((.cse80 (select (select (store .cse83 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse81 (select (select (store .cse84 v_prenex_20 .cse85) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse80 1) (= .cse80 0) (= .cse81 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse81 1) (= (select (select (store (store .cse82 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse83 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse84 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int)) (or (forall ((v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse89 (store .cse87 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse90 (store .cse89 v_arrayElimCell_17 v_prenex_24)) (.cse88 (store .cse87 v_arrayElimCell_16 v_prenex_24)) (.cse92 (store v_prenex_22 8 2))) (let ((.cse86 (select (select (store .cse88 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse91 (select (select (store .cse90 v_prenex_23 .cse92) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse86 0) (= .cse86 1) (= (select (select (store (store .cse87 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse88 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse89 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse90 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse91 1) (= .cse91 0))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse95 (store .cse96 v_arrayElimCell_16 v_prenex_21))) (let ((.cse93 (select (select (store (store .cse96 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse95 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse94 (select (select (store .cse95 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse93) (= .cse94 1) (= .cse93 1) (= .cse94 0)))))) (= v_prenex_20 v_arrayElimCell_16))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (or .cse12 (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse98 (store .cse97 v_arrayElimCell_17 v_prenex_32))) (let ((.cse99 (select (select (store .cse98 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse97 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse98 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_31) 0)) (= .cse99 0) (= .cse99 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (forall ((v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse103 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse104 (store .cse103 v_arrayElimCell_16 v_prenex_29)) (.cse102 (store v_prenex_27 8 2))) (let ((.cse101 (select (select (store .cse104 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse100 (store (store .cse103 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse100 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse101 0) (= .cse101 1) (= (select (select (store .cse100 v_prenex_28 .cse102) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse103 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse104 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 Int) (v_ArrVal_326 Int)) (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse107 (store .cse108 v_arrayElimCell_16 v_prenex_21))) (let ((.cse105 (select (select (store (store .cse108 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse107 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse106 (select (select (store .cse107 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse105) (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (= .cse106 1) (= .cse105 1) (= .cse106 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse112 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse113 (store .cse112 v_arrayElimCell_17 v_prenex_21)) (.cse111 (store v_prenex_19 8 2))) (let ((.cse109 (select (select (store .cse113 v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse110 (select (select (store (store .cse112 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse113 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse109 1) (= .cse109 0) (= .cse110 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse111) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse110 0) (= v_prenex_20 v_arrayElimCell_17))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_arrayElimCell_17 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse115 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse116 (store .cse115 v_arrayElimCell_16 v_ArrVal_338)) (.cse118 (store v_ArrVal_337 8 2))) (let ((.cse114 (select (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse117 (select (select (store (store (store .cse115 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse118) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse114 0) (= .cse114 1) (= (select (select (store (store .cse115 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse116 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse117 0) (= .cse117 1)))))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or .cse12 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse121 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse122 (store .cse121 v_arrayElimCell_17 v_prenex_21))) (let ((.cse119 (select (select (store .cse122 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse120 (select (select (store (store .cse121 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse122 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse119 1) (= .cse119 0) (= .cse120 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse120 0) (= v_prenex_20 v_arrayElimCell_17))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_31 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_31) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_30 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse128 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse124 (store .cse128 v_arrayElimCell_16 v_ArrVal_332))) (let ((.cse125 (store .cse124 v_arrayElimCell_17 v_prenex_32)) (.cse127 (store v_prenex_30 8 2))) (let ((.cse123 (select (select (store (store .cse128 v_arrayElimCell_16 v_prenex_32) v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse126 (select (select (store .cse125 v_prenex_31 .cse127) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse123 1) (= (select (select (store (store .cse124 v_prenex_31 v_prenex_30) v_arrayElimCell_17 (store (select (store .cse125 v_prenex_31 v_prenex_30) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse123 0) (= .cse126 1) (= .cse126 0))))))))) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse129 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse129 1) (= .cse129 0)))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse130 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse130 0) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse130 1)))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse133 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse134 (store .cse133 v_arrayElimCell_17 v_ArrVal_338)) (.cse132 (store v_ArrVal_337 8 2))) (let ((.cse131 (select (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse131 1) (not (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse131 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse132) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_17) (= (select (select (store (store .cse133 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17 (store (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) .cse12) (forall ((v_arrayElimCell_16 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse136 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse137 (store .cse136 v_arrayElimCell_16 v_ArrVal_338)) (.cse139 (store v_ArrVal_337 8 2))) (let ((.cse135 (select (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse138 (select (select (store (store (store .cse136 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse139) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse135 0) (= .cse135 1) (= (select (select (store (store .cse136 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse137 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse138 0) (= .cse138 1)))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse143 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse144 (store .cse143 v_arrayElimCell_17 v_prenex_21)) (.cse145 (store v_prenex_19 8 2))) (let ((.cse140 (select (select (store .cse144 v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse141 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 .cse145) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse142 (select (select (store (store .cse143 v_prenex_20 v_prenex_19) v_arrayElimCell_17 (store (select (store .cse144 v_prenex_20 v_prenex_19) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse140 1) (= .cse140 0) (= .cse141 0) (= .cse142 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse141 1) (= .cse142 0) (= v_prenex_20 v_arrayElimCell_17)))))) .cse12) (or .cse12 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_prenex_25 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse146 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 0 (select .cse0 v_prenex_25))) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse146 1) (= .cse146 0))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse147 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse147 0) (not (= 2 (select v_arrayElimArr_7 8))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)) (= .cse147 1)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse149 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse148 (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse148 0) (not (= (select .cse0 v_arrayElimCell_17) 0)) (not (= (store (store v_arrayElimArr_9 12 (select v_arrayElimArr_8 12)) 8 2) v_arrayElimArr_8)) (= .cse148 1) (not (= (select v_arrayElimArr_9 12) 2)) (= (select (select (store .cse149 v_arrayElimCell_17 v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_28 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse151 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse152 (store .cse151 v_arrayElimCell_16 v_prenex_29))) (let ((.cse150 (select (select (store .cse152 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse150 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_28) 0)) (= .cse150 1) (= (select (select (store (store .cse151 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse152 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store .cse152 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or .cse12 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse153 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_arrayElimArr_10) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select .cse0 v_arrayElimCell_17) 0)) (= .cse153 0) (= .cse153 1) (not (= (select v_arrayElimArr_10 12) 2)))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse156 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse157 (store .cse156 v_arrayElimCell_16 v_prenex_24))) (let ((.cse154 (select (select (store .cse157 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse155 (select (select (store (store .cse156 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse157 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse154 0) (= .cse154 1) (= .cse155 0) (= .cse155 1) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_23) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int)) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse159 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse160 (select (select (store (store .cse159 v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse158 (select (select (store (store (store .cse159 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse158 1) (= .cse158 0)))) (= .cse160 0) (= .cse160 1))))) (not (= 2 (select v_arrayElimArr_7 8))))) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_prenex_25) 0)))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse162 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse163 (store .cse162 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse161 (select (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse161 0) (= .cse161 1) (= (select (select (store (store .cse162 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select (store |c_#valid| v_arrayElimCell_16 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse167 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse166 (store .cse167 v_arrayElimCell_17 v_prenex_24))) (let ((.cse164 (select (select (store (store .cse167 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse166 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse165 (select (select (store .cse166 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse164 1) (= .cse165 0) (= .cse164 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse165 1)))))) .cse12) (or (and (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse0 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse168 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse168 1) (= .cse168 0)))))) (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse169 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_17 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= v_prenex_25 v_arrayElimCell_17) (not (= 2 (select v_arrayElimArr_7 8))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse169 1) (= .cse169 0)))) (not (= 0 (select .cse0 v_prenex_25)))))) .cse12) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse171 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse172 (store .cse171 v_arrayElimCell_17 v_prenex_29))) (let ((.cse170 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse170 1) (= .cse170 0) (= (select (select (store (store .cse171 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse172 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= 0 (select (select (store .cse172 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0))))))) .cse12) (or .cse12 (forall ((v_prenex_23 Int) (v_arrayElimCell_17 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse176 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse177 (store .cse176 v_arrayElimCell_17 v_prenex_24)) (.cse174 (store v_prenex_22 8 2))) (let ((.cse173 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24)) (.cse175 (select (select (store .cse177 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store .cse173 v_prenex_23 .cse174) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse175 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse173 v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse176 v_prenex_23 v_prenex_22) v_arrayElimCell_17 (store (select (store .cse177 v_prenex_23 v_prenex_22) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (not (= (select .cse0 v_prenex_23) 0)) (= .cse175 1))))))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_16) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse183 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse182 (store v_prenex_19 8 2)) (.cse181 (store .cse183 v_arrayElimCell_16 v_prenex_21))) (let ((.cse178 (select (select (store (store .cse183 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse181 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse180 (select (select (store (store (store .cse183 v_arrayElimCell_16 v_ArrVal_332) v_arrayElimCell_17 v_prenex_21) v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse179 (select (select (store .cse181 v_prenex_20 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 0 .cse178) (= .cse179 1) (= .cse180 0) (= .cse178 1) (= .cse180 1) (= .cse179 0)))))))) (= v_arrayElimCell_16 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_16) 0)))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_17 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse187 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332)) (.cse185 (store v_prenex_27 8 2))) (let ((.cse186 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse184 (store .cse187 v_arrayElimCell_17 v_prenex_29))) (or (= (select (select (store .cse184 v_prenex_28 .cse185) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 0) (= (select (select (store (store .cse187 v_prenex_28 v_prenex_27) v_arrayElimCell_17 (store (select (store .cse184 v_prenex_28 v_prenex_27) v_arrayElimCell_17) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse186 1) (= 0 (select (select (store .cse184 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (select .cse0 v_prenex_28) 0)))))) .cse12))) is different from true [2025-03-08 04:29:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:27,951 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2025-03-08 04:29:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:29:27,952 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 04:29:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:27,953 INFO L225 Difference]: With dead ends: 77 [2025-03-08 04:29:27,953 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 04:29:27,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=84, Invalid=197, Unknown=3, NotChecked=96, Total=380 [2025-03-08 04:29:27,954 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:27,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 220 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 0 Unknown, 81 Unchecked, 0.6s Time] [2025-03-08 04:29:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 04:29:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-03-08 04:29:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-03-08 04:29:27,966 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2025-03-08 04:29:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:27,967 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-08 04:29:27,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-03-08 04:29:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:29:27,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:27,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:27,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 04:29:28,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 04:29:28,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:28,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:28,169 INFO L85 PathProgramCache]: Analyzing trace with hash 497052059, now seen corresponding path program 1 times [2025-03-08 04:29:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:29:28,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640551578] [2025-03-08 04:29:28,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:28,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:29:28,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:29:28,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:29:28,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:28,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:29:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640551578] [2025-03-08 04:29:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640551578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:28,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:28,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 04:29:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999178093] [2025-03-08 04:29:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:28,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:29:28,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:29:28,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:29:28,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:29:28,354 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:28,508 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-03-08 04:29:28,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:29:28,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 04:29:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:28,509 INFO L225 Difference]: With dead ends: 76 [2025-03-08 04:29:28,509 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 04:29:28,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:29:28,511 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:28,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 117 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:29:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 04:29:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 04:29:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2025-03-08 04:29:28,523 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 18 [2025-03-08 04:29:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:28,523 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2025-03-08 04:29:28,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2025-03-08 04:29:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:29:28,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:28,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:28,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 04:29:28,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:28,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:28,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1486583260, now seen corresponding path program 1 times [2025-03-08 04:29:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:29:28,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572012046] [2025-03-08 04:29:28,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:29:28,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:29:28,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:29:28,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:28,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:29:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572012046] [2025-03-08 04:29:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572012046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:28,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:28,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:29:28,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873787354] [2025-03-08 04:29:28,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:28,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:29:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:29:28,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:29:28,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:29:28,578 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:28,667 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2025-03-08 04:29:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:29:28,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 04:29:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:28,668 INFO L225 Difference]: With dead ends: 50 [2025-03-08 04:29:28,668 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 04:29:28,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:29:28,669 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:28,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:29:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 04:29:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-08 04:29:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2025-03-08 04:29:28,677 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2025-03-08 04:29:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:28,678 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2025-03-08 04:29:28,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2025-03-08 04:29:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:29:28,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:28,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:28,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 04:29:28,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:28,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:28,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1138505770, now seen corresponding path program 1 times [2025-03-08 04:29:28,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:29:28,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4477977] [2025-03-08 04:29:28,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:28,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:29:28,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:29:28,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:29:28,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:28,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:29,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:29:29,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4477977] [2025-03-08 04:29:29,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4477977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:29:29,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117842922] [2025-03-08 04:29:29,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:29,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:29,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:29,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:29:29,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:29:29,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:29:29,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:29:29,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:29,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:29,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 04:29:29,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:29:29,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 04:29:29,357 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:29:29,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-03-08 04:29:29,379 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 04:29:29,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2025-03-08 04:29:29,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 04:29:29,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 04:29:29,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-03-08 04:29:29,414 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 04:29:29,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2025-03-08 04:29:29,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 04:29:29,447 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:29:29,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 04:29:29,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:29,554 INFO L349 Elim1Store]: treesize reduction 255, result has 0.4 percent of original size [2025-03-08 04:29:29,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 486 treesize of output 450 [2025-03-08 04:29:29,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:29,679 INFO L349 Elim1Store]: treesize reduction 139, result has 17.8 percent of original size [2025-03-08 04:29:29,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 469 treesize of output 463 [2025-03-08 04:29:29,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 305 [2025-03-08 04:29:29,993 INFO L349 Elim1Store]: treesize reduction 344, result has 19.1 percent of original size [2025-03-08 04:29:29,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 1248 treesize of output 1217 [2025-03-08 04:29:30,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:30,156 INFO L349 Elim1Store]: treesize reduction 329, result has 25.4 percent of original size [2025-03-08 04:29:30,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 468 [2025-03-08 04:29:30,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 874 treesize of output 688 [2025-03-08 04:29:30,223 INFO L349 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2025-03-08 04:29:30,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 224 [2025-03-08 04:29:30,286 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-03-08 04:29:30,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 46 [2025-03-08 04:29:30,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:30,368 INFO L349 Elim1Store]: treesize reduction 84, result has 19.2 percent of original size [2025-03-08 04:29:30,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 323 [2025-03-08 04:29:30,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2025-03-08 04:29:30,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 42 [2025-03-08 04:29:30,654 INFO L349 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-03-08 04:29:30,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 132 [2025-03-08 04:29:30,716 INFO L349 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2025-03-08 04:29:30,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 46 [2025-03-08 04:29:30,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2025-03-08 04:29:30,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2025-03-08 04:29:30,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2025-03-08 04:29:30,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2025-03-08 04:29:30,857 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-08 04:29:30,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:29:31,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 04:29:31,063 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-08 04:29:31,073 INFO L158 Benchmark]: Toolchain (without parser) took 26251.56ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 131.1MB in the beginning and 278.0MB in the end (delta: -146.9MB). Peak memory consumption was 227.8MB. Max. memory is 16.1GB. [2025-03-08 04:29:31,073 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:29:31,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.01ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 113.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:29:31,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.99ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 111.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:29:31,073 INFO L158 Benchmark]: Boogie Preprocessor took 29.00ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 109.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:29:31,073 INFO L158 Benchmark]: IcfgBuilder took 293.80ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 93.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:29:31,074 INFO L158 Benchmark]: TraceAbstraction took 25580.53ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 92.8MB in the beginning and 278.0MB in the end (delta: -185.2MB). Peak memory consumption was 185.9MB. Max. memory is 16.1GB. [2025-03-08 04:29:31,075 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.01ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 113.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.99ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 111.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.00ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 109.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 293.80ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 93.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25580.53ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 92.8MB in the beginning and 278.0MB in the end (delta: -185.2MB). Peak memory consumption was 185.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-03-08 04:29:31,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:29:32,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:29:32,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 04:29:32,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:29:32,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:29:32,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:29:32,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:29:32,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:29:32,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:29:32,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:29:32,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:29:32,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:29:32,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:29:32,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:29:32,950 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:29:32,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:29:32,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:29:32,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:29:32,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:29:32,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:29:32,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:29:32,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:29:32,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:29:32,951 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 04:29:32,951 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 04:29:32,951 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 04:29:32,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:29:32,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:29:32,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:29:32,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:29:32,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:29:32,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:29:32,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:29:32,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:29:32,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:29:32,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:29:32,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:29:32,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:29:32,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:29:32,953 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 04:29:32,953 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 04:29:32,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:29:32,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:29:32,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:29:32,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:29:32,953 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2025-03-08 04:29:33,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:29:33,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:29:33,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:29:33,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:29:33,202 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:29:33,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2025-03-08 04:29:34,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d9f6da4/62a2b5ae9d724159a6af7f2b0903b656/FLAG3d44c6aaf [2025-03-08 04:29:34,556 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:29:34,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2025-03-08 04:29:34,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d9f6da4/62a2b5ae9d724159a6af7f2b0903b656/FLAG3d44c6aaf [2025-03-08 04:29:34,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d9f6da4/62a2b5ae9d724159a6af7f2b0903b656 [2025-03-08 04:29:34,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:29:34,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:29:34,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:29:34,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:29:34,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:29:34,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:29:34" (1/1) ... [2025-03-08 04:29:34,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae34d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:34, skipping insertion in model container [2025-03-08 04:29:34,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:29:34" (1/1) ... [2025-03-08 04:29:34,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:29:35,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-03-08 04:29:35,106 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-03-08 04:29:35,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-03-08 04:29:35,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-03-08 04:29:35,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-03-08 04:29:35,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-03-08 04:29:35,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:29:35,122 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:29:35,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-03-08 04:29:35,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-03-08 04:29:35,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-03-08 04:29:35,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-03-08 04:29:35,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-03-08 04:29:35,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-03-08 04:29:35,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:29:35,201 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:29:35,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35 WrapperNode [2025-03-08 04:29:35,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:29:35,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:29:35,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:29:35,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:29:35,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,235 INFO L138 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2025-03-08 04:29:35,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:29:35,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:29:35,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:29:35,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:29:35,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,256 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-03-08 04:29:35,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:29:35,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:29:35,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:29:35,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:29:35,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (1/1) ... [2025-03-08 04:29:35,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:29:35,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:35,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:29:35,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 04:29:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:29:35,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:29:35,410 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:29:35,412 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:29:35,945 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 04:29:35,945 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:29:35,952 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:29:35,952 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:29:35,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:29:35 BoogieIcfgContainer [2025-03-08 04:29:35,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:29:35,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:29:35,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:29:35,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:29:35,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:29:34" (1/3) ... [2025-03-08 04:29:35,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f85d6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:29:35, skipping insertion in model container [2025-03-08 04:29:35,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:29:35" (2/3) ... [2025-03-08 04:29:35,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f85d6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:29:35, skipping insertion in model container [2025-03-08 04:29:35,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:29:35" (3/3) ... [2025-03-08 04:29:35,962 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2025-03-08 04:29:35,972 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:29:35,974 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-token-1.i that has 1 procedures, 44 locations, 1 initial locations, 9 loop locations, and 6 error locations. [2025-03-08 04:29:36,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:29:36,013 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@16984b7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:29:36,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 04:29:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:36,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 04:29:36,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:36,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 04:29:36,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:36,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1337638754, now seen corresponding path program 1 times [2025-03-08 04:29:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:29:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114485051] [2025-03-08 04:29:36,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:36,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:36,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:36,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:29:36,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:29:36,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 04:29:36,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 04:29:36,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:36,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:36,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 04:29:36,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:29:36,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 04:29:36,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-03-08 04:29:36,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2025-03-08 04:29:36,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-08 04:29:36,280 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 04:29:36,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-08 04:29:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:36,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:29:36,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:29:36,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114485051] [2025-03-08 04:29:36,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114485051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:36,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:36,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:29:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275516698] [2025-03-08 04:29:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:36,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:29:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:29:36,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:29:36,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:29:36,318 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:37,196 INFO L93 Difference]: Finished difference Result 84 states and 130 transitions. [2025-03-08 04:29:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:29:37,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 04:29:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:37,201 INFO L225 Difference]: With dead ends: 84 [2025-03-08 04:29:37,202 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 04:29:37,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:29:37,205 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:37,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 86 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 04:29:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 04:29:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 04:29:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2025-03-08 04:29:37,225 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2025-03-08 04:29:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:37,225 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2025-03-08 04:29:37,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2025-03-08 04:29:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 04:29:37,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:37,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:37,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:29:37,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:37,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:37,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1482836824, now seen corresponding path program 1 times [2025-03-08 04:29:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:29:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599249076] [2025-03-08 04:29:37,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:37,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:37,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:37,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:29:37,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:29:37,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 04:29:37,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 04:29:37,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:37,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:37,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 04:29:37,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:29:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:37,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:29:37,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:29:37,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599249076] [2025-03-08 04:29:37,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599249076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:37,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:37,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:29:37,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698227837] [2025-03-08 04:29:37,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:37,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:29:37,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:29:37,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:29:37,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:29:37,546 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:37,683 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-03-08 04:29:37,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:29:37,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 04:29:37,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:37,684 INFO L225 Difference]: With dead ends: 57 [2025-03-08 04:29:37,684 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 04:29:37,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:29:37,685 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:37,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 46 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:29:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 04:29:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2025-03-08 04:29:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-03-08 04:29:37,689 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2025-03-08 04:29:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:37,689 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-03-08 04:29:37,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-03-08 04:29:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 04:29:37,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:37,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:37,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:29:37,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:37,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:37,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:37,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1519940054, now seen corresponding path program 1 times [2025-03-08 04:29:37,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:29:37,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1839178458] [2025-03-08 04:29:37,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:37,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:37,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:37,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:29:37,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:29:37,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:29:37,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:29:37,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:37,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:37,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 04:29:37,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:29:37,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 04:29:38,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:38,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2025-03-08 04:29:38,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:38,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 04:29:38,092 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 04:29:38,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-08 04:29:38,105 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:29:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:38,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:29:38,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:29:38,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839178458] [2025-03-08 04:29:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839178458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:38,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:38,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:29:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303188361] [2025-03-08 04:29:38,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:38,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:29:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:29:38,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:29:38,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:29:38,139 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:39,450 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2025-03-08 04:29:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:29:39,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 04:29:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:39,451 INFO L225 Difference]: With dead ends: 74 [2025-03-08 04:29:39,451 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 04:29:39,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:29:39,452 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:39,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 04:29:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 04:29:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2025-03-08 04:29:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-03-08 04:29:39,461 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 12 [2025-03-08 04:29:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:39,461 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-03-08 04:29:39,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-03-08 04:29:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 04:29:39,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:39,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:39,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:29:39,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:39,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:39,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1519960908, now seen corresponding path program 1 times [2025-03-08 04:29:39,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:29:39,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171573028] [2025-03-08 04:29:39,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:39,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:39,666 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:29:39,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:29:39,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:29:39,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:29:39,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:39,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:39,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:29:39,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:29:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:39,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:29:39,768 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:29:39,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171573028] [2025-03-08 04:29:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171573028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:29:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792367386] [2025-03-08 04:29:39,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:39,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:29:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:29:39,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:29:39,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:29:39,769 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:40,040 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2025-03-08 04:29:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:29:40,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 04:29:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:40,042 INFO L225 Difference]: With dead ends: 42 [2025-03-08 04:29:40,042 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 04:29:40,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:29:40,043 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:40,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 04:29:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 04:29:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 04:29:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-03-08 04:29:40,049 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2025-03-08 04:29:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:40,049 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-03-08 04:29:40,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-03-08 04:29:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:29:40,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:40,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:40,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 04:29:40,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:40,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:40,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash 273880422, now seen corresponding path program 1 times [2025-03-08 04:29:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:29:40,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1691797124] [2025-03-08 04:29:40,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:40,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:40,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:40,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:29:40,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:29:40,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:29:40,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:29:40,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:40,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:40,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 04:29:40,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:29:40,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 04:29:40,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:40,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:40,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2025-03-08 04:29:40,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 56 [2025-03-08 04:29:40,446 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:29:40,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 65 [2025-03-08 04:29:40,476 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-08 04:29:40,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 83 [2025-03-08 04:29:40,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 04:29:40,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-08 04:29:40,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-08 04:29:40,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 04:29:40,535 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-03-08 04:29:40,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-03-08 04:29:40,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 04:29:40,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 04:29:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:40,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:29:40,682 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:29:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691797124] [2025-03-08 04:29:40,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691797124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:29:40,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:29:40,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:29:40,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954633205] [2025-03-08 04:29:40,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:29:40,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:29:40,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:29:40,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:29:40,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:29:40,684 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:42,546 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2025-03-08 04:29:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:29:42,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 04:29:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:42,547 INFO L225 Difference]: With dead ends: 50 [2025-03-08 04:29:42,547 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 04:29:42,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:29:42,548 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:42,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 109 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 04:29:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 04:29:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-03-08 04:29:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2025-03-08 04:29:42,557 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 16 [2025-03-08 04:29:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:42,558 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2025-03-08 04:29:42,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2025-03-08 04:29:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:29:42,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:42,559 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:42,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 04:29:42,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:42,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:42,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash -39724975, now seen corresponding path program 1 times [2025-03-08 04:29:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:29:42,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219522483] [2025-03-08 04:29:42,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:42,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:42,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:42,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:29:42,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:29:42,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:29:42,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:29:42,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:42,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:42,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 04:29:42,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:29:42,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 04:29:42,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:29:42,940 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-08 04:29:42,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-03-08 04:29:42,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-03-08 04:29:42,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:42,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 04:29:42,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-03-08 04:29:42,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 04:29:42,979 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:29:43,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:43,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:43,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-03-08 04:29:43,129 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 04:29:43,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 04:29:43,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:43,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:43,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:43,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:29:47,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:29:47,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 100 [2025-03-08 04:29:47,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 148 [2025-03-08 04:29:47,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 106 [2025-03-08 04:29:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:51,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:29:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219522483] [2025-03-08 04:29:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219522483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:29:51,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:29:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-08 04:29:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391600942] [2025-03-08 04:29:51,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:29:51,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 04:29:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:29:51,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 04:29:51,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=47, Unknown=4, NotChecked=0, Total=72 [2025-03-08 04:29:51,949 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:29:56,056 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2025-03-08 04:29:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:29:56,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 04:29:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:29:56,057 INFO L225 Difference]: With dead ends: 58 [2025-03-08 04:29:56,057 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 04:29:56,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=35, Invalid=71, Unknown=4, NotChecked=0, Total=110 [2025-03-08 04:29:56,058 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:29:56,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 149 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 04:29:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 04:29:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-03-08 04:29:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-03-08 04:29:56,063 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2025-03-08 04:29:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:29:56,063 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-08 04:29:56,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:29:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-03-08 04:29:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:29:56,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:29:56,064 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:29:56,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 04:29:56,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:56,265 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:29:56,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:29:56,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1426143647, now seen corresponding path program 1 times [2025-03-08 04:29:56,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:29:56,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123908775] [2025-03-08 04:29:56,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:29:56,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:29:56,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:29:56,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:29:56,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 04:29:56,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:29:56,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:29:56,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:29:56,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:29:56,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 04:29:56,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:29:56,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:29:56,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 04:29:56,408 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:29:56,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-03-08 04:29:56,427 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 04:29:56,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-08 04:29:56,452 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-08 04:29:56,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-03-08 04:29:56,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-03-08 04:29:56,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:56,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 04:29:56,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 62 [2025-03-08 04:29:56,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2025-03-08 04:29:56,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 75 [2025-03-08 04:29:56,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:29:56,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-03-08 04:29:56,627 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 04:29:56,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 04:29:56,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2025-03-08 04:29:56,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 60 [2025-03-08 04:29:56,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2025-03-08 04:29:56,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 58 [2025-03-08 04:29:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:56,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:29:56,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:29:56,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-03-08 04:29:56,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2025-03-08 04:29:56,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2025-03-08 04:29:56,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:29:56,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 115 [2025-03-08 04:29:56,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 177 [2025-03-08 04:29:56,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 128 [2025-03-08 04:29:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:29:57,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:29:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123908775] [2025-03-08 04:29:57,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123908775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:29:57,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:29:57,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 04:29:57,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899212244] [2025-03-08 04:29:57,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:29:57,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:29:57,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:29:57,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:29:57,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=62, Unknown=4, NotChecked=0, Total=90 [2025-03-08 04:29:57,347 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:30:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:30:02,617 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2025-03-08 04:30:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:30:02,618 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 04:30:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:30:02,619 INFO L225 Difference]: With dead ends: 68 [2025-03-08 04:30:02,619 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 04:30:02,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=89, Unknown=4, NotChecked=0, Total=132 [2025-03-08 04:30:02,619 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:30:02,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 179 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-08 04:30:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 04:30:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-03-08 04:30:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:30:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2025-03-08 04:30:02,624 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2025-03-08 04:30:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:30:02,624 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2025-03-08 04:30:02,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:30:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2025-03-08 04:30:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:30:02,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:30:02,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:30:02,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 04:30:02,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:30:02,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:30:02,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:30:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1486583260, now seen corresponding path program 1 times [2025-03-08 04:30:02,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:30:02,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658642269] [2025-03-08 04:30:02,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:30:02,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:30:02,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:30:02,829 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:30:02,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 04:30:02,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:30:02,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:30:02,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:30:02,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:30:02,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:30:02,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:30:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:02,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:30:02,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:30:02,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658642269] [2025-03-08 04:30:02,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658642269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:30:02,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:30:02,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:30:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738612570] [2025-03-08 04:30:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:30:02,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:30:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:30:02,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:30:02,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:30:02,932 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:30:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:30:03,180 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2025-03-08 04:30:03,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:30:03,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 04:30:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:30:03,180 INFO L225 Difference]: With dead ends: 50 [2025-03-08 04:30:03,180 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 04:30:03,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:30:03,181 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:30:03,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:30:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 04:30:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-08 04:30:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:30:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2025-03-08 04:30:03,186 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2025-03-08 04:30:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:30:03,186 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2025-03-08 04:30:03,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:30:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2025-03-08 04:30:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:30:03,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:30:03,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:30:03,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 04:30:03,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:30:03,388 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 04:30:03,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:30:03,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1138505770, now seen corresponding path program 1 times [2025-03-08 04:30:03,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:30:03,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937260691] [2025-03-08 04:30:03,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:30:03,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:30:03,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:30:03,391 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:30:03,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 04:30:03,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:30:03,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:30:03,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:30:03,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:30:03,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 04:30:03,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:30:03,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 04:30:03,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-03-08 04:30:03,526 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 04:30:03,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2025-03-08 04:30:03,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 04:30:03,572 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-08 04:30:03,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-03-08 04:30:03,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-03-08 04:30:03,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:03,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 04:30:03,602 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:30:03,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:03,728 INFO L349 Elim1Store]: treesize reduction 195, result has 0.5 percent of original size [2025-03-08 04:30:03,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 275 treesize of output 253 [2025-03-08 04:30:03,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:03,869 INFO L349 Elim1Store]: treesize reduction 103, result has 17.6 percent of original size [2025-03-08 04:30:03,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 234 treesize of output 238 [2025-03-08 04:30:03,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:03,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:03,980 INFO L349 Elim1Store]: treesize reduction 62, result has 16.2 percent of original size [2025-03-08 04:30:03,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 155 [2025-03-08 04:30:03,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 93 [2025-03-08 04:30:04,056 INFO L349 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2025-03-08 04:30:04,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2025-03-08 04:30:04,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-03-08 04:30:04,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 99 [2025-03-08 04:30:04,105 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2025-03-08 04:30:04,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 12 [2025-03-08 04:30:04,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-03-08 04:30:04,129 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2025-03-08 04:30:04,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 20 [2025-03-08 04:30:04,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2025-03-08 04:30:04,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:30:04,170 INFO L349 Elim1Store]: treesize reduction 195, result has 0.5 percent of original size [2025-03-08 04:30:04,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 278 treesize of output 258 [2025-03-08 04:30:04,361 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:30:04,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2025-03-08 04:30:04,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 04:30:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:04,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:30:04,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:04,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2025-03-08 04:30:04,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:04,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 81 [2025-03-08 04:30:04,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:04,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 900 treesize of output 836 [2025-03-08 04:30:04,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:04,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 406 treesize of output 400 [2025-03-08 04:30:04,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 118 [2025-03-08 04:30:04,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 117 [2025-03-08 04:30:04,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 04:30:04,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 04:30:05,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:05,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 577 treesize of output 458 [2025-03-08 04:30:05,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:05,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 449 treesize of output 338 [2025-03-08 04:30:05,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:05,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65482 treesize of output 50933 [2025-03-08 04:30:05,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:05,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21166 treesize of output 18065 [2025-03-08 04:30:05,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:05,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3457 treesize of output 3142 [2025-03-08 04:30:05,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:05,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3133 treesize of output 2834 [2025-03-08 04:30:05,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:05,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2825 treesize of output 2834 [2025-03-08 04:30:05,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:05,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2809 treesize of output 2794 [2025-03-08 04:30:06,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2785 treesize of output 2749 [2025-03-08 04:30:06,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:06,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2749 treesize of output 2722 [2025-03-08 04:30:06,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2713 treesize of output 2701 [2025-03-08 04:30:06,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:06,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2701 treesize of output 2666 [2025-03-08 04:30:06,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2641 treesize of output 2593 [2025-03-08 04:30:06,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:06,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2593 treesize of output 2550 [2025-03-08 04:30:06,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:06,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2525 treesize of output 2270 [2025-03-08 04:30:06,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2245 treesize of output 2197 [2025-03-08 04:30:06,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:30:06,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2197 treesize of output 2166 [2025-03-08 04:30:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:30:29,305 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:30:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937260691] [2025-03-08 04:30:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937260691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:30:29,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:30:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-08 04:30:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083511933] [2025-03-08 04:30:29,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:30:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:30:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:30:29,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:30:29,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:30:29,306 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)