./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/eqn1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/array-fpi/eqn1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk --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 14bc2dbf7c29b1d0f6a0a1f7aa323adbc9855e56ce7f667c86a31ecee97dcbe0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:39:44,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:39:44,282 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 19:39:44,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:39:44,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:39:44,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:39:44,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:39:44,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 19:39:44,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:39:44,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:39:44,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:39:44,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:39:44,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:39:44,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:39:44,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:39:44,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:39:44,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:39:44,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:39:44,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:39:44,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:39:44,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:39:44,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:39:44,334 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:39:44,334 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:39:44,335 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:39:44,335 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:39:44,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:39:44,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:39:44,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:39:44,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:39:44,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:39:44,353 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:39:44,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:39:44,354 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_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/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_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk 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 -> 14bc2dbf7c29b1d0f6a0a1f7aa323adbc9855e56ce7f667c86a31ecee97dcbe0 [2024-11-08 19:39:44,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:39:44,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:39:44,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:39:44,678 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:39:44,679 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:39:44,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/array-fpi/eqn1.c Unable to find full path for "g++" [2024-11-08 19:39:46,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:39:46,801 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:39:46,802 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/sv-benchmarks/c/array-fpi/eqn1.c [2024-11-08 19:39:46,809 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/data/927706b9d/3489ba38f7c9439285b82614ae71413f/FLAGce34e6c56 [2024-11-08 19:39:46,821 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/data/927706b9d/3489ba38f7c9439285b82614ae71413f [2024-11-08 19:39:46,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:39:46,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:39:46,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:39:46,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:39:46,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:39:46,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:39:46" (1/1) ... [2024-11-08 19:39:46,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0bde9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:46, skipping insertion in model container [2024-11-08 19:39:46,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:39:46" (1/1) ... [2024-11-08 19:39:46,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:39:47,045 WARN L250 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_0daa4382-ed78-4030-ab0a-a02ea2125bcf/sv-benchmarks/c/array-fpi/eqn1.c[587,600] [2024-11-08 19:39:47,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:39:47,078 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:39:47,090 WARN L250 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_0daa4382-ed78-4030-ab0a-a02ea2125bcf/sv-benchmarks/c/array-fpi/eqn1.c[587,600] [2024-11-08 19:39:47,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:39:47,117 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:39:47,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47 WrapperNode [2024-11-08 19:39:47,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:39:47,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:39:47,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:39:47,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:39:47,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,153 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-11-08 19:39:47,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:39:47,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:39:47,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:39:47,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:39:47,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:39:47,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:39:47,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:39:47,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:39:47,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:39:47,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:39:47,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:39:47,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0daa4382-ed78-4030-ab0a-a02ea2125bcf/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:39:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:39:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:39:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 19:39:47,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 19:39:47,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:39:47,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:39:47,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 19:39:47,341 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:39:47,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:39:47,531 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 19:39:47,531 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:39:47,570 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:39:47,571 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:39:47,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:39:47 BoogieIcfgContainer [2024-11-08 19:39:47,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:39:47,572 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:39:47,573 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:39:47,584 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:39:47,584 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:39:47" (1/1) ... [2024-11-08 19:39:47,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:39:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 17 states and 24 transitions. [2024-11-08 19:39:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2024-11-08 19:39:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:39:47,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:39:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:47,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 19:39:47,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:39:48,012 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 19:39:48,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2024-11-08 19:39:48,044 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 [2024-11-08 19:39:48,057 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:39:48,059 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-08 19:39:48,101 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 [2024-11-08 19:39:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 24 states and 40 transitions. [2024-11-08 19:39:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 40 transitions. [2024-11-08 19:39:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:39:48,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 24 states and 38 transitions. [2024-11-08 19:39:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 38 transitions. [2024-11-08 19:39:48,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:39:48,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 24 states and 36 transitions. [2024-11-08 19:39:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 36 transitions. [2024-11-08 19:39:48,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:39:48,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:48,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 29 states and 48 transitions. [2024-11-08 19:39:49,423 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 48 transitions. [2024-11-08 19:39:49,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:39:49,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:49,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 31 states and 52 transitions. [2024-11-08 19:39:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 52 transitions. [2024-11-08 19:39:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:39:49,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:49,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:39:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 29 states and 47 transitions. [2024-11-08 19:39:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 47 transitions. [2024-11-08 19:39:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:39:50,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:50,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:39:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:50,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 19:39:50,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:39:50,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 19:39:50,504 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 [2024-11-08 19:39:50,511 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 [2024-11-08 19:39:50,516 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 [2024-11-08 19:39:50,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:39:50,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:39:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 32 states and 53 transitions. [2024-11-08 19:39:51,181 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 53 transitions. [2024-11-08 19:39:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:39:51,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:51,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:39:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:51,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 19:39:51,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:39:51,337 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 [2024-11-08 19:39:51,346 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 [2024-11-08 19:39:51,353 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 [2024-11-08 19:39:51,357 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 [2024-11-08 19:39:51,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:39:51,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:39:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 33 states and 54 transitions. [2024-11-08 19:39:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 54 transitions. [2024-11-08 19:39:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:39:51,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:51,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 39 states and 64 transitions. [2024-11-08 19:39:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 64 transitions. [2024-11-08 19:39:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:39:52,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 46 states and 80 transitions. [2024-11-08 19:39:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 80 transitions. [2024-11-08 19:39:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:39:53,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 51 states and 88 transitions. [2024-11-08 19:39:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 88 transitions. [2024-11-08 19:39:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:39:54,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 53 states and 94 transitions. [2024-11-08 19:39:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 94 transitions. [2024-11-08 19:39:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:39:55,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:55,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 45 states and 69 transitions. [2024-11-08 19:39:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2024-11-08 19:39:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:39:56,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:56,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:39:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:56,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 19:39:56,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:39:56,622 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 [2024-11-08 19:39:56,634 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 [2024-11-08 19:39:56,639 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 [2024-11-08 19:39:56,644 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 [2024-11-08 19:39:56,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:39:56,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:39:57,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:39:57,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:39:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 52 states and 82 transitions. [2024-11-08 19:40:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 82 transitions. [2024-11-08 19:40:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:40:00,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:00,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:40:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:00,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 19:40:00,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:40:00,684 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-08 19:40:00,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-08 19:40:00,702 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 [2024-11-08 19:40:00,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:40:01,168 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-08 19:40:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 63 states and 103 transitions. [2024-11-08 19:40:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 103 transitions. [2024-11-08 19:40:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:40:07,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:07,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 67 states and 109 transitions. [2024-11-08 19:40:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 109 transitions. [2024-11-08 19:40:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:40:10,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:10,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 70 states and 112 transitions. [2024-11-08 19:40:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 112 transitions. [2024-11-08 19:40:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:40:12,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 77 states and 125 transitions. [2024-11-08 19:40:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 125 transitions. [2024-11-08 19:40:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:40:14,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:40:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 77 states and 123 transitions. [2024-11-08 19:40:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 123 transitions. [2024-11-08 19:40:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:40:15,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:15,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:40:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:15,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 19:40:15,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:40:15,765 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 [2024-11-08 19:40:15,769 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 [2024-11-08 19:40:15,772 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:40:15,773 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2024-11-08 19:40:15,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-11-08 19:40:15,799 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 [2024-11-08 19:40:15,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 14 [2024-11-08 19:40:15,818 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 19:40:15,818 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 22 [2024-11-08 19:40:15,828 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 [2024-11-08 19:40:16,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:40:16,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-08 19:40:16,101 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 [2024-11-08 19:40:16,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:40:16,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:40:16,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:16,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:16,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:17,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse1)) is different from false [2024-11-08 19:40:17,275 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse1))) is different from true [2024-11-08 19:40:17,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse1)) is different from false [2024-11-08 19:40:17,602 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse1))) is different from true [2024-11-08 19:40:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 85 states and 138 transitions. [2024-11-08 19:40:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 138 transitions. [2024-11-08 19:40:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:40:20,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:40:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 84 states and 134 transitions. [2024-11-08 19:40:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2024-11-08 19:40:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:40:21,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:21,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:40:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:21,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 19:40:21,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:40:21,846 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 [2024-11-08 19:40:21,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 19:40:22,067 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:40:22,068 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:40:22,271 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:40:22,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:40:22,786 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 19:40:22,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 19:40:23,043 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 19:40:23,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 51 [2024-11-08 19:40:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 89 states and 141 transitions. [2024-11-08 19:40:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 141 transitions. [2024-11-08 19:40:28,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:40:28,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:28,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:40:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 99 states and 156 transitions. [2024-11-08 19:40:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2024-11-08 19:40:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:40:34,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:34,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 106 states and 171 transitions. [2024-11-08 19:40:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 171 transitions. [2024-11-08 19:40:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:40:39,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 113 states and 182 transitions. [2024-11-08 19:40:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 182 transitions. [2024-11-08 19:40:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:40:43,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 115 states and 190 transitions. [2024-11-08 19:40:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 190 transitions. [2024-11-08 19:40:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:40:46,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:46,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:40:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:47,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 19:40:47,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:40:47,280 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 [2024-11-08 19:40:47,284 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 [2024-11-08 19:40:47,288 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 [2024-11-08 19:40:47,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-11-08 19:40:47,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 19:40:47,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-11-08 19:40:47,324 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 19:40:47,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 19 [2024-11-08 19:40:47,335 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 [2024-11-08 19:40:47,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:40:47,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:40:47,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:40:47,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:40:47,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:47,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:47,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:47,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 119 states and 197 transitions. [2024-11-08 19:40:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 197 transitions. [2024-11-08 19:40:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:40:51,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:40:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:51,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 19:40:51,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:40:51,853 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 [2024-11-08 19:40:51,859 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:40:51,859 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-08 19:40:51,863 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 [2024-11-08 19:40:51,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-11-08 19:40:51,878 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:40:51,879 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2024-11-08 19:40:51,884 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 14 treesize of output 13 [2024-11-08 19:40:51,895 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 [2024-11-08 19:40:52,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:40:52,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-08 19:40:52,237 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 [2024-11-08 19:40:52,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:40:52,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:40:52,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:40:52,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:52,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:52,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:52,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:40:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:52,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2)) is different from false [2024-11-08 19:40:52,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 .cse2)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2)) is different from false [2024-11-08 19:40:52,701 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2))) is different from true [2024-11-08 19:40:52,706 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 .cse2)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2))) is different from true [2024-11-08 19:40:52,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2)) is different from false [2024-11-08 19:40:52,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 .cse2)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2)) is different from false [2024-11-08 19:40:52,719 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2))) is different from true [2024-11-08 19:40:52,724 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 .cse2)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2))) is different from true [2024-11-08 19:40:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 122 states and 205 transitions. [2024-11-08 19:40:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 205 transitions. [2024-11-08 19:40:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:40:53,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:53,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:40:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:53,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 19:40:53,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:40:53,705 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 19:40:53,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 19:40:53,720 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 [2024-11-08 19:40:53,932 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:40:53,932 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:40:53,977 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:40:53,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:40:54,275 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:40:54,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 19:40:54,984 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 19:40:54,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 58 [2024-11-08 19:40:55,307 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-08 19:40:55,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 54 treesize of output 68 [2024-11-08 19:40:55,699 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-08 19:40:55,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 65 treesize of output 71 [2024-11-08 19:40:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 129 states and 215 transitions. [2024-11-08 19:41:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 215 transitions. [2024-11-08 19:41:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:41:05,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:05,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:41:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:05,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-08 19:41:05,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:41:05,224 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 [2024-11-08 19:41:05,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 19:41:05,482 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:41:05,482 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:41:05,522 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:41:05,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:41:05,614 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 19:41:05,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 19:41:05,955 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-08 19:41:05,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 58 [2024-11-08 19:41:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 143 states and 238 transitions. [2024-11-08 19:41:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 238 transitions. [2024-11-08 19:41:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:41:21,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:21,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 150 states and 256 transitions. [2024-11-08 19:41:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 256 transitions. [2024-11-08 19:41:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:41:26,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 151 states and 256 transitions. [2024-11-08 19:41:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 256 transitions. [2024-11-08 19:41:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:41:28,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 159 states and 271 transitions. [2024-11-08 19:41:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 271 transitions. [2024-11-08 19:41:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:41:34,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:41:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 159 states and 269 transitions. [2024-11-08 19:41:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 269 transitions. [2024-11-08 19:41:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:41:35,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:41:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:37,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-08 19:41:37,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:41:37,186 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 [2024-11-08 19:41:37,188 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:41:37,189 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-08 19:41:37,192 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 [2024-11-08 19:41:37,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-11-08 19:41:37,206 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:41:37,207 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2024-11-08 19:41:37,215 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 14 treesize of output 13 [2024-11-08 19:41:37,227 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 [2024-11-08 19:41:47,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:41:47,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-08 19:41:47,797 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 [2024-11-08 19:41:48,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:41:49,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:41:49,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:41:49,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:41:49,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:41:49,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:41:50,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:41:50,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:41:51,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:41:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:42:02,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse2)) .cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) is different from false [2024-11-08 19:42:03,256 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse2)) .cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2))) is different from true [2024-11-08 19:42:03,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) .cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 .cse2)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2)) is different from false [2024-11-08 19:42:03,289 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) .cse2 .cse3)) .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1))) .cse2 .cse3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3)) is different from false [2024-11-08 19:42:03,298 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) .cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 .cse2)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2))) is different from true [2024-11-08 19:42:03,307 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) .cse2 .cse3)) .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1))) .cse2 .cse3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3))) is different from true [2024-11-08 19:42:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:42:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 166 states and 288 transitions. [2024-11-08 19:42:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 288 transitions. [2024-11-08 19:42:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:42:14,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:42:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:42:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:42:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:42:15,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-08 19:42:15,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:42:15,569 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 [2024-11-08 19:42:15,571 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:42:15,572 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-08 19:42:15,577 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 [2024-11-08 19:42:15,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-11-08 19:42:15,598 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:42:15,599 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2024-11-08 19:42:15,605 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 14 treesize of output 13 [2024-11-08 19:42:15,619 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 [2024-11-08 19:42:26,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:42:26,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-08 19:42:26,283 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 [2024-11-08 19:42:26,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:42:26,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:42:26,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:42:26,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:42:26,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:42:26,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:42:26,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:42:26,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:42:26,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:42:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:42:37,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_17 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1) .cse1) (= (select v_arrayElimArr_17 0) 2))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse2)) .cse0 (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) is different from false [2024-11-08 19:42:38,377 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_17 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1) .cse1) (= (select v_arrayElimArr_17 0) 2))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse2)) .cse0 (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2))) is different from true [2024-11-08 19:42:38,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) .cse2 .cse3)) .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_17 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1) .cse1) (= (select v_arrayElimArr_17 0) 2))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1))) .cse2 .cse3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3)) is different from false [2024-11-08 19:42:38,409 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_17 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1) .cse1) (= (select v_arrayElimArr_17 0) 2))) .cse2 .cse3)) (not (and .cse0 (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) .cse2 .cse3)) .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1))) .cse2 .cse3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3)) is different from false [2024-11-08 19:42:38,419 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) .cse2 .cse3)) .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_17 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1) .cse1) (= (select v_arrayElimArr_17 0) 2))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1))) .cse2 .cse3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3))) is different from true [2024-11-08 19:42:38,428 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_17 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1) .cse1) (= (select v_arrayElimArr_17 0) 2))) .cse2 .cse3)) (not (and .cse0 (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) .cse2 .cse3)) .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (and (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1))) .cse2 .cse3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3))) is different from true [2024-11-08 19:42:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:42:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 170 states and 301 transitions. [2024-11-08 19:42:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 301 transitions. [2024-11-08 19:42:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:42:41,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:42:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:42:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:42:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:42:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:42:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 170 states and 298 transitions. [2024-11-08 19:42:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 298 transitions. [2024-11-08 19:42:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:42:43,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:42:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:42:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:42:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:42:44,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 19:42:44,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:42:44,720 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 19:42:44,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 19:42:44,747 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 [2024-11-08 19:42:45,136 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:42:45,136 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:42:45,200 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:42:45,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:42:45,279 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:42:45,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 19:42:45,982 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:42:45,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2024-11-08 19:42:47,700 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 19:42:47,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 54 treesize of output 68 [2024-11-08 19:42:48,517 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 19:42:48,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 65 treesize of output 71 [2024-11-08 19:42:49,251 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 19:42:49,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 65 treesize of output 71 [2024-11-08 19:42:50,053 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 19:42:50,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 65 treesize of output 71 [2024-11-08 19:42:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:42:53,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_17 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1) .cse1) (= (select v_arrayElimArr_17 0) 2))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse2)) .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) is different from false [2024-11-08 19:42:53,858 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and .cse0 (exists ((v_arrayElimArr_17 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1) .cse1) (= (select v_arrayElimArr_17 0) 2))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse2)) .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (exists ((v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= 2 (select v_arrayElimArr_14 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2))) is different from true [2024-11-08 19:43:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:43:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 179 states and 310 transitions. [2024-11-08 19:43:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 310 transitions. [2024-11-08 19:43:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:43:16,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:43:16,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:43:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:43:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:43:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:43:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 191 states and 324 transitions. [2024-11-08 19:43:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 324 transitions. [2024-11-08 19:43:33,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:43:33,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:43:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:43:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:43:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 36 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:43:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:43:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 194 states and 334 transitions. [2024-11-08 19:43:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 334 transitions. [2024-11-08 19:43:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:43:48,836 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:43:48,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:43:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:43:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 36 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:43:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:43:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 177 states and 285 transitions. [2024-11-08 19:43:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 285 transitions. [2024-11-08 19:43:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:43:51,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:43:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:43:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:43:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 16 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:44:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:44:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 182 states and 290 transitions. [2024-11-08 19:44:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 290 transitions. [2024-11-08 19:44:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:44:03,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:44:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:44:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:44:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 16 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:44:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:44:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 186 states and 300 transitions. [2024-11-08 19:44:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 300 transitions. [2024-11-08 19:44:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:44:12,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:44:12,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:44:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:44:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 16 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:44:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:44:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 187 states and 300 transitions. [2024-11-08 19:44:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 300 transitions. [2024-11-08 19:44:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:44:15,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:44:15,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:44:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:44:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 27 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:44:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:44:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 195 states and 311 transitions. [2024-11-08 19:44:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 311 transitions. [2024-11-08 19:44:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 19:44:29,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:44:29,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:44:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:44:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:44:31,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-08 19:44:31,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:44:31,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-11-08 19:44:31,481 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:44:31,482 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2024-11-08 19:44:31,489 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 14 treesize of output 13 [2024-11-08 19:44:31,506 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 [2024-11-08 19:44:31,508 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:44:31,509 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-08 19:44:31,513 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 [2024-11-08 19:44:31,526 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 [2024-11-08 19:44:42,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:44:42,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-08 19:44:42,526 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 [2024-11-08 19:44:42,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:44:42,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:44:42,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:44:43,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:44:43,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:44:43,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:44:43,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:44:43,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:44:43,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:44:43,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:44:44,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:44:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:44:44,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2)) is different from false [2024-11-08 19:44:45,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse0 .cse2 .cse3)) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3)) is different from false [2024-11-08 19:44:45,753 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2))) is different from true [2024-11-08 19:44:45,761 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse0 .cse2 .cse3)) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse1))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3))) is different from true [2024-11-08 19:44:56,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse0 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse2)) (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) is different from false [2024-11-08 19:44:57,173 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse0 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse2)) (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2))) is different from true [2024-11-08 19:45:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 201 states and 331 transitions. [2024-11-08 19:45:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 331 transitions. [2024-11-08 19:45:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 19:45:08,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:08,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:45:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:09,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-08 19:45:09,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:45:09,992 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 [2024-11-08 19:45:10,004 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 [2024-11-08 19:45:10,007 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:45:10,007 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-08 19:45:10,014 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 [2024-11-08 19:45:10,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:45:10,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-08 19:45:10,840 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 [2024-11-08 19:45:10,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:10,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:10,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:10,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:11,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:11,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:45:11,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:45:11,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:45:11,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:45:11,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:45:11,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:45:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:45:11,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2)) is different from false [2024-11-08 19:45:11,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3)) is different from false [2024-11-08 19:45:12,003 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse1 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse2))) is different from true [2024-11-08 19:45:12,011 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3))) is different from true [2024-11-08 19:45:12,021 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 (not (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse1 .cse2 .cse3)) (<= 2 c_~N~0) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) is different from false [2024-11-08 19:45:12,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) .cse1 (not (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse1 .cse2 .cse3)) (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) is different from false [2024-11-08 19:45:12,037 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 (not (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse1 .cse2 .cse3)) (<= 2 c_~N~0) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3))) is different from true [2024-11-08 19:45:12,044 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) .cse1 (not (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse1 .cse2 .cse3)) (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3))) is different from true [2024-11-08 19:45:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 205 states and 349 transitions. [2024-11-08 19:45:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 349 transitions. [2024-11-08 19:45:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 19:45:15,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:45:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:17,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 19:45:17,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:45:17,992 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 [2024-11-08 19:45:17,997 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 [2024-11-08 19:45:18,001 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 [2024-11-08 19:45:18,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-11-08 19:45:18,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 19:45:18,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-11-08 19:45:18,046 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 19:45:18,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 19 [2024-11-08 19:45:18,058 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 [2024-11-08 19:45:18,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:18,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:18,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:18,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:19,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:19,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:45:19,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:45:19,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:45:19,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:45:19,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:45:20,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:45:20,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 19:45:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:45:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 207 states and 353 transitions. [2024-11-08 19:45:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 353 transitions. [2024-11-08 19:45:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 19:45:27,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:27,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:45:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:28,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 19:45:28,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:45:28,665 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 19:45:28,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 19:45:28,680 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 [2024-11-08 19:45:28,999 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:45:28,999 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:45:29,047 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:45:29,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:45:29,121 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:45:29,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 19:45:29,197 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:45:29,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2024-11-08 19:45:29,967 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:45:29,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2024-11-08 19:45:31,823 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 19:45:31,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 61 treesize of output 78 [2024-11-08 19:45:32,668 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 19:45:32,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 72 treesize of output 81 [2024-11-08 19:45:33,613 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 19:45:33,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 72 treesize of output 81 [2024-11-08 19:45:34,525 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 19:45:34,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 72 treesize of output 81 [2024-11-08 19:45:35,408 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 19:45:35,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 72 treesize of output 81 [2024-11-08 19:45:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:46:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:46:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 218 states and 368 transitions. [2024-11-08 19:46:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 368 transitions. [2024-11-08 19:46:04,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 19:46:04,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:46:04,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:46:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:46:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:05,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-08 19:46:05,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:46:05,521 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 [2024-11-08 19:46:05,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 19:46:05,905 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:46:05,906 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:46:05,961 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:46:05,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:46:06,036 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:46:06,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 19:46:06,114 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:46:06,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2024-11-08 19:46:06,264 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 19:46:06,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 54 treesize of output 68 [2024-11-08 19:46:07,136 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-08 19:46:07,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 61 treesize of output 78 [2024-11-08 19:46:08,246 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-08 19:46:08,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 72 treesize of output 81 [2024-11-08 19:46:09,232 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-08 19:46:09,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 72 treesize of output 81 [2024-11-08 19:46:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:46:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:46:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 224 states and 374 transitions. [2024-11-08 19:46:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 374 transitions. [2024-11-08 19:46:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 19:46:29,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:46:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:46:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:46:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:29,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 19:46:29,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:46:29,795 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 [2024-11-08 19:46:29,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 19:46:30,153 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:46:30,153 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:46:30,202 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:46:30,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:46:30,260 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:46:30,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 19:46:30,396 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 19:46:30,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 58 [2024-11-08 19:46:30,490 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-08 19:46:30,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 54 treesize of output 68 [2024-11-08 19:46:31,417 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-08 19:46:31,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 61 treesize of output 78 [2024-11-08 19:46:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:47:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:47:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 242 states and 405 transitions. [2024-11-08 19:47:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 405 transitions. [2024-11-08 19:47:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 19:47:20,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:47:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 25 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:47:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:47:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 246 states and 415 transitions. [2024-11-08 19:47:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 415 transitions. [2024-11-08 19:47:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 19:47:35,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:47:35,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 25 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:47:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:47:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 251 states and 420 transitions. [2024-11-08 19:47:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 420 transitions. [2024-11-08 19:47:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 19:47:45,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:47:45,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 25 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:47:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:47:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 252 states and 420 transitions. [2024-11-08 19:47:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 420 transitions. [2024-11-08 19:47:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 19:47:49,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:47:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:47:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:47:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 251 states and 417 transitions. [2024-11-08 19:47:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 417 transitions. [2024-11-08 19:47:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 19:47:52,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:47:52,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:47:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:47:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:48:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:48:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 259 states and 429 transitions. [2024-11-08 19:48:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 429 transitions. [2024-11-08 19:48:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:48:10,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:48:10,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:48:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:48:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:13,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 19:48:13,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:48:13,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-11-08 19:48:13,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-11-08 19:48:13,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 [2024-11-08 19:48:13,786 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 [2024-11-08 19:48:13,788 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:48:13,789 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-08 19:48:13,795 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 [2024-11-08 19:48:13,815 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 [2024-11-08 19:48:25,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:48:25,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-08 19:48:25,070 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 [2024-11-08 19:48:25,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:48:25,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:48:25,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:48:25,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:48:26,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:48:26,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:48:26,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:48:26,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:48:26,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:48:26,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:48:26,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:48:26,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:48:27,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:48:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:48:27,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3)) is different from false [2024-11-08 19:48:28,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3)) is different from false [2024-11-08 19:48:28,386 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3))) is different from true [2024-11-08 19:48:28,396 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3))) is different from true [2024-11-08 19:48:38,877 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse2)) .cse1 (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2)) is different from false [2024-11-08 19:48:40,211 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse2)) .cse1 (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse2))) is different from true [2024-11-08 19:48:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:48:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 268 states and 458 transitions. [2024-11-08 19:48:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 458 transitions. [2024-11-08 19:48:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:48:57,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:48:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:48:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:48:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:59,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-08 19:48:59,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:48:59,258 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 [2024-11-08 19:48:59,267 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 [2024-11-08 19:48:59,269 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:48:59,270 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-08 19:48:59,274 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 [2024-11-08 19:49:00,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:49:00,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-08 19:49:00,373 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 [2024-11-08 19:49:00,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:49:00,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:49:00,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:49:00,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:49:00,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:49:00,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 19:49:00,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:49:00,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:49:00,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:49:00,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:49:00,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:49:00,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:49:00,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 19:49:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:49:00,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) (exists ((v_DerPreprocessor_25 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (and (= 2 (select v_arrayElimArr_30 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3)) is different from false [2024-11-08 19:49:01,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) (not (and (exists ((v_DerPreprocessor_25 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (and (= 2 (select v_arrayElimArr_30 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3)) is different from false [2024-11-08 19:49:01,856 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) (exists ((v_DerPreprocessor_25 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (and (= 2 (select v_arrayElimArr_30 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3))) is different from true [2024-11-08 19:49:01,866 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int))) (and (= 2 (select v_arrayElimArr_23 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) (not (and (exists ((v_DerPreprocessor_25 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (and (= 2 (select v_arrayElimArr_30 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (and .cse2 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) (exists ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_arrayElimArr_11 |ULTIMATE.start_main_~a~0#1.offset|) 2) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) .cse0))) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) .cse3))) is different from true [2024-11-08 19:49:01,875 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) (exists ((v_DerPreprocessor_25 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (and (= 2 (select v_arrayElimArr_30 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 (<= 2 c_~N~0) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) is different from false [2024-11-08 19:49:01,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) (not (and (exists ((v_DerPreprocessor_25 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (and (= 2 (select v_arrayElimArr_30 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) .cse1 (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) is different from false [2024-11-08 19:49:01,892 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) (exists ((v_DerPreprocessor_25 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (and (= 2 (select v_arrayElimArr_30 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 (<= 2 c_~N~0) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3))) is different from true [2024-11-08 19:49:01,900 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) (not (and (exists ((v_DerPreprocessor_25 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (and (= 2 (select v_arrayElimArr_30 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 .cse2 .cse3)) .cse1 (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3))) is different from true [2024-11-08 19:49:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:49:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 273 states and 480 transitions. [2024-11-08 19:49:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 480 transitions. [2024-11-08 19:49:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:49:07,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:49:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:49:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:49:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:10,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-08 19:49:10,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:49:10,410 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 [2024-11-08 19:49:10,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 19:49:10,766 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:49:10,767 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:49:10,826 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:49:10,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:49:10,884 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:49:10,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 19:49:10,943 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:49:10,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2024-11-08 19:49:11,015 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:49:11,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2024-11-08 19:49:12,087 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:49:12,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 78 [2024-11-08 19:49:14,670 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 19:49:14,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 68 treesize of output 88 [2024-11-08 19:49:15,791 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 19:49:15,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 79 treesize of output 91 [2024-11-08 19:49:17,095 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-08 19:49:17,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 21 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 46 case distinctions, treesize of input 99 treesize of output 110 [2024-11-08 19:49:18,350 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-11-08 19:49:18,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 21 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 56 case distinctions, treesize of input 99 treesize of output 113 [2024-11-08 19:49:19,592 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-11-08 19:49:19,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 21 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 56 case distinctions, treesize of input 99 treesize of output 113 [2024-11-08 19:49:20,861 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-11-08 19:49:20,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 21 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 56 case distinctions, treesize of input 99 treesize of output 113 [2024-11-08 19:49:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:49:26,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) (exists ((v_DerPreprocessor_25 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (and (= 2 (select v_arrayElimArr_30 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3)) is different from false [2024-11-08 19:49:26,708 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (exists ((v_arrayElimArr_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_21 0) 2))) (not (and .cse1 .cse2 (exists ((v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)) (= (select v_arrayElimArr_28 0) 2))) .cse3)) (exists ((v_DerPreprocessor_25 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (and (= 2 (select v_arrayElimArr_30 0)) (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~b~0#1.base|) 0 1)))) .cse1 (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= 2 c_~N~0) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse0 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1)) (= 2 (select v_DerPreprocessor_4 |ULTIMATE.start_main_~a~0#1.offset|)))) .cse3))) is different from true [2024-11-08 19:50:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:50:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 286 states and 498 transitions. [2024-11-08 19:50:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 498 transitions. [2024-11-08 19:50:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:50:13,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:50:13,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:50:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:50:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:50:15,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-08 19:50:15,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:50:15,769 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 19:50:15,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 19:50:15,788 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 [2024-11-08 19:50:16,135 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:50:16,135 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:50:16,183 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:50:16,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:50:16,269 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:50:16,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 19:50:16,357 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:50:16,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2024-11-08 19:50:16,451 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:50:16,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2024-11-08 19:50:16,629 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 19:50:16,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 61 treesize of output 78 [2024-11-08 19:50:18,277 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-08 19:50:18,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 68 treesize of output 88 [2024-11-08 19:50:19,579 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-08 19:50:19,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 79 treesize of output 91 [2024-11-08 19:50:21,239 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-08 19:50:21,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 79 treesize of output 91 [2024-11-08 19:50:22,507 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-08 19:50:22,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 79 treesize of output 91 [2024-11-08 19:50:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:50:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:50:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 294 states and 506 transitions. [2024-11-08 19:50:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 506 transitions. [2024-11-08 19:50:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:50:58,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:50:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:50:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:51:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:51:00,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-08 19:51:00,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:51:00,075 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 19:51:00,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 19:51:00,097 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 [2024-11-08 19:51:00,588 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:51:00,589 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 19:51:00,646 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:51:00,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-08 19:51:00,727 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:51:00,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 19:51:00,810 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 19:51:00,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2024-11-08 19:51:01,039 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 19:51:01,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 54 treesize of output 68 [2024-11-08 19:51:01,186 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-08 19:51:01,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 61 treesize of output 78 [2024-11-08 19:51:02,518 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-08 19:51:02,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 68 treesize of output 88 [2024-11-08 19:51:04,382 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-11-08 19:51:04,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 79 treesize of output 91 [2024-11-08 19:51:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:51:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:51:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 298 states and 510 transitions. [2024-11-08 19:51:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 510 transitions. [2024-11-08 19:51:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:51:33,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:51:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:51:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:51:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 19:52:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:52:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 314 states and 529 transitions. [2024-11-08 19:52:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 529 transitions. [2024-11-08 19:52:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:52:13,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:52:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:52:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:52:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 53 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:52:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:52:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 321 states and 547 transitions. [2024-11-08 19:52:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 547 transitions. [2024-11-08 19:52:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:52:32,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:52:32,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:52:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:52:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 36 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:52:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:52:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 322 states and 547 transitions. [2024-11-08 19:52:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 547 transitions. [2024-11-08 19:52:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:52:37,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:52:37,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:52:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:52:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 36 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:52:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:52:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 329 states and 556 transitions. [2024-11-08 19:52:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 556 transitions. [2024-11-08 19:52:54,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:52:54,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:52:54,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:52:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:52:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 60 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:52:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:52:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 329 states and 554 transitions. [2024-11-08 19:52:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 554 transitions. [2024-11-08 19:52:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:52:58,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:52:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:52:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:53:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 51 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:53:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:53:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 341 states and 569 transitions. [2024-11-08 19:53:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 569 transitions. [2024-11-08 19:53:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:53:35,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:53:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:53:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:53:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:53:43,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-08 19:53:43,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:53:43,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-11-08 19:53:43,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-11-08 19:53:43,453 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 [2024-11-08 19:53:43,463 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 [2024-11-08 19:53:43,466 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:53:43,466 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-08 19:53:43,474 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 [2024-11-08 19:53:43,495 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