./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-patterns/array1_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 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_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/config/KojakReach.xml -i ../../sv-benchmarks/c/array-patterns/array1_pattern.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2 --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 f9fbee177c3231db1a1e3277e649158ac81edd180968ad454e1d0751d0f1d4e9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 18:26:14,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 18:26:15,055 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-11-21 18:26:15,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 18:26:15,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-11-21 18:26:15,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 18:26:15,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 18:26:15,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-11-21 18:26:15,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 18:26:15,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 18:26:15,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 18:26:15,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 18:26:15,093 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 18:26:15,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 18:26:15,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 18:26:15,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 18:26:15,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 18:26:15,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 18:26:15,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 18:26:15,096 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 18:26:15,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 18:26:15,101 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 18:26:15,101 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-11-21 18:26:15,101 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-11-21 18:26:15,102 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-11-21 18:26:15,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 18:26:15,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-21 18:26:15,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 18:26:15,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 18:26:15,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 18:26:15,106 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-11-21 18:26:15,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 18:26:15,107 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 18:26:15,108 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_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/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_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2 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 -> f9fbee177c3231db1a1e3277e649158ac81edd180968ad454e1d0751d0f1d4e9 [2023-11-21 18:26:15,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 18:26:15,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 18:26:15,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 18:26:15,381 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 18:26:15,382 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 18:26:15,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/../../sv-benchmarks/c/array-patterns/array1_pattern.c [2023-11-21 18:26:18,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 18:26:18,712 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 18:26:18,713 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/sv-benchmarks/c/array-patterns/array1_pattern.c [2023-11-21 18:26:18,720 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/data/658fc5961/475497751c0a4ec7b8c7b1225d0a9aff/FLAG808955b56 [2023-11-21 18:26:18,735 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/data/658fc5961/475497751c0a4ec7b8c7b1225d0a9aff [2023-11-21 18:26:18,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 18:26:18,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 18:26:18,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 18:26:18,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 18:26:18,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 18:26:18,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 06:26:18" (1/1) ... [2023-11-21 18:26:18,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec75709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:18, skipping insertion in model container [2023-11-21 18:26:18,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 06:26:18" (1/1) ... [2023-11-21 18:26:18,775 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 18:26:18,946 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_650d6ccc-270c-49c5-ada4-9742c30a95ac/sv-benchmarks/c/array-patterns/array1_pattern.c[1307,1320] [2023-11-21 18:26:18,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 18:26:18,978 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 18:26:18,991 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_650d6ccc-270c-49c5-ada4-9742c30a95ac/sv-benchmarks/c/array-patterns/array1_pattern.c[1307,1320] [2023-11-21 18:26:19,001 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 18:26:19,016 INFO L206 MainTranslator]: Completed translation [2023-11-21 18:26:19,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19 WrapperNode [2023-11-21 18:26:19,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 18:26:19,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 18:26:19,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 18:26:19,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 18:26:19,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,057 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2023-11-21 18:26:19,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 18:26:19,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 18:26:19,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 18:26:19,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 18:26:19,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 18:26:19,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 18:26:19,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 18:26:19,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 18:26:19,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-21 18:26:19,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/z3 [2023-11-21 18:26:19,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-11-21 18:26:19,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_650d6ccc-270c-49c5-ada4-9742c30a95ac/bin/ukojak-verify-i0I2FZA1j2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-11-21 18:26:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 18:26:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-21 18:26:19,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-21 18:26:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 18:26:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 18:26:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 18:26:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 18:26:19,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 18:26:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 18:26:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 18:26:19,262 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 18:26:19,265 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 18:26:19,436 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 18:26:19,501 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 18:26:19,505 INFO L308 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-21 18:26:19,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 06:26:19 BoogieIcfgContainer [2023-11-21 18:26:19,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 18:26:19,509 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-11-21 18:26:19,509 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-11-21 18:26:19,520 INFO L274 PluginConnector]: CodeCheck initialized [2023-11-21 18:26:19,520 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 06:26:19" (1/1) ... [2023-11-21 18:26:19,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 18:26:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:19,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2023-11-21 18:26:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-11-21 18:26:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-21 18:26:19,625 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:19,826 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-21 18:26:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 17 states and 20 transitions. [2023-11-21 18:26:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-11-21 18:26:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 18:26:19,900 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:20,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 18:26:20,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 18:26:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 19 states and 25 transitions. [2023-11-21 18:26:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2023-11-21 18:26:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-21 18:26:20,239 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:20,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 18:26:20,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 26 states and 39 transitions. [2023-11-21 18:26:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 39 transitions. [2023-11-21 18:26:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:20,798 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:20,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 18:26:20,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:20,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:20,983 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 24 treesize of output 32 [2023-11-21 18:26:20,990 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 32 treesize of output 15 [2023-11-21 18:26:20,995 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-21 18:26:21,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2023-11-21 18:26:21,558 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 94 treesize of output 83 [2023-11-21 18:26:21,586 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:21,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 138 [2023-11-21 18:26:21,996 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:22,002 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2023-11-21 18:26:22,608 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:22,616 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:26:22,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:26:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 33 states and 56 transitions. [2023-11-21 18:26:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 56 transitions. [2023-11-21 18:26:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:25,160 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:25,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 18:26:25,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:25,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:25,273 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 24 treesize of output 32 [2023-11-21 18:26:25,277 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:25,279 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-21 18:26:25,285 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 34 treesize of output 33 [2023-11-21 18:26:26,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:26,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:26,193 INFO L349 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-11-21 18:26:26,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2023-11-21 18:26:26,201 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-21 18:26:26,255 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-21 18:26:26,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2023-11-21 18:26:26,278 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:26,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:26,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 140 [2023-11-21 18:26:26,429 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 24 treesize of output 23 [2023-11-21 18:26:26,479 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 21 treesize of output 20 [2023-11-21 18:26:26,684 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-21 18:26:26,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-21 18:26:26,853 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:26,856 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2023-11-21 18:26:27,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:27,760 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:26:27,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:26:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:27,976 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 .cse4 .cse5)) is different from false [2023-11-21 18:26:28,099 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 .cse4 .cse5))) is different from true [2023-11-21 18:26:28,312 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) .cse1 .cse3 (< 0 c_~ARR_SIZE~0) .cse4 .cse5)) is different from false [2023-11-21 18:26:28,442 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) .cse1 .cse3 (< 0 c_~ARR_SIZE~0) .cse4 .cse5))) is different from true [2023-11-21 18:26:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 36 states and 71 transitions. [2023-11-21 18:26:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 71 transitions. [2023-11-21 18:26:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:28,867 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:28,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:28,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-21 18:26:28,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:29,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:29,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-21 18:26:29,908 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 42 treesize of output 21 [2023-11-21 18:26:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 35 states and 71 transitions. [2023-11-21 18:26:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 71 transitions. [2023-11-21 18:26:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:32,561 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:32,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:32,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-21 18:26:32,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:32,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:32,800 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 24 treesize of output 32 [2023-11-21 18:26:32,806 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 32 treesize of output 15 [2023-11-21 18:26:32,810 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-21 18:26:33,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2023-11-21 18:26:33,414 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 94 treesize of output 83 [2023-11-21 18:26:33,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:33,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 138 [2023-11-21 18:26:33,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 181 treesize of output 87 [2023-11-21 18:26:34,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:34,070 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:26:34,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:26:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:34,202 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (<= 1 c_~ARR_SIZE~0) .cse3 .cse4 .cse5)) is different from false [2023-11-21 18:26:34,328 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (= 0 (select .cse6 0))) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 (<= 1 c_~ARR_SIZE~0) .cse3 .cse4 .cse5)) .cse0 .cse1 (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse6 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 .cse4 .cse5))) is different from false [2023-11-21 18:26:34,335 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (<= 1 c_~ARR_SIZE~0) .cse3 .cse4 .cse5))) is different from true [2023-11-21 18:26:34,340 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (= 0 (select .cse6 0))) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 (<= 1 c_~ARR_SIZE~0) .cse3 .cse4 .cse5)) .cse0 .cse1 (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse6 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 .cse4 .cse5)))) is different from true [2023-11-21 18:26:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 36 states and 77 transitions. [2023-11-21 18:26:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 77 transitions. [2023-11-21 18:26:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:34,678 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:34,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-21 18:26:34,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:34,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:34,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-21 18:26:35,090 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 42 treesize of output 21 [2023-11-21 18:26:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:35,153 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5)) is different from false [2023-11-21 18:26:35,158 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (= c_~ARR_SIZE~0 1) .cse4)) .cse4 .cse5))) is different from false [2023-11-21 18:26:35,163 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5))) is different from true [2023-11-21 18:26:35,168 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (= c_~ARR_SIZE~0 1) .cse4)) .cse4 .cse5)))) is different from true [2023-11-21 18:26:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 38 states and 93 transitions. [2023-11-21 18:26:35,313 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 93 transitions. [2023-11-21 18:26:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:35,314 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:35,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:35,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 18:26:35,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:35,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:35,403 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 24 treesize of output 32 [2023-11-21 18:26:35,408 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 32 treesize of output 15 [2023-11-21 18:26:35,414 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-21 18:26:35,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2023-11-21 18:26:35,588 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 94 treesize of output 83 [2023-11-21 18:26:35,596 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:35,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 138 [2023-11-21 18:26:35,730 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:35,731 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2023-11-21 18:26:35,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 181 treesize of output 87 [2023-11-21 18:26:36,174 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:36,180 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:26:36,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:26:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 38 states and 93 transitions. [2023-11-21 18:26:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 93 transitions. [2023-11-21 18:26:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:36,298 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:36,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:36,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-21 18:26:36,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:36,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:36,395 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 24 treesize of output 32 [2023-11-21 18:26:36,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-21 18:26:36,405 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:36,406 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2023-11-21 18:26:37,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:37,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:37,422 INFO L349 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2023-11-21 18:26:37,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2023-11-21 18:26:37,450 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-21 18:26:37,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 41 [2023-11-21 18:26:37,456 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 24 treesize of output 23 [2023-11-21 18:26:37,468 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-21 18:26:37,511 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-21 18:26:37,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2023-11-21 18:26:37,524 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-21 18:26:37,540 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-21 18:26:37,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:37,753 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:26:37,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:26:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:37,946 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse3 (<= 1 c_~ARR_SIZE~0)) (.cse1 (= 0 (select .cse7 0))) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) .cse0 (not (and .cse0 .cse2 .cse3 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse7) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse1 (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse7 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse4 .cse5 .cse6))) is different from false [2023-11-21 18:26:37,954 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse3 (<= 1 c_~ARR_SIZE~0)) (.cse1 (= 0 (select .cse7 0))) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) .cse0 (not (and .cse0 .cse2 .cse3 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse7) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse1 (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse7 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) .cse4 .cse5 .cse6)))) is different from true [2023-11-21 18:26:38,264 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) .cse4 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:26:38,472 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) .cse4 (<= c_~ARR_SIZE~0 1)))) is different from true [2023-11-21 18:26:38,484 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5))) is different from false [2023-11-21 18:26:38,490 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse7 .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5))) is different from false [2023-11-21 18:26:38,498 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5)))) is different from true [2023-11-21 18:26:38,504 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse7 .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse4 .cse5)))) is different from true [2023-11-21 18:26:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 40 states and 109 transitions. [2023-11-21 18:26:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 109 transitions. [2023-11-21 18:26:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:39,189 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:39,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-21 18:26:39,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:39,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:39,276 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 24 treesize of output 32 [2023-11-21 18:26:39,279 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:39,280 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-21 18:26:39,285 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 34 treesize of output 33 [2023-11-21 18:26:40,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:40,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:40,408 INFO L349 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2023-11-21 18:26:40,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2023-11-21 18:26:40,413 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-21 18:26:40,434 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-21 18:26:40,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 41 [2023-11-21 18:26:40,438 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-21 18:26:40,445 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 24 treesize of output 23 [2023-11-21 18:26:40,458 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-21 18:26:40,491 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-21 18:26:40,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2023-11-21 18:26:40,703 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:40,709 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:26:40,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:26:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:41,004 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse1 .cse2 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)))) is different from false [2023-11-21 18:26:41,238 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse1 .cse2 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6))))) is different from true [2023-11-21 18:26:41,560 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse4 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:26:41,827 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse4 (<= c_~ARR_SIZE~0 1)))) is different from true [2023-11-21 18:26:41,840 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5)) is different from false [2023-11-21 18:26:41,846 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse6 .cse4)) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 .cse4 .cse5)) is different from false [2023-11-21 18:26:41,853 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (= c_~ARR_SIZE~0 1) .cse4 .cse5))) is different from true [2023-11-21 18:26:41,859 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse6 .cse4)) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse6 .cse4 .cse5))) is different from true [2023-11-21 18:26:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 43 states and 133 transitions. [2023-11-21 18:26:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 133 transitions. [2023-11-21 18:26:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:42,676 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:42,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 18:26:42,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:42,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:42,740 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 24 treesize of output 32 [2023-11-21 18:26:42,743 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:42,744 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-21 18:26:42,748 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 34 treesize of output 33 [2023-11-21 18:26:43,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:43,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:44,029 INFO L349 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-11-21 18:26:44,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2023-11-21 18:26:44,084 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-21 18:26:44,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2023-11-21 18:26:44,095 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 24 treesize of output 23 [2023-11-21 18:26:44,103 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:44,105 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:44,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 140 [2023-11-21 18:26:44,240 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 21 treesize of output 20 [2023-11-21 18:26:44,403 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-21 18:26:44,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-21 18:26:44,524 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-21 18:26:44,532 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:44,534 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2023-11-21 18:26:45,020 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-21 18:26:45,295 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:45,301 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:26:45,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:26:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:45,339 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= 1 c_~ARR_SIZE~0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 .cse3 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse2 .cse3 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)))) is different from false [2023-11-21 18:26:45,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse1 .cse2 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) (not (and .cse0 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse4 .cse5 .cse6)))) is different from false [2023-11-21 18:26:45,555 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= 1 c_~ARR_SIZE~0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 .cse3 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse2 .cse3 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6))))) is different from true [2023-11-21 18:26:45,562 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse1 .cse2 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) (not (and .cse0 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse4 .cse5 .cse6))))) is different from true [2023-11-21 18:26:45,568 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse4 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:26:45,779 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse4 .cse5)) is different from false [2023-11-21 18:26:45,786 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse4 (<= c_~ARR_SIZE~0 1)))) is different from true [2023-11-21 18:26:45,793 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse4 .cse5))) is different from true [2023-11-21 18:26:45,800 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5))) is different from false [2023-11-21 18:26:45,806 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse6 (= 0 (select .cse2 0))) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse4 .cse5))) is different from false [2023-11-21 18:26:45,813 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5)))) is different from true [2023-11-21 18:26:45,819 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse6 (= 0 (select .cse2 0))) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse4 .cse5)))) is different from true [2023-11-21 18:26:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 46 states and 161 transitions. [2023-11-21 18:26:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 161 transitions. [2023-11-21 18:26:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:46,715 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:46,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-21 18:26:46,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:46,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:46,832 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 24 treesize of output 32 [2023-11-21 18:26:46,838 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-21 18:26:46,841 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:46,841 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2023-11-21 18:26:48,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:48,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:48,131 INFO L349 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2023-11-21 18:26:48,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2023-11-21 18:26:48,136 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-21 18:26:48,142 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 24 treesize of output 23 [2023-11-21 18:26:48,159 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-21 18:26:48,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2023-11-21 18:26:48,169 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-21 18:26:48,206 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-21 18:26:48,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2023-11-21 18:26:48,216 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-21 18:26:48,404 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:48,410 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:26:48,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:26:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:48,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse1 (= 0 (select .cse0 0)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (<= 1 c_~ARR_SIZE~0) .cse3 .cse4 .cse5)) is different from false [2023-11-21 18:26:48,638 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse6 (<= 1 c_~ARR_SIZE~0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse6 .cse3 .cse4 (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse2 .cse6 .cse3 .cse4 .cse5)) .cse5)) is different from false [2023-11-21 18:26:48,645 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse1 (= 0 (select .cse0 0)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (<= 1 c_~ARR_SIZE~0) .cse3 .cse4 .cse5))) is different from true [2023-11-21 18:26:48,650 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse6 (<= 1 c_~ARR_SIZE~0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse6 .cse3 .cse4 (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse2 .cse6 .cse3 .cse4 .cse5)) .cse5))) is different from true [2023-11-21 18:26:48,657 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse1 (not (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and .cse1 .cse2 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 (< 0 c_~ARR_SIZE~0) .cse4 .cse5 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:26:48,893 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse1 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 (< 0 c_~ARR_SIZE~0) .cse5 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:26:48,900 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse1 (not (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and .cse1 .cse2 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 (< 0 c_~ARR_SIZE~0) .cse4 .cse5 (<= c_~ARR_SIZE~0 1)))) is different from true [2023-11-21 18:26:48,905 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse1 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 (< 0 c_~ARR_SIZE~0) .cse5 (<= c_~ARR_SIZE~0 1)))) is different from true [2023-11-21 18:26:48,914 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse0 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 .cse6 .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse1 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5))) is different from false [2023-11-21 18:26:48,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse1 .cse3 .cse7 .cse4)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5))) is different from false [2023-11-21 18:26:48,927 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse0 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 .cse6 .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse1 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5)))) is different from true [2023-11-21 18:26:48,933 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse1 .cse3 .cse7 .cse4)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5)))) is different from true [2023-11-21 18:26:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 49 states and 194 transitions. [2023-11-21 18:26:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 194 transitions. [2023-11-21 18:26:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:49,826 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:49,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:49,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 18:26:49,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:49,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:49,906 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 24 treesize of output 32 [2023-11-21 18:26:49,910 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:49,911 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-21 18:26:49,914 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 34 treesize of output 33 [2023-11-21 18:26:51,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:51,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:51,373 INFO L349 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-11-21 18:26:51,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2023-11-21 18:26:51,419 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-21 18:26:51,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2023-11-21 18:26:51,430 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:51,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:51,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 140 [2023-11-21 18:26:51,554 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 24 treesize of output 23 [2023-11-21 18:26:51,601 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 21 treesize of output 20 [2023-11-21 18:26:51,751 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-21 18:26:51,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-21 18:26:51,818 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-21 18:26:51,902 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:51,905 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2023-11-21 18:26:52,424 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-21 18:26:52,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:52,748 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:26:52,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:26:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:52,779 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse6 (<= 1 c_~ARR_SIZE~0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse6 .cse3 .cse4 (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse2 .cse6 .cse3 .cse4 .cse5)) .cse5)) is different from false [2023-11-21 18:26:52,993 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse6 (<= 1 c_~ARR_SIZE~0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (not (and .cse0 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1))) .cse2 .cse3 .cse4 .cse5)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse6 .cse3 .cse4 (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse2 .cse6 .cse3 .cse4 .cse5)) .cse5)) is different from false [2023-11-21 18:26:53,000 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse6 (<= 1 c_~ARR_SIZE~0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse6 .cse3 .cse4 (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse2 .cse6 .cse3 .cse4 .cse5)) .cse5))) is different from true [2023-11-21 18:26:53,006 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse6 (<= 1 c_~ARR_SIZE~0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (not (and .cse0 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1))) .cse2 .cse3 .cse4 .cse5)) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse6 .cse3 .cse4 (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse2 .cse6 .cse3 .cse4 .cse5)) .cse5))) is different from true [2023-11-21 18:26:53,017 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1))) .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse2 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 (< 0 c_~ARR_SIZE~0) .cse5 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:26:53,240 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and .cse0 (not (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) (not (and .cse0 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1))) .cse2 .cse3 .cse4 .cse5)) .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse2 .cse3 .cse6 .cse4)) (not (and .cse0 .cse2 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse6 .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) .cse4 .cse5)) is different from false [2023-11-21 18:26:53,248 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1))) .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse2 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse3 (< 0 c_~ARR_SIZE~0) .cse5 (<= c_~ARR_SIZE~0 1)))) is different from true [2023-11-21 18:26:53,254 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and .cse0 (not (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0))) (not (and .cse0 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1))) .cse2 .cse3 .cse4 .cse5)) .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse2 .cse3 .cse6 .cse4)) (not (and .cse0 .cse2 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse6 .cse4)) .cse3 (< 0 c_~ARR_SIZE~0) .cse4 .cse5))) is different from true [2023-11-21 18:26:53,265 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse0 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 .cse6 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse1 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5))) is different from false [2023-11-21 18:26:53,272 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse0 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 .cse6 (not (and .cse1 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse2 .cse3 .cse4 .cse5)) .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse1 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5))) is different from false [2023-11-21 18:26:53,281 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse0 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 .cse6 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse1 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5)))) is different from true [2023-11-21 18:26:53,287 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse0 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 .cse6 (not (and .cse1 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse2 .cse3 .cse4 .cse5)) .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse1 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5)))) is different from true [2023-11-21 18:26:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 52 states and 231 transitions. [2023-11-21 18:26:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 231 transitions. [2023-11-21 18:26:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:54,409 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:54,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 18:26:54,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:54,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:54,493 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 24 treesize of output 32 [2023-11-21 18:26:54,496 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:54,496 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-21 18:26:54,501 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 34 treesize of output 33 [2023-11-21 18:26:56,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:56,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:56,065 INFO L349 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-11-21 18:26:56,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2023-11-21 18:26:56,117 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-21 18:26:56,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2023-11-21 18:26:56,128 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 24 treesize of output 23 [2023-11-21 18:26:56,140 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:56,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:56,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 140 [2023-11-21 18:26:56,279 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 21 treesize of output 20 [2023-11-21 18:26:56,458 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-21 18:26:56,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-21 18:26:56,546 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:56,548 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2023-11-21 18:26:56,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:26:56,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:56,688 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:56,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 188 treesize of output 87 [2023-11-21 18:26:57,019 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-21 18:26:57,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:26:57,287 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:26:57,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:26:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:26:57,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3))) .cse6 (not (and .cse0 .cse1 .cse2 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) (not (and .cse0 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse4 .cse5 .cse6)))) is different from false [2023-11-21 18:26:57,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse3 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 .cse2 .cse3 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse4))) .cse5)) .cse6 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse4 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse2 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse3 .cse5 (not (and .cse0 .cse1 .cse6 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse4) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse2 .cse3 .cse5)) (not (and .cse0 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse4) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse2 .cse3 .cse5)))) is different from false [2023-11-21 18:26:57,575 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3))) .cse6 (not (and .cse0 .cse1 .cse2 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)) (not (and .cse0 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse3) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse4 .cse5 .cse6))))) is different from true [2023-11-21 18:26:57,582 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse6 (<= 1 c_~ARR_SIZE~0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse2 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse3 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse1 (not (and .cse0 .cse1 .cse2 .cse3 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse4))) .cse5)) .cse6 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse4 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse2 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse3 .cse5 (not (and .cse0 .cse1 .cse6 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse4) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse2 .cse3 .cse5)) (not (and .cse0 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse4) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse2 .cse3 .cse5))))) is different from true [2023-11-21 18:26:57,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse4 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:26:57,854 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse4 (not (and .cse0 .cse1 .cse3 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse4 .cse5)) .cse5)) is different from false [2023-11-21 18:26:57,863 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse4 (<= c_~ARR_SIZE~0 1)))) is different from true [2023-11-21 18:26:57,869 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= c_~ARR_SIZE~0 1) .cse4)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse4 (not (and .cse0 .cse1 .cse3 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse4 .cse5)) .cse5))) is different from true [2023-11-21 18:26:57,881 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse0 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 .cse6 (not (and .cse1 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse2 .cse3 .cse4 .cse5)) .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse1 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse4 .cse5))) is different from false [2023-11-21 18:26:57,888 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse6 (= 0 (select .cse0 0))) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 .cse6 (not (and .cse1 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse2 .cse3 .cse4 .cse5)) .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse1 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 (not (and .cse1 .cse2 .cse3 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse4 .cse5)) .cse5))) is different from false [2023-11-21 18:26:57,899 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse0 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 .cse6 (not (and .cse1 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse2 .cse3 .cse4 .cse5)) .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse1 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse4 .cse5)))) is different from true [2023-11-21 18:26:57,907 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse6 (= 0 (select .cse0 0))) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse1 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 .cse6 (not (and .cse1 (exists ((v_arrayElimArr_39 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_39) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse2 .cse3 .cse4 .cse5)) .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse1 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse2 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 (not (and .cse1 .cse2 .cse3 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse0))) .cse4 .cse5)) .cse5)))) is different from true [2023-11-21 18:26:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:26:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 55 states and 269 transitions. [2023-11-21 18:26:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 269 transitions. [2023-11-21 18:26:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:26:58,996 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:26:58,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:26:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:26:59,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-21 18:26:59,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:26:59,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:26:59,103 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 24 treesize of output 32 [2023-11-21 18:26:59,106 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:26:59,107 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-21 18:26:59,111 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 34 treesize of output 33 [2023-11-21 18:27:00,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:27:00,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:27:00,700 INFO L349 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2023-11-21 18:27:00,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2023-11-21 18:27:00,718 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-21 18:27:00,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 41 [2023-11-21 18:27:00,723 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 24 treesize of output 23 [2023-11-21 18:27:00,728 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-21 18:27:00,762 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-21 18:27:00,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2023-11-21 18:27:00,778 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-21 18:27:00,784 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-21 18:27:00,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:27:00,980 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:27:00,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:27:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:27:01,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= 1 c_~ARR_SIZE~0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse2 .cse3 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)))) is different from false [2023-11-21 18:27:01,313 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= 1 c_~ARR_SIZE~0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 .cse3 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5 .cse6)) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse2 .cse3 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)))) is different from false [2023-11-21 18:27:01,320 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= 1 c_~ARR_SIZE~0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse2 .cse3 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6))))) is different from true [2023-11-21 18:27:01,329 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= 1 c_~ARR_SIZE~0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 .cse3 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5 .cse6)) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse2 .cse3 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6))))) is different from true [2023-11-21 18:27:01,336 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse4 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse5 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:27:01,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse5 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:27:01,641 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) .cse4 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse5 (<= c_~ARR_SIZE~0 1)))) is different from true [2023-11-21 18:27:01,649 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse5 (<= c_~ARR_SIZE~0 1)))) is different from true [2023-11-21 18:27:01,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse1 .cse3 .cse7 .cse4)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5))) is different from false [2023-11-21 18:27:01,672 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse7 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse6 .cse4)) .cse7 .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse1 .cse3 .cse6 .cse4)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse7 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse6 .cse4)) .cse6 .cse4 .cse5))) is different from false [2023-11-21 18:27:01,681 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse6 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 .cse6 .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse1 .cse3 .cse7 .cse4)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7 .cse4)) .cse7 .cse4 .cse5)))) is different from true [2023-11-21 18:27:01,689 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse7 (= 0 (select .cse2 0))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse6 (= c_~ARR_SIZE~0 1)) (.cse4 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse5 (<= c_~ARR_SIZE~0 1))) (and (not (and .cse0 .cse1 (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse0 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse6 .cse4)) .cse7 .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (and (= (select v_DerPreprocessor_22 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)))) .cse0 .cse1 .cse3 .cse6 .cse4)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (< 0 c_~ARR_SIZE~0) (not (and .cse0 .cse7 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) .cse1 .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse6 .cse4)) .cse6 .cse4 .cse5)))) is different from true [2023-11-21 18:27:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:27:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 58 states and 311 transitions. [2023-11-21 18:27:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 311 transitions. [2023-11-21 18:27:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:27:02,869 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:27:02,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:27:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:27:02,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-21 18:27:02,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:27:02,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:27:03,002 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 24 treesize of output 32 [2023-11-21 18:27:03,007 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 32 treesize of output 15 [2023-11-21 18:27:03,011 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-21 18:27:03,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2023-11-21 18:27:03,358 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 94 treesize of output 83 [2023-11-21 18:27:03,367 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:27:03,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 138 [2023-11-21 18:27:03,500 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:27:03,501 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2023-11-21 18:27:03,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 181 treesize of output 87 [2023-11-21 18:27:03,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:27:03,952 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:27:03,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:27:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:27:03,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= 1 c_~ARR_SIZE~0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 .cse3 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5 .cse6)) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse2 .cse3 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6)))) is different from false [2023-11-21 18:27:03,993 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= 1 c_~ARR_SIZE~0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (= 0 (select .cse1 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 .cse3 (not (and .cse0 .cse2 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5 .cse6)) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse6 (not (and .cse0 .cse2 .cse3 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse4 .cse5 .cse6))))) is different from true [2023-11-21 18:27:04,001 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse5 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:27:04,012 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse5 (<= c_~ARR_SIZE~0 1)))) is different from true [2023-11-21 18:27:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-21 18:27:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 58 states and 311 transitions. [2023-11-21 18:27:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 311 transitions. [2023-11-21 18:27:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 18:27:04,054 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-21 18:27:04,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:27:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:27:04,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 18:27:04,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:27:04,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-21 18:27:04,150 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 24 treesize of output 32 [2023-11-21 18:27:04,152 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:27:04,153 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2023-11-21 18:27:04,157 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 34 treesize of output 33 [2023-11-21 18:27:05,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:27:05,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 18:27:05,972 INFO L349 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-11-21 18:27:05,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2023-11-21 18:27:05,976 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-21 18:27:06,012 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-21 18:27:06,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 100 [2023-11-21 18:27:06,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:27:06,024 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:27:06,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 140 [2023-11-21 18:27:06,140 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 24 treesize of output 23 [2023-11-21 18:27:06,181 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 21 treesize of output 20 [2023-11-21 18:27:06,349 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-21 18:27:06,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-21 18:27:06,424 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-21 18:27:06,497 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 18:27:06,500 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2023-11-21 18:27:07,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 18:27:07,321 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-11-21 18:27:07,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 28 [2023-11-21 18:27:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:27:07,783 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_arrayElimArr_62 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_62) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_62 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse2 .cse3 .cse4 .cse5)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (<= 1 c_~ARR_SIZE~0) (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse5)) is different from false [2023-11-21 18:27:08,185 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (not (and .cse0 (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_arrayElimArr_62 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_62) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_62 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse2 .cse3 .cse4 .cse5)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (< 0 |c_ULTIMATE.start_main_~count~0#1|) .cse2 (<= 1 c_~ARR_SIZE~0) (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 .cse5))) is different from true [2023-11-21 18:27:08,201 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_arrayElimArr_62 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_62) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_62 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and .cse0 .cse2 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (= 0 (select .cse1 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse2 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1))) .cse5 (<= c_~ARR_SIZE~0 1))) is different from false [2023-11-21 18:27:08,491 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~ARR_SIZE~0 1)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse6 (<= c_~ARR_SIZE~0 1))) (and .cse0 (not (and .cse0 .cse1 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (= 0 (select .cse2 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse1 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and .cse0 (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_arrayElimArr_62 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_62) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2) (= (select v_arrayElimArr_62 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse1 .cse3 .cse5 .cse6)) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse2))) .cse5 .cse6)) is different from false [2023-11-21 18:27:08,502 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse4 (= c_~ARR_SIZE~0 1)) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~sum~0#1| 0))) (and .cse0 (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_arrayElimArr_62 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_62) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_62 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (not (and .cse0 .cse2 (exists ((v_arrayElimArr_53 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_53) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) (= 0 (select .cse1 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 0) (not (and .cse0 .cse2 (exists ((v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 .cse4 .cse5)) .cse2 (exists ((v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1) (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) (exists ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0)) (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0))) .cse3 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (< 0 c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int))) (and (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#array1~0#1.base| v_arrayElimArr_46) |c_ULTIMATE.start_main_~#array2~0#1.base|) 0 0) .cse1))) .cse5 (<= c_~ARR_SIZE~0 1)))) is different from true