./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/pcompf.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/config/KojakReach.xml -i ../../sv-benchmarks/c/array-fpi/pcompf.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f995d1a14a0e61f10b2f5817b1ff2bf8d1511dbe7297ad48450a11ed6f3a9160 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:57:49,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:57:49,116 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-11-24 22:57:49,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:57:49,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-11-24 22:57:49,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:57:49,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:57:49,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-11-24 22:57:49,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:57:49,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:57:49,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:57:49,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 22:57:49,153 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:57:49,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:57:49,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:57:49,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:57:49,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 22:57:49,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:57:49,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 22:57:49,158 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:57:49,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 22:57:49,159 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:57:49,160 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-11-24 22:57:49,160 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-11-24 22:57:49,161 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-11-24 22:57:49,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:57:49,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-24 22:57:49,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:57:49,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:57:49,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 22:57:49,164 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-11-24 22:57:49,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 22:57:49,165 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 22:57:49,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi 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 -> Kojak 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 -> f995d1a14a0e61f10b2f5817b1ff2bf8d1511dbe7297ad48450a11ed6f3a9160 [2023-11-24 22:57:49,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:57:49,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:57:49,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:57:49,444 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:57:49,444 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:57:49,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/../../sv-benchmarks/c/array-fpi/pcompf.c [2023-11-24 22:57:52,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:57:52,853 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:57:52,854 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/sv-benchmarks/c/array-fpi/pcompf.c [2023-11-24 22:57:52,862 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/data/d731f46ea/0d2c2d53503f4959bd00339ae1e8fade/FLAG87acecb58 [2023-11-24 22:57:52,878 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/data/d731f46ea/0d2c2d53503f4959bd00339ae1e8fade [2023-11-24 22:57:52,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:57:52,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:57:52,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:57:52,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:57:52,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:57:52,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:57:52" (1/1) ... [2023-11-24 22:57:52,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4add721e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:52, skipping insertion in model container [2023-11-24 22:57:52,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:57:52" (1/1) ... [2023-11-24 22:57:52,915 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:57:53,102 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/sv-benchmarks/c/array-fpi/pcompf.c[589,602] [2023-11-24 22:57:53,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:57:53,136 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:57:53,149 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/sv-benchmarks/c/array-fpi/pcompf.c[589,602] [2023-11-24 22:57:53,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:57:53,173 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:57:53,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53 WrapperNode [2023-11-24 22:57:53,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:57:53,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:57:53,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:57:53,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:57:53,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,214 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2023-11-24 22:57:53,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:57:53,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:57:53,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:57:53,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:57:53,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:57:53,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:57:53,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:57:53,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:57:53,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-24 22:57:53,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/z3 [2023-11-24 22:57:53,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-11-24 22:57:53,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3f33dbd-400b-4f7c-884a-6e7354d74ec1/bin/ukojak-verify-afCqCEvfdi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-11-24 22:57:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:57:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 22:57:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 22:57:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 22:57:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:57:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:57:53,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 22:57:53,413 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:57:53,415 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:57:53,604 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:57:53,692 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:57:53,696 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-24 22:57:53,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:57:53 BoogieIcfgContainer [2023-11-24 22:57:53,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:57:53,700 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-11-24 22:57:53,700 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-11-24 22:57:53,708 INFO L274 PluginConnector]: CodeCheck initialized [2023-11-24 22:57:53,708 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:57:53" (1/1) ... [2023-11-24 22:57:53,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:57:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:57:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2023-11-24 22:57:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2023-11-24 22:57:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 22:57:53,768 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:57:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:57:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:57:54,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-24 22:57:54,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:57:54,131 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2023-11-24 22:57:54,146 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:54,148 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2023-11-24 22:57:54,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-11-24 22:57:54,211 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 [2023-11-24 22:57:54,216 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:54,217 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2023-11-24 22:57:54,260 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-24 22:57:54,261 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 1 case distinctions, treesize of input 14 treesize of output 19 [2023-11-24 22:57:54,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:57:54,276 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-24 22:57:54,277 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2023-11-24 22:57:54,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:57:54,295 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-24 22:57:54,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-24 22:57:54,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:57:54,313 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-24 22:57:54,314 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2023-11-24 22:57:54,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:57:54,324 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-24 22:57:54,324 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2023-11-24 22:57:54,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:57:54,342 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-24 22:57:54,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-24 22:57:54,351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-24 22:57:54,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2023-11-24 22:57:54,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 44 treesize of output 23 [2023-11-24 22:57:54,377 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:54,378 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2023-11-24 22:57:54,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:57:54,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2023-11-24 22:57:54,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:57:54,408 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 15 treesize of output 1 [2023-11-24 22:57:54,430 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-24 22:57:54,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2023-11-24 22:57:54,469 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 0 case distinctions, treesize of input 49 treesize of output 23 [2023-11-24 22:57:54,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:57:54,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2023-11-24 22:57:54,486 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2023-11-24 22:57:54,492 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:54,493 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2023-11-24 22:57:54,500 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-24 22:57:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:57:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:57:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 17 states and 33 transitions. [2023-11-24 22:57:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 33 transitions. [2023-11-24 22:57:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-24 22:57:54,712 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:57:54,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:57:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:57:54,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:57:54,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:57:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:57:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:57:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 20 states and 46 transitions. [2023-11-24 22:57:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 46 transitions. [2023-11-24 22:57:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-24 22:57:55,298 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:57:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:57:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:57:55,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:57:55,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:57:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:57:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:57:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 21 states and 49 transitions. [2023-11-24 22:57:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 49 transitions. [2023-11-24 22:57:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-24 22:57:55,546 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:57:55,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:57:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:57:55,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:57:55,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:57:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:57:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:57:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 24 states and 62 transitions. [2023-11-24 22:57:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 62 transitions. [2023-11-24 22:57:56,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 22:57:56,269 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:57:56,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:57:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:57:56,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:57:56,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:57:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:57:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:57:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 25 states and 65 transitions. [2023-11-24 22:57:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 65 transitions. [2023-11-24 22:57:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 22:57:56,608 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:57:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:57:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:57:56,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:57:56,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:57:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:57:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:57:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 27 states and 70 transitions. [2023-11-24 22:57:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 70 transitions. [2023-11-24 22:57:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 22:57:56,847 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:57:56,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:57:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:57:56,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 22:57:56,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:57:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:57:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:57:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 31 states and 78 transitions. [2023-11-24 22:57:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 78 transitions. [2023-11-24 22:57:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 22:57:57,391 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:57:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:57:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:57:57,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 22:57:57,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:57:57,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-24 22:57:57,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2023-11-24 22:57:57,506 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:57,507 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2023-11-24 22:57:57,514 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:57,515 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2023-11-24 22:57:57,532 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-24 22:57:57,533 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 66 treesize of output 62 [2023-11-24 22:57:57,561 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-24 22:57:57,566 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:57,567 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 92 [2023-11-24 22:57:57,575 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 30 treesize of output 1 [2023-11-24 22:57:57,602 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-24 22:57:57,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2023-11-24 22:57:57,615 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:57,617 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84 [2023-11-24 22:57:57,623 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 93 treesize of output 83 [2023-11-24 22:57:57,630 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 30 treesize of output 1 [2023-11-24 22:57:57,649 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-24 22:57:57,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2023-11-24 22:57:57,662 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 0 case distinctions, treesize of input 49 treesize of output 23 [2023-11-24 22:57:57,668 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 [2023-11-24 22:57:57,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-24 22:57:57,696 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 22:57:57,697 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 22:57:57,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2023-11-24 22:57:57,702 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:57,703 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2023-11-24 22:57:57,736 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:57,737 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2023-11-24 22:57:57,759 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-24 22:57:57,759 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 66 treesize of output 62 [2023-11-24 22:57:57,787 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-24 22:57:57,791 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:57:57,792 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2023-11-24 22:57:57,801 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 1 [2023-11-24 22:57:57,839 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 14 treesize of output 12 [2023-11-24 22:57:58,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:57:58,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:57:58,065 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 22:57:58,075 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 [2023-11-24 22:57:58,169 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 [2023-11-24 22:57:58,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 25 [2023-11-24 22:57:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:57:58,679 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (= (select .cse2 0) 0)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (and (not (and (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (or (and .cse0 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse2) (= v_DerPreprocessor_12 .cse1))))) .cse3 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) .cse0 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse3 (<= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-11-24 22:57:58,802 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (= (select .cse2 0) 0)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (and (not (and (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (or (and .cse0 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse2) (= v_DerPreprocessor_12 .cse1))))) .cse3 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) .cse0 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse3 (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from true [2023-11-24 22:57:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:57:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 36 states and 94 transitions. [2023-11-24 22:57:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 94 transitions. [2023-11-24 22:57:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 22:57:59,839 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:57:59,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:57:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:57:59,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 22:57:59,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:57:59,936 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 14 treesize of output 12 [2023-11-24 22:57:59,950 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-24 22:57:59,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2023-11-24 22:57:59,966 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 0 case distinctions, treesize of input 49 treesize of output 23 [2023-11-24 22:57:59,972 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 [2023-11-24 22:57:59,986 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-24 22:57:59,993 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 22:57:59,995 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-11-24 22:57:59,999 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:00,000 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2023-11-24 22:58:00,006 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:00,007 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2023-11-24 22:58:00,024 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-24 22:58:00,026 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 66 treesize of output 62 [2023-11-24 22:58:00,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:58:00,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:58:00,254 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-11-24 22:58:00,262 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 35 treesize of output 38 [2023-11-24 22:58:00,295 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 [2023-11-24 22:58:00,331 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 [2023-11-24 22:58:00,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 25 [2023-11-24 22:58:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:58:00,421 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (= (select .cse3 0) 0))) (let ((.cse1 (and .cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse0 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (not (and .cse0 (or .cse1 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse3) (= v_DerPreprocessor_12 .cse2))))) .cse4 .cse5)) (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse3 (store (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse1) .cse0 .cse7 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2023-11-24 22:58:00,585 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (= (select .cse3 0) 0))) (let ((.cse1 (and .cse6 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse0 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (not (and .cse0 (or .cse1 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse3) (= v_DerPreprocessor_12 .cse2))))) .cse4 .cse5)) .cse6 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse4 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse3 (store (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse1) .cse0 .cse4 .cse5)) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2023-11-24 22:58:00,593 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (= (select .cse3 0) 0))) (let ((.cse1 (and .cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse0 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (not (and .cse0 (or .cse1 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse3) (= v_DerPreprocessor_12 .cse2))))) .cse4 .cse5)) (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse3 (store (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse1) .cse0 .cse7 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 (<= |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from true [2023-11-24 22:58:00,601 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (= (select .cse3 0) 0))) (let ((.cse1 (and .cse6 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse0 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (not (and .cse0 (or .cse1 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse3) (= v_DerPreprocessor_12 .cse2))))) .cse4 .cse5)) .cse6 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse4 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse3 (store (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse1) .cse0 .cse4 .cse5)) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from true [2023-11-24 22:58:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:58:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 37 states and 102 transitions. [2023-11-24 22:58:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 102 transitions. [2023-11-24 22:58:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 22:58:00,634 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:58:00,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:58:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:58:00,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 22:58:00,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:58:00,727 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-24 22:58:00,731 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:00,733 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2023-11-24 22:58:00,740 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 1 [2023-11-24 22:58:00,760 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-24 22:58:00,763 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:00,764 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2023-11-24 22:58:00,770 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 1 [2023-11-24 22:58:00,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-24 22:58:00,795 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:00,795 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2023-11-24 22:58:00,802 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 1 [2023-11-24 22:58:00,815 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-24 22:58:00,819 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:00,820 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 92 [2023-11-24 22:58:00,826 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 30 treesize of output 1 [2023-11-24 22:58:00,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-24 22:58:00,850 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:00,851 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2023-11-24 22:58:00,856 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 1 [2023-11-24 22:58:00,868 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-24 22:58:00,873 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:00,875 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2023-11-24 22:58:00,881 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 1 [2023-11-24 22:58:00,908 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 14 treesize of output 12 [2023-11-24 22:58:11,160 WARN L293 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 22:58:11,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:58:11,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:58:11,194 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-11-24 22:58:11,201 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 29 treesize of output 32 [2023-11-24 22:58:11,209 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 [2023-11-24 22:58:11,304 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 [2023-11-24 22:58:11,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 25 [2023-11-24 22:58:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:58:11,399 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (= (select .cse1 0) 0)) (.cse3 (not .cse0))) (let ((.cse5 (and .cse9 .cse3)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or (and .cse0 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse2))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) (not (and .cse4 (or .cse5 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse1) (= v_DerPreprocessor_12 .cse6))))) .cse7 .cse8)) .cse4 .cse9 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 (store (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse5) .cse4 .cse7 .cse8)) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2023-11-24 22:58:21,998 WARN L293 SmtUtils]: Spent 10.38s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 22:58:22,007 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (= (select .cse3 0) 0)) (.cse8 (not .cse6))) (let ((.cse1 (and .cse9 .cse8)) (.cse0 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (not (and .cse0 (or .cse1 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse3) (= v_DerPreprocessor_12 .cse2))))) .cse4 .cse5)) (not (and (or (and .cse6 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse3 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse7))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse3 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse8)) .cse0 .cse4 .cse5)) .cse9 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse4 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse3 (store (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse1) .cse0 .cse4 .cse5)) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2023-11-24 22:58:22,022 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (= (select .cse1 0) 0)) (.cse3 (not .cse0))) (let ((.cse5 (and .cse9 .cse3)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or (and .cse0 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse2))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) (not (and .cse4 (or .cse5 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse1) (= v_DerPreprocessor_12 .cse6))))) .cse7 .cse8)) .cse4 .cse9 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 (store (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse5) .cse4 .cse7 .cse8)) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from true [2023-11-24 22:58:22,034 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (= (select .cse3 0) 0)) (.cse8 (not .cse6))) (let ((.cse1 (and .cse9 .cse8)) (.cse0 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (not (and .cse0 (or .cse1 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse3) (= v_DerPreprocessor_12 .cse2))))) .cse4 .cse5)) (not (and (or (and .cse6 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse3 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse7))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse3 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse8)) .cse0 .cse4 .cse5)) .cse9 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse4 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse3 (store (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse1) .cse0 .cse4 .cse5)) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from true [2023-11-24 22:58:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:58:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 38 states and 110 transitions. [2023-11-24 22:58:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 110 transitions. [2023-11-24 22:58:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 22:58:22,057 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:58:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:58:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:58:22,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 22:58:22,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:58:22,131 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 14 treesize of output 12 [2023-11-24 22:58:22,144 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-24 22:58:22,148 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:22,149 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2023-11-24 22:58:22,156 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 1 [2023-11-24 22:58:22,176 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-24 22:58:22,180 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:22,181 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 92 [2023-11-24 22:58:22,189 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 30 treesize of output 1 [2023-11-24 22:58:32,859 WARN L293 SmtUtils]: Spent 10.41s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 22:58:32,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:58:32,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:58:32,890 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-11-24 22:58:32,896 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 29 treesize of output 32 [2023-11-24 22:58:32,902 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 [2023-11-24 22:58:32,977 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 [2023-11-24 22:58:33,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 25 [2023-11-24 22:58:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:58:33,079 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (= (select .cse1 0) 0)) (.cse3 (not .cse0))) (let ((.cse5 (and .cse10 .cse3)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or (and .cse0 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse2))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) (not (and .cse4 (or .cse5 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse1) (= v_DerPreprocessor_12 .cse6))))) .cse7 .cse8)) (or (and (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= .cse9 v_DerPreprocessor_47)))) .cse0) (and (exists ((v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) .cse4 .cse10 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 (store (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse5) .cse4 .cse7 .cse8)) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2023-11-24 22:58:43,388 WARN L293 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 22:58:43,406 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (= (select .cse1 0) 0)) (.cse3 (not .cse0))) (let ((.cse5 (and .cse9 .cse3)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or (and .cse0 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse2))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) (not (and .cse4 (or .cse5 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse1) (= v_DerPreprocessor_12 .cse6))))) .cse7 .cse8)) .cse4 .cse9 (not (and (or (and (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= .cse10 v_DerPreprocessor_47)))) .cse0) (and (exists ((v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) .cse4 .cse7 .cse8)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 (store (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse5) .cse4 .cse7 .cse8)) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2023-11-24 22:58:43,430 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (= (select .cse1 0) 0)) (.cse3 (not .cse0))) (let ((.cse5 (and .cse10 .cse3)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or (and .cse0 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse2))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) (not (and .cse4 (or .cse5 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse1) (= v_DerPreprocessor_12 .cse6))))) .cse7 .cse8)) (or (and (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= .cse9 v_DerPreprocessor_47)))) .cse0) (and (exists ((v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) .cse4 .cse10 (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 (store (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse5) .cse4 .cse7 .cse8)) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from true [2023-11-24 22:58:43,445 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (= (select .cse1 0) 0)) (.cse3 (not .cse0))) (let ((.cse5 (and .cse9 .cse3)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or (and .cse0 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse2))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) (not (and .cse4 (or .cse5 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse1) (= v_DerPreprocessor_12 .cse6))))) .cse7 .cse8)) .cse4 .cse9 (not (and (or (and (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= .cse10 v_DerPreprocessor_47)))) .cse0) (and (exists ((v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) .cse4 .cse7 .cse8)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 (store (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse5) .cse4 .cse7 .cse8)) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from true [2023-11-24 22:58:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:58:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 39 states and 118 transitions. [2023-11-24 22:58:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 118 transitions. [2023-11-24 22:58:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 22:58:43,472 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:58:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:58:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:58:43,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 22:58:43,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:58:43,534 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 14 treesize of output 12 [2023-11-24 22:58:43,548 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-24 22:58:43,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2023-11-24 22:58:43,560 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 0 case distinctions, treesize of input 49 treesize of output 23 [2023-11-24 22:58:43,565 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 [2023-11-24 22:58:43,578 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-24 22:58:43,584 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 22:58:43,587 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-11-24 22:58:43,590 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:43,591 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2023-11-24 22:58:43,595 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:43,596 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2023-11-24 22:58:43,618 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-24 22:58:43,619 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 66 treesize of output 62 [2023-11-24 22:58:43,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:58:43,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:58:43,919 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-11-24 22:58:43,926 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 35 treesize of output 38 [2023-11-24 22:58:43,937 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 [2023-11-24 22:58:43,981 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 [2023-11-24 22:58:44,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 25 [2023-11-24 22:58:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:58:44,095 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (= (select .cse2 0) 0)) (.cse5 (not .cse3))) (let ((.cse0 (and .cse10 .cse5)) (.cse6 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse8 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or .cse0 (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_arrayElimArr_43 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_43))) (and (= v_DerPreprocessor_50 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_43 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= .cse2 (store (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)))))) (or (and .cse3 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse2 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse4))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse2 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse5)) (not (and .cse6 (or .cse0 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse2) (= v_DerPreprocessor_12 .cse7))))) .cse8 .cse9)) .cse6 .cse10 (not (and (or (and (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse2 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= .cse11 v_DerPreprocessor_47)))) .cse3) (and (exists ((v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (= .cse2 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse5)) .cse6 .cse8 .cse9)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse8 .cse9 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 (store (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse0) .cse6 .cse8 .cse9)) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2023-11-24 22:58:44,345 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (= (select .cse1 0) 0)) (.cse3 (not .cse0))) (let ((.cse5 (and .cse10 .cse3)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or (and .cse0 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse2))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) (not (and .cse4 (or .cse5 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse1) (= v_DerPreprocessor_12 .cse6))))) .cse7 .cse8)) (not (and (or .cse5 (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_arrayElimArr_43 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_43))) (and (= v_DerPreprocessor_50 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_43 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= .cse1 (store (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)))))) .cse4 .cse7 .cse8)) .cse4 .cse10 (not (and (or (and (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= .cse11 v_DerPreprocessor_47)))) .cse0) (and (exists ((v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) .cse4 .cse7 .cse8)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 (store (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse5) .cse4 .cse7 .cse8)) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2023-11-24 22:58:44,372 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse3 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (= (select .cse2 0) 0)) (.cse5 (not .cse3))) (let ((.cse0 (and .cse10 .cse5)) (.cse6 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse8 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse9 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or .cse0 (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_arrayElimArr_43 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_43))) (and (= v_DerPreprocessor_50 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_43 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= .cse2 (store (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)))))) (or (and .cse3 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse2 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse4))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse2 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse5)) (not (and .cse6 (or .cse0 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse2) (= v_DerPreprocessor_12 .cse7))))) .cse8 .cse9)) .cse6 .cse10 (not (and (or (and (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse2 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= .cse11 v_DerPreprocessor_47)))) .cse3) (and (exists ((v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (= .cse2 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse5)) .cse6 .cse8 .cse9)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse8 .cse9 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 (store (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse0) .cse6 .cse8 .cse9)) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from true [2023-11-24 22:58:44,390 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (= (select .cse1 0) 0)) (.cse3 (not .cse0))) (let ((.cse5 (and .cse10 .cse3)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or (and .cse0 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse2))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) (not (and .cse4 (or .cse5 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse1) (= v_DerPreprocessor_12 .cse6))))) .cse7 .cse8)) (not (and (or .cse5 (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_arrayElimArr_43 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_43))) (and (= v_DerPreprocessor_50 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_43 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= .cse1 (store (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)))))) .cse4 .cse7 .cse8)) .cse4 .cse10 (not (and (or (and (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= .cse11 v_DerPreprocessor_47)))) .cse0) (and (exists ((v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) .cse4 .cse7 .cse8)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 (store (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse5) .cse4 .cse7 .cse8)) (<= |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from true [2023-11-24 22:58:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-24 22:58:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 40 states and 126 transitions. [2023-11-24 22:58:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 126 transitions. [2023-11-24 22:58:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 22:58:44,418 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-24 22:58:44,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:58:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:58:44,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-24 22:58:44,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:58:44,482 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-24 22:58:44,485 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:44,486 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2023-11-24 22:58:44,492 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 1 [2023-11-24 22:58:44,511 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-24 22:58:44,514 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:44,515 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2023-11-24 22:58:44,521 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 1 [2023-11-24 22:58:44,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-24 22:58:44,548 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:44,549 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2023-11-24 22:58:44,555 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 1 [2023-11-24 22:58:44,570 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-24 22:58:44,573 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:44,574 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 92 [2023-11-24 22:58:44,581 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 30 treesize of output 1 [2023-11-24 22:58:44,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-24 22:58:44,608 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:44,609 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2023-11-24 22:58:44,614 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 1 [2023-11-24 22:58:44,645 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-24 22:58:44,648 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:58:44,649 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2023-11-24 22:58:44,657 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 1 [2023-11-24 22:58:44,685 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 14 treesize of output 12 [2023-11-24 22:58:55,364 WARN L293 SmtUtils]: Spent 10.39s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 22:58:55,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:58:55,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:58:55,396 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-11-24 22:58:55,402 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 29 treesize of output 32 [2023-11-24 22:58:55,407 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 [2023-11-24 22:58:55,481 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 [2023-11-24 22:58:55,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 25 [2023-11-24 22:58:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:58:55,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse11 (= (select .cse1 0) 0)) (.cse3 (not .cse0))) (let ((.cse5 (and .cse11 .cse3)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or (and .cse0 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= v_DerPreprocessor_36 .cse2))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) (not (and .cse4 (or .cse5 (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0) .cse1) (= v_DerPreprocessor_12 .cse6))))) .cse7 .cse8)) (or (and (exists ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3) (and .cse0 (exists ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_61 .cse9) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))))))) (not (and (or .cse5 (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_arrayElimArr_43 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_43))) (and (= v_DerPreprocessor_50 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_43 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= .cse1 (store (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)))))) .cse4 .cse7 .cse8)) .cse4 .cse11 (not (and (or (and (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= .cse12 v_DerPreprocessor_47)))) .cse0) (and (exists ((v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (= .cse1 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) |c_ULTIMATE.start_main_~c~0#1.base|) 0 0))) .cse3)) .cse4 .cse7 .cse8)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) .cse7 .cse8 (not (and (or (exists ((v_arrayElimArr_25 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_25))) (and (= v_DerPreprocessor_25 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 (store (select .cse13 |c_ULTIMATE.start_main_~c~0#1.base|) 0 0)) (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)))) .cse5) .cse4 .cse7 .cse8)) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false