./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d115e09498e3f278fd539730f0fa55e0745770e0304e10455a14000311085b68 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 01:25:08,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 01:25:08,975 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-12-06 01:25:08,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 01:25:08,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 01:25:09,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 01:25:09,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 01:25:09,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 01:25:09,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 01:25:09,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 01:25:09,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 01:25:09,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 01:25:09,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 01:25:09,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 01:25:09,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 01:25:09,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 01:25:09,003 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 01:25:09,003 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 01:25:09,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 01:25:09,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:25:09,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 01:25:09,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 01:25:09,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 01:25:09,004 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 01:25:09,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 01:25:09,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b 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 ! overflow) ) 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 -> d115e09498e3f278fd539730f0fa55e0745770e0304e10455a14000311085b68 [2024-12-06 01:25:09,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 01:25:09,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 01:25:09,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 01:25:09,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 01:25:09,250 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 01:25:09,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c [2024-12-06 01:25:11,909 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/data/59b4eea06/4e61f078071a47d48b87181fc6e69599/FLAG801069247 [2024-12-06 01:25:12,123 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 01:25:12,124 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c [2024-12-06 01:25:12,131 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/data/59b4eea06/4e61f078071a47d48b87181fc6e69599/FLAG801069247 [2024-12-06 01:25:12,497 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/data/59b4eea06/4e61f078071a47d48b87181fc6e69599 [2024-12-06 01:25:12,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 01:25:12,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 01:25:12,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 01:25:12,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 01:25:12,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 01:25:12,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a0fc9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12, skipping insertion in model container [2024-12-06 01:25:12,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 01:25:12,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:25:12,653 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 01:25:12,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:25:12,690 INFO L204 MainTranslator]: Completed translation [2024-12-06 01:25:12,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12 WrapperNode [2024-12-06 01:25:12,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 01:25:12,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 01:25:12,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 01:25:12,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 01:25:12,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,726 INFO L138 Inliner]: procedures = 16, calls = 77, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 117 [2024-12-06 01:25:12,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 01:25:12,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 01:25:12,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 01:25:12,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 01:25:12,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 01:25:12,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 01:25:12,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 01:25:12,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 01:25:12,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:25:12" (1/1) ... [2024-12-06 01:25:12,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:25:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 01:25:12,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 01:25:12,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_862b0ecd-5438-4cb6-98f9-d49d52fdfd3e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 01:25:12,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 01:25:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 01:25:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-06 01:25:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-06 01:25:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 01:25:12,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 01:25:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-06 01:25:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_0_to_41_0 [2024-12-06 01:25:12,813 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_0_to_41_0 [2024-12-06 01:25:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-06 01:25:12,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-06 01:25:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-06 01:25:12,883 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 01:25:12,884 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 01:25:13,277 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-12-06 01:25:13,278 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 01:25:13,312 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 01:25:13,312 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 01:25:13,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:25:13 BoogieIcfgContainer [2024-12-06 01:25:13,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 01:25:13,314 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 01:25:13,314 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 01:25:13,324 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 01:25:13,324 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:25:13" (1/1) ... [2024-12-06 01:25:13,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 01:25:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 134 states and 138 transitions. [2024-12-06 01:25:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2024-12-06 01:25:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 01:25:13,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 133 states and 137 transitions. [2024-12-06 01:25:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2024-12-06 01:25:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 01:25:13,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 132 states and 136 transitions. [2024-12-06 01:25:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2024-12-06 01:25:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 01:25:13,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 131 states and 135 transitions. [2024-12-06 01:25:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2024-12-06 01:25:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 01:25:14,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:14,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 130 states and 134 transitions. [2024-12-06 01:25:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2024-12-06 01:25:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 01:25:14,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:14,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-12-06 01:25:14,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:15,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-06 01:25:15,046 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-12-06 01:25:15,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 91 [2024-12-06 01:25:15,197 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-12-06 01:25:15,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2379 treesize of output 2343 [2024-12-06 01:25:15,277 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-06 01:25:15,438 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-12-06 01:25:15,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 7 [2024-12-06 01:25:15,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:15,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 1 [2024-12-06 01:25:15,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-12-06 01:25:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 133 states and 138 transitions. [2024-12-06 01:25:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2024-12-06 01:25:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 01:25:16,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:16,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-06 01:25:16,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:16,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-12-06 01:25:16,884 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 43 treesize of output 24 [2024-12-06 01:25:16,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-12-06 01:25:16,901 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 36 treesize of output 17 [2024-12-06 01:25:16,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:16,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:16,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2024-12-06 01:25:16,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2024-12-06 01:25:16,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 25 [2024-12-06 01:25:16,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:16,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:16,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2024-12-06 01:25:16,961 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:16,962 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2024-12-06 01:25:16,968 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-06 01:25:16,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:16,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-12-06 01:25:16,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:16,985 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 18 treesize of output 1 [2024-12-06 01:25:16,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:16,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:16,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:16,995 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 18 treesize of output 1 [2024-12-06 01:25:17,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:17,002 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 18 treesize of output 1 [2024-12-06 01:25:17,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:17,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:17,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:17,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-12-06 01:25:17,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:17,023 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 18 treesize of output 1 [2024-12-06 01:25:17,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:17,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:17,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:17,034 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 18 treesize of output 1 [2024-12-06 01:25:17,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:17,041 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 18 treesize of output 1 [2024-12-06 01:25:17,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:17,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:17,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-12-06 01:25:17,057 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:17,057 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-12-06 01:25:17,061 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-06 01:25:17,065 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:17,066 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2024-12-06 01:25:17,070 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-06 01:25:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 134 states and 139 transitions. [2024-12-06 01:25:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2024-12-06 01:25:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 01:25:17,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:17,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-12-06 01:25:17,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:17,404 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-12-06 01:25:17,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 80 [2024-12-06 01:25:17,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-12-06 01:25:17,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:17,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-12-06 01:25:17,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-12-06 01:25:17,799 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:17,799 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2024-12-06 01:25:17,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:17,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:17,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-06 01:25:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 139 states and 149 transitions. [2024-12-06 01:25:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2024-12-06 01:25:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 01:25:20,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:20,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-12-06 01:25:20,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:20,495 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-12-06 01:25:20,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 80 [2024-12-06 01:25:20,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-12-06 01:25:20,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:20,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-12-06 01:25:20,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-12-06 01:25:20,814 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:20,815 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2024-12-06 01:25:20,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:20,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:20,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-06 01:25:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 140 states and 150 transitions. [2024-12-06 01:25:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2024-12-06 01:25:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 01:25:21,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:21,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-06 01:25:21,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:21,108 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 1082 treesize of output 1078 [2024-12-06 01:25:21,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-12-06 01:25:21,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-12-06 01:25:21,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:21,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,397 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 18 treesize of output 1 [2024-12-06 01:25:21,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:21,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,407 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 18 treesize of output 1 [2024-12-06 01:25:21,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2024-12-06 01:25:21,415 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:21,416 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2024-12-06 01:25:21,421 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-06 01:25:21,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-12-06 01:25:21,434 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:21,434 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2024-12-06 01:25:21,441 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-06 01:25:21,445 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:21,446 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-12-06 01:25:21,452 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-06 01:25:21,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,462 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 18 treesize of output 1 [2024-12-06 01:25:21,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-12-06 01:25:21,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:21,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,482 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 18 treesize of output 1 [2024-12-06 01:25:21,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:21,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,494 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 18 treesize of output 1 [2024-12-06 01:25:21,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2024-12-06 01:25:21,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2024-12-06 01:25:21,517 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:21,518 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2024-12-06 01:25:21,524 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-06 01:25:21,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-12-06 01:25:21,545 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 43 treesize of output 24 [2024-12-06 01:25:21,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-12-06 01:25:21,560 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 36 treesize of output 17 [2024-12-06 01:25:21,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:21,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:21,960 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-12-06 01:25:21,960 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 1 case distinctions, treesize of input 23 treesize of output 19 [2024-12-06 01:25:22,041 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:22,041 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2024-12-06 01:25:22,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:22,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-12-06 01:25:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 147 states and 164 transitions. [2024-12-06 01:25:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 164 transitions. [2024-12-06 01:25:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 01:25:26,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:26,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:26,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-12-06 01:25:26,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:26,353 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 236150 treesize of output 235126 [2024-12-06 01:25:26,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2024-12-06 01:25:26,603 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:26,604 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2024-12-06 01:25:26,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:26,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-12-06 01:25:26,633 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:26,634 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2024-12-06 01:25:26,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:26,650 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:26,650 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-12-06 01:25:26,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:26,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2024-12-06 01:25:26,666 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:26,666 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2024-12-06 01:25:26,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:26,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-12-06 01:25:26,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,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 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:26,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-12-06 01:25:26,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,701 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 18 treesize of output 1 [2024-12-06 01:25:26,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,706 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 18 treesize of output 1 [2024-12-06 01:25:26,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:26,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-12-06 01:25:26,722 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:26,723 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2024-12-06 01:25:26,727 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-06 01:25:26,730 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:26,731 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-12-06 01:25:26,734 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-12-06 01:25:26,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,741 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 18 treesize of output 1 [2024-12-06 01:25:26,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-12-06 01:25:26,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,756 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 18 treesize of output 1 [2024-12-06 01:25:26,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,761 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 18 treesize of output 1 [2024-12-06 01:25:26,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:26,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-12-06 01:25:27,017 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-12-06 01:25:27,018 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 1 case distinctions, treesize of input 19 treesize of output 18 [2024-12-06 01:25:27,136 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:27,136 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2024-12-06 01:25:27,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:25:27,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-12-06 01:25:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 151 states and 171 transitions. [2024-12-06 01:25:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2024-12-06 01:25:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 01:25:27,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:27,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:27,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-12-06 01:25:27,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:27,938 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-12-06 01:25:27,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 747 treesize of output 729 [2024-12-06 01:25:28,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2024-12-06 01:25:28,148 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:28,148 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2024-12-06 01:25:28,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:28,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-12-06 01:25:28,179 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:25:28,180 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-12-06 01:25:28,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:25:28,206 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-12-06 01:25:28,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2024-12-06 01:25:28,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-12-06 01:25:28,675 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-12-06 01:25:28,807 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-12-06 01:25:28,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-12-06 01:25:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 154 states and 176 transitions. [2024-12-06 01:25:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2024-12-06 01:25:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 01:25:30,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:30,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-12-06 01:25:30,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:30,157 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-12-06 01:25:30,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1013 treesize of output 991 [2024-12-06 01:25:30,455 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-12-06 01:25:30,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-12-06 01:25:30,468 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-12-06 01:25:30,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2024-12-06 01:25:30,804 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-12-06 01:25:30,932 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-12-06 01:25:30,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-12-06 01:25:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 163 states and 194 transitions. [2024-12-06 01:25:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 194 transitions. [2024-12-06 01:25:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 01:25:37,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:37,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:37,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-12-06 01:25:37,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:37,894 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-12-06 01:25:37,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 799 treesize of output 755 [2024-12-06 01:25:37,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-12-06 01:25:37,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2024-12-06 01:25:37,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-12-06 01:25:38,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-12-06 01:25:38,049 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-12-06 01:25:38,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 57 [2024-12-06 01:25:38,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 15 [2024-12-06 01:25:39,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-12-06 01:25:39,415 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2024-12-06 01:25:39,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2024-12-06 01:25:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 174 states and 217 transitions. [2024-12-06 01:25:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 217 transitions. [2024-12-06 01:25:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 01:25:51,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:51,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:51,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-12-06 01:25:51,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:51,505 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-12-06 01:25:51,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 687 treesize of output 677 [2024-12-06 01:25:51,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-06 01:25:51,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-06 01:25:51,917 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-12-06 01:25:51,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 15 [2024-12-06 01:25:52,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-12-06 01:25:52,979 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2024-12-06 01:25:52,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2024-12-06 01:25:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:25:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:25:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 175 states and 218 transitions. [2024-12-06 01:25:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 218 transitions. [2024-12-06 01:25:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 01:25:54,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:25:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:25:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:25:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:25:54,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-12-06 01:25:54,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:25:54,262 INFO L349 Elim1Store]: treesize reduction 63, result has 22.2 percent of original size [2024-12-06 01:25:54,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 10148 treesize of output 9791 [2024-12-06 01:25:54,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-12-06 01:25:54,301 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-12-06 01:25:54,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 25 [2024-12-06 01:25:56,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-12-06 01:25:56,533 INFO L349 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2024-12-06 01:25:56,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 52 [2024-12-06 01:25:57,821 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-12-06 01:25:57,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 27 [2024-12-06 01:25:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:26:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:26:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 188 states and 245 transitions. [2024-12-06 01:26:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 245 transitions. [2024-12-06 01:26:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 01:26:21,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:26:21,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:26:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:26:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:26:21,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-12-06 01:26:21,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:26:21,169 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-12-06 01:26:21,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 69 [2024-12-06 01:26:21,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-12-06 01:26:21,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-12-06 01:26:21,688 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-12-06 01:26:21,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 67 [2024-12-06 01:26:21,692 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-12-06 01:26:21,693 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 107 [2024-12-06 01:26:21,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-06 01:26:24,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:26:24,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:26:24,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:26:24,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:26:24,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-06 01:26:24,039 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-12-06 01:26:24,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2024-12-06 01:26:24,047 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-12-06 01:26:24,055 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 0 case distinctions, treesize of input 35 treesize of output 32 [2024-12-06 01:26:24,064 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-12-06 01:26:24,837 INFO L349 Elim1Store]: treesize reduction 44, result has 43.6 percent of original size [2024-12-06 01:26:24,837 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 4 case distinctions, treesize of input 42 treesize of output 62 [2024-12-06 01:26:25,891 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-12-06 01:26:25,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 37 [2024-12-06 01:26:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:29:27,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 |c_func_to_recursive_line_0_to_41_0_#in~x.offset|)) (.cse1 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~x.base|))) (.cse2 (not (= |c_func_to_recursive_line_0_to_41_0_#in~xy.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse4 (not (= |c_func_to_recursive_line_0_to_41_0_#in~X.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse3 (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (.cse5 (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse6 (= |c_func_to_recursive_line_0_to_41_0_#in~X.offset| 0)) (.cse7 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse11 (= |c_func_to_recursive_line_0_to_41_0_#in~xy.offset| 0)) (.cse12 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|))) (.cse13 (= |c_func_to_recursive_line_0_to_41_0_#in~y.offset| 0)) (.cse8 (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~y.base|)) (.cse14 (= |c_func_to_recursive_line_0_to_41_0_#in~yx.offset| 0))) (and .cse0 (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~Y.base|)) .cse1 (not (= |c_func_to_recursive_line_0_to_41_0_#in~Y.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|)) .cse2 (= (select .cse3 0) 0) .cse4 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~Y.base|)) .cse5 .cse6 .cse7 (not (and .cse0 .cse1 .cse2 .cse4 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|func_to_recursive_line_0_to_41_0_#in~v.base| Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~y.base| v_DerPreprocessor_38) |c_func_to_recursive_line_0_to_41_0_#in~x.base| v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40))) (let ((.cse9 (store (select .cse10 |c_func_to_recursive_line_0_to_41_0_#in~y.base|) 0 0))) (and (= .cse8 .cse9) (<= 0 (+ (select (select .cse10 |c_func_to_recursive_line_0_to_41_0_#in~X.base|) 0) 2147483648)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~y.base|)) (= .cse3 (store (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~x.base| v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40) |c_func_to_recursive_line_0_to_41_0_#in~y.base| .cse9) |c_func_to_recursive_line_0_to_41_0_#in~x.base|) 0 0)))))) .cse5 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14)) .cse11 .cse12 .cse13 (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (= |c_func_to_recursive_line_0_to_41_0_#in~Y.offset| 0) (= (select .cse8 0) 0) (<= (select (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~X.base|) 0) 2147483647) .cse14)) is different from false [2024-12-06 01:29:28,469 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= 0 |c_func_to_recursive_line_0_to_41_0_#in~x.offset|)) (.cse1 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~x.base|))) (.cse2 (not (= |c_func_to_recursive_line_0_to_41_0_#in~xy.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse4 (not (= |c_func_to_recursive_line_0_to_41_0_#in~X.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse3 (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (.cse5 (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse6 (= |c_func_to_recursive_line_0_to_41_0_#in~X.offset| 0)) (.cse7 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse11 (= |c_func_to_recursive_line_0_to_41_0_#in~xy.offset| 0)) (.cse12 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|))) (.cse13 (= |c_func_to_recursive_line_0_to_41_0_#in~y.offset| 0)) (.cse8 (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~y.base|)) (.cse14 (= |c_func_to_recursive_line_0_to_41_0_#in~yx.offset| 0))) (and .cse0 (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~Y.base|)) .cse1 (not (= |c_func_to_recursive_line_0_to_41_0_#in~Y.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|)) .cse2 (= (select .cse3 0) 0) .cse4 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~Y.base|)) .cse5 .cse6 .cse7 (not (and .cse0 .cse1 .cse2 .cse4 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|func_to_recursive_line_0_to_41_0_#in~v.base| Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~y.base| v_DerPreprocessor_38) |c_func_to_recursive_line_0_to_41_0_#in~x.base| v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40))) (let ((.cse9 (store (select .cse10 |c_func_to_recursive_line_0_to_41_0_#in~y.base|) 0 0))) (and (= .cse8 .cse9) (<= 0 (+ (select (select .cse10 |c_func_to_recursive_line_0_to_41_0_#in~X.base|) 0) 2147483648)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~y.base|)) (= .cse3 (store (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~x.base| v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40) |c_func_to_recursive_line_0_to_41_0_#in~y.base| .cse9) |c_func_to_recursive_line_0_to_41_0_#in~x.base|) 0 0)))))) .cse5 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14)) .cse11 .cse12 .cse13 (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (= |c_func_to_recursive_line_0_to_41_0_#in~Y.offset| 0) (= (select .cse8 0) 0) (<= (select (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~X.base|) 0) 2147483647) .cse14))) is different from true [2024-12-06 01:31:49,581 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~y.base)) (.cse3 (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~x.base))) (and (not (= c_func_to_recursive_line_0_to_41_0_~Y.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (<= (select (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~X.base) 0) 2147483647) (not (= c_func_to_recursive_line_0_to_41_0_~xy.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~x.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~X.base)) (= (select .cse0 0) 0) (= c_func_to_recursive_line_0_to_41_0_~x.offset 0) (= c_func_to_recursive_line_0_to_41_0_~X.offset 0) (not (= c_func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (= c_func_to_recursive_line_0_to_41_0_~Y.offset 0) (= c_func_to_recursive_line_0_to_41_0_~yx.offset 0) (= c_func_to_recursive_line_0_to_41_0_~y.offset 0) (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~Y.base)) (not (= c_func_to_recursive_line_0_to_41_0_~yx.base c_func_to_recursive_line_0_to_41_0_~X.base)) (not (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|func_to_recursive_line_0_to_41_0_#in~v.base| Int)) (let ((.cse2 (store (store (store |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~y.base v_DerPreprocessor_38) c_func_to_recursive_line_0_to_41_0_~x.base v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40))) (let ((.cse1 (store (select .cse2 c_func_to_recursive_line_0_to_41_0_~y.base) 0 0))) (and (= .cse1 .cse0) (<= 0 (+ (select (select .cse2 c_func_to_recursive_line_0_to_41_0_~X.base) 0) 2147483648)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~y.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~x.base)) (= (store (select (store (store (store |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~x.base v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40) c_func_to_recursive_line_0_to_41_0_~y.base .cse1) c_func_to_recursive_line_0_to_41_0_~x.base) 0 0) .cse3)))))) (= (select .cse3 c_func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= c_func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~Y.base)) (= c_func_to_recursive_line_0_to_41_0_~xy.offset 0)))) is different from true [2024-12-06 01:32:01,349 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~y.base)) (.cse0 (not (= c_func_to_recursive_line_0_to_41_0_~xy.base c_func_to_recursive_line_0_to_41_0_~yx.base))) (.cse1 (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~X.base))) (.cse3 (= c_func_to_recursive_line_0_to_41_0_~X.offset 0)) (.cse4 (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~yx.base))) (.cse5 (= c_func_to_recursive_line_0_to_41_0_~yx.offset 0)) (.cse6 (= c_func_to_recursive_line_0_to_41_0_~y.offset 0)) (.cse7 (not (= c_func_to_recursive_line_0_to_41_0_~yx.base c_func_to_recursive_line_0_to_41_0_~X.base))) (.cse11 (= c_func_to_recursive_line_0_to_41_0_~xy.offset 0))) (and (<= (select (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~X.base) 0) 2147483647) (exists ((func_to_recursive_line_0_to_41_0_~x.base Int) (func_to_recursive_line_0_to_41_0_~Y.offset Int) (func_to_recursive_line_0_to_41_0_~Y.base Int) (func_to_recursive_line_0_to_41_0_~x.offset Int)) (and (not (= func_to_recursive_line_0_to_41_0_~Y.base c_func_to_recursive_line_0_to_41_0_~y.base)) (= |c_func_to_recursive_line_0_to_41_0_#t~mem4| (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~Y.base) func_to_recursive_line_0_to_41_0_~Y.offset)) (not (= func_to_recursive_line_0_to_41_0_~Y.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (= (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base) func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)) (not (= func_to_recursive_line_0_to_41_0_~Y.base func_to_recursive_line_0_to_41_0_~x.base)))) .cse0 .cse1 (exists ((func_to_recursive_line_0_to_41_0_~x.base Int) (func_to_recursive_line_0_to_41_0_~x.offset Int)) (and (= (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base) func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)))) (= (select .cse2 0) 0) .cse3 .cse4 (= |c_func_to_recursive_line_0_to_41_0_#t~mem5| 0) .cse5 .cse6 .cse7 (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (func_to_recursive_line_0_to_41_0_~x.base Int) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|func_to_recursive_line_0_to_41_0_#in~v.base| Int)) (let ((.cse9 (store (store (store |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~y.base v_DerPreprocessor_38) func_to_recursive_line_0_to_41_0_~x.base v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40))) (let ((.cse8 (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base)) (.cse10 (store (select .cse9 c_func_to_recursive_line_0_to_41_0_~y.base) 0 0))) (and (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~y.base)) (= (select .cse8 0) |c_func_to_recursive_line_0_to_41_0_#t~mem5|) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| func_to_recursive_line_0_to_41_0_~x.base)) (<= 0 (+ (select (select .cse9 c_func_to_recursive_line_0_to_41_0_~X.base) 0) 2147483648)) (= (store (select (store (store (store |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40) c_func_to_recursive_line_0_to_41_0_~y.base .cse10) func_to_recursive_line_0_to_41_0_~x.base) 0 0) .cse8) (= .cse10 .cse2) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)))))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11)) .cse11)) is different from false [2024-12-06 01:32:02,791 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~y.base)) (.cse0 (not (= c_func_to_recursive_line_0_to_41_0_~xy.base c_func_to_recursive_line_0_to_41_0_~yx.base))) (.cse1 (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~X.base))) (.cse3 (= c_func_to_recursive_line_0_to_41_0_~X.offset 0)) (.cse4 (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~yx.base))) (.cse5 (= c_func_to_recursive_line_0_to_41_0_~yx.offset 0)) (.cse6 (= c_func_to_recursive_line_0_to_41_0_~y.offset 0)) (.cse7 (not (= c_func_to_recursive_line_0_to_41_0_~yx.base c_func_to_recursive_line_0_to_41_0_~X.base))) (.cse11 (= c_func_to_recursive_line_0_to_41_0_~xy.offset 0))) (and (<= (select (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~X.base) 0) 2147483647) (exists ((func_to_recursive_line_0_to_41_0_~x.base Int) (func_to_recursive_line_0_to_41_0_~Y.offset Int) (func_to_recursive_line_0_to_41_0_~Y.base Int) (func_to_recursive_line_0_to_41_0_~x.offset Int)) (and (not (= func_to_recursive_line_0_to_41_0_~Y.base c_func_to_recursive_line_0_to_41_0_~y.base)) (= |c_func_to_recursive_line_0_to_41_0_#t~mem4| (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~Y.base) func_to_recursive_line_0_to_41_0_~Y.offset)) (not (= func_to_recursive_line_0_to_41_0_~Y.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (= (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base) func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)) (not (= func_to_recursive_line_0_to_41_0_~Y.base func_to_recursive_line_0_to_41_0_~x.base)))) .cse0 .cse1 (exists ((func_to_recursive_line_0_to_41_0_~x.base Int) (func_to_recursive_line_0_to_41_0_~x.offset Int)) (and (= (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base) func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)))) (= (select .cse2 0) 0) .cse3 .cse4 (= |c_func_to_recursive_line_0_to_41_0_#t~mem5| 0) .cse5 .cse6 .cse7 (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (func_to_recursive_line_0_to_41_0_~x.base Int) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|func_to_recursive_line_0_to_41_0_#in~v.base| Int)) (let ((.cse9 (store (store (store |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~y.base v_DerPreprocessor_38) func_to_recursive_line_0_to_41_0_~x.base v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40))) (let ((.cse8 (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base)) (.cse10 (store (select .cse9 c_func_to_recursive_line_0_to_41_0_~y.base) 0 0))) (and (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~y.base)) (= (select .cse8 0) |c_func_to_recursive_line_0_to_41_0_#t~mem5|) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| func_to_recursive_line_0_to_41_0_~x.base)) (<= 0 (+ (select (select .cse9 c_func_to_recursive_line_0_to_41_0_~X.base) 0) 2147483648)) (= (store (select (store (store (store |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40) c_func_to_recursive_line_0_to_41_0_~y.base .cse10) func_to_recursive_line_0_to_41_0_~x.base) 0 0) .cse8) (= .cse10 .cse2) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)))))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11)) .cse11))) is different from true [2024-12-06 01:32:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:32:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 203 states and 288 transitions. [2024-12-06 01:32:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 288 transitions. [2024-12-06 01:32:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 01:32:22,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:32:22,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:32:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:32:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:32:22,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-12-06 01:32:22,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:32:22,241 INFO L349 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2024-12-06 01:32:22,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 115 treesize of output 103 [2024-12-06 01:32:22,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-12-06 01:32:22,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-12-06 01:32:34,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 27 [2024-12-06 01:32:39,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 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-12-06 01:32:40,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2024-12-06 01:32:44,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-12-06 01:32:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:36:19,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-06 01:36:26,681 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 0 |c_func_to_recursive_line_0_to_41_0_#in~x.offset|)) (.cse2 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~x.base|))) (.cse3 (not (= |c_func_to_recursive_line_0_to_41_0_#in~xy.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse5 (not (= |c_func_to_recursive_line_0_to_41_0_#in~X.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse0 (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (.cse6 (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse7 (= |c_func_to_recursive_line_0_to_41_0_#in~X.offset| 0)) (.cse8 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse11 (= |c_func_to_recursive_line_0_to_41_0_#in~xy.offset| 0)) (.cse12 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|))) (.cse13 (= |c_func_to_recursive_line_0_to_41_0_#in~y.offset| 0)) (.cse4 (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~y.base|)) (.cse15 (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (.cse14 (= |c_func_to_recursive_line_0_to_41_0_#in~yx.offset| 0))) (and (= (select .cse0 |c_func_to_recursive_line_0_to_41_0_#in~x.offset|) 0) .cse1 (not (= |c_func_to_recursive_line_0_to_41_0_#in~xy.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~Y.base|)) .cse2 (not (= |c_func_to_recursive_line_0_to_41_0_#in~Y.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|)) .cse3 (= (select .cse0 0) 0) (not (= |c_func_to_recursive_line_0_to_41_0_#in~xy.base| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (= (select .cse4 |c_func_to_recursive_line_0_to_41_0_#in~y.offset|) 0) .cse5 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~Y.base|)) .cse6 .cse7 .cse8 (not (and .cse1 .cse2 .cse3 .cse5 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|func_to_recursive_line_0_to_41_0_#in~v.base| Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~y.base| v_DerPreprocessor_38) |c_func_to_recursive_line_0_to_41_0_#in~x.base| v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40))) (let ((.cse9 (store (select .cse10 |c_func_to_recursive_line_0_to_41_0_#in~y.base|) 0 0))) (and (= .cse4 .cse9) (<= 0 (+ (select (select .cse10 |c_func_to_recursive_line_0_to_41_0_#in~X.base|) 0) 2147483648)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~y.base|)) (= .cse0 (store (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~x.base| v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40) |c_func_to_recursive_line_0_to_41_0_#in~y.base| .cse9) |c_func_to_recursive_line_0_to_41_0_#in~x.base|) 0 0)))))) .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14)) .cse11 .cse12 (not (= |c_func_to_recursive_line_0_to_41_0_#in~xy.base| |c_func_to_recursive_line_0_to_41_0_#in~y.base|)) .cse13 (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (= |c_func_to_recursive_line_0_to_41_0_#in~Y.offset| 0) (<= 0 (+ (select .cse15 |c_func_to_recursive_line_0_to_41_0_#in~X.offset|) 2147483648)) (= (select .cse4 0) 0) (<= (select .cse15 0) 2147483647) .cse14)) is different from false [2024-12-06 01:37:19,665 WARN L286 SmtUtils]: Spent 50.67s on a formula simplification. DAG size of input: 99 DAG size of output: 94 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 01:37:19,677 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= 0 |c_func_to_recursive_line_0_to_41_0_#in~x.offset|)) (.cse2 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~x.base|))) (.cse3 (not (= |c_func_to_recursive_line_0_to_41_0_#in~xy.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse5 (not (= |c_func_to_recursive_line_0_to_41_0_#in~X.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse0 (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (.cse6 (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse7 (= |c_func_to_recursive_line_0_to_41_0_#in~X.offset| 0)) (.cse8 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|))) (.cse11 (= |c_func_to_recursive_line_0_to_41_0_#in~xy.offset| 0)) (.cse12 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|))) (.cse13 (= |c_func_to_recursive_line_0_to_41_0_#in~y.offset| 0)) (.cse4 (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~y.base|)) (.cse15 (select |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (.cse14 (= |c_func_to_recursive_line_0_to_41_0_#in~yx.offset| 0))) (and (= (select .cse0 |c_func_to_recursive_line_0_to_41_0_#in~x.offset|) 0) .cse1 (not (= |c_func_to_recursive_line_0_to_41_0_#in~xy.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~Y.base|)) .cse2 (not (= |c_func_to_recursive_line_0_to_41_0_#in~Y.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|)) .cse3 (= (select .cse0 0) 0) (not (= |c_func_to_recursive_line_0_to_41_0_#in~xy.base| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (= (select .cse4 |c_func_to_recursive_line_0_to_41_0_#in~y.offset|) 0) .cse5 (not (= |c_func_to_recursive_line_0_to_41_0_#in~y.base| |c_func_to_recursive_line_0_to_41_0_#in~Y.base|)) .cse6 .cse7 .cse8 (not (and .cse1 .cse2 .cse3 .cse5 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|func_to_recursive_line_0_to_41_0_#in~v.base| Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~y.base| v_DerPreprocessor_38) |c_func_to_recursive_line_0_to_41_0_#in~x.base| v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40))) (let ((.cse9 (store (select .cse10 |c_func_to_recursive_line_0_to_41_0_#in~y.base|) 0 0))) (and (= .cse4 .cse9) (<= 0 (+ (select (select .cse10 |c_func_to_recursive_line_0_to_41_0_#in~X.base|) 0) 2147483648)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~yx.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| |c_func_to_recursive_line_0_to_41_0_#in~y.base|)) (= .cse0 (store (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_0_to_41_0_#in~x.base| v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40) |c_func_to_recursive_line_0_to_41_0_#in~y.base| .cse9) |c_func_to_recursive_line_0_to_41_0_#in~x.base|) 0 0)))))) .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14)) .cse11 .cse12 (not (= |c_func_to_recursive_line_0_to_41_0_#in~xy.base| |c_func_to_recursive_line_0_to_41_0_#in~y.base|)) .cse13 (not (= |c_func_to_recursive_line_0_to_41_0_#in~x.base| |c_func_to_recursive_line_0_to_41_0_#in~X.base|)) (= |c_func_to_recursive_line_0_to_41_0_#in~Y.offset| 0) (<= 0 (+ (select .cse15 |c_func_to_recursive_line_0_to_41_0_#in~X.offset|) 2147483648)) (= (select .cse4 0) 0) (<= (select .cse15 0) 2147483647) .cse14))) is different from true [2024-12-06 01:37:37,363 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~y.base)) (.cse1 (not (= c_func_to_recursive_line_0_to_41_0_~xy.base c_func_to_recursive_line_0_to_41_0_~yx.base))) (.cse2 (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~X.base))) (.cse4 (= c_func_to_recursive_line_0_to_41_0_~X.offset 0)) (.cse5 (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~yx.base))) (.cse6 (= c_func_to_recursive_line_0_to_41_0_~yx.offset 0)) (.cse7 (= c_func_to_recursive_line_0_to_41_0_~y.offset 0)) (.cse8 (not (= c_func_to_recursive_line_0_to_41_0_~yx.base c_func_to_recursive_line_0_to_41_0_~X.base))) (.cse0 (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~X.base)) (.cse12 (= c_func_to_recursive_line_0_to_41_0_~xy.offset 0))) (and (<= (select .cse0 0) 2147483647) (exists ((func_to_recursive_line_0_to_41_0_~x.base Int) (func_to_recursive_line_0_to_41_0_~Y.offset Int) (func_to_recursive_line_0_to_41_0_~Y.base Int) (func_to_recursive_line_0_to_41_0_~x.offset Int)) (and (not (= func_to_recursive_line_0_to_41_0_~Y.base c_func_to_recursive_line_0_to_41_0_~y.base)) (= |c_func_to_recursive_line_0_to_41_0_#t~mem4| (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~Y.base) func_to_recursive_line_0_to_41_0_~Y.offset)) (not (= func_to_recursive_line_0_to_41_0_~Y.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (= (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base) func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)) (not (= func_to_recursive_line_0_to_41_0_~Y.base func_to_recursive_line_0_to_41_0_~x.base)))) (exists ((func_to_recursive_line_0_to_41_0_~x.base Int) (func_to_recursive_line_0_to_41_0_~x.offset Int)) (and (= (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base) func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~xy.base func_to_recursive_line_0_to_41_0_~x.base)) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)))) (not (= c_func_to_recursive_line_0_to_41_0_~xy.base c_func_to_recursive_line_0_to_41_0_~X.base)) .cse1 .cse2 (exists ((func_to_recursive_line_0_to_41_0_~x.base Int) (func_to_recursive_line_0_to_41_0_~x.offset Int)) (and (= (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base) func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)))) (= (select .cse3 0) 0) .cse4 .cse5 (= |c_func_to_recursive_line_0_to_41_0_#t~mem5| 0) .cse6 (not (= c_func_to_recursive_line_0_to_41_0_~xy.base c_func_to_recursive_line_0_to_41_0_~y.base)) .cse7 (= (select .cse3 c_func_to_recursive_line_0_to_41_0_~y.offset) 0) .cse8 (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (func_to_recursive_line_0_to_41_0_~x.base Int) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|func_to_recursive_line_0_to_41_0_#in~v.base| Int)) (let ((.cse10 (store (store (store |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~y.base v_DerPreprocessor_38) func_to_recursive_line_0_to_41_0_~x.base v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40))) (let ((.cse9 (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base)) (.cse11 (store (select .cse10 c_func_to_recursive_line_0_to_41_0_~y.base) 0 0))) (and (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~y.base)) (= (select .cse9 0) |c_func_to_recursive_line_0_to_41_0_#t~mem5|) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| func_to_recursive_line_0_to_41_0_~x.base)) (<= 0 (+ (select (select .cse10 c_func_to_recursive_line_0_to_41_0_~X.base) 0) 2147483648)) (= (store (select (store (store (store |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40) c_func_to_recursive_line_0_to_41_0_~y.base .cse11) func_to_recursive_line_0_to_41_0_~x.base) 0 0) .cse9) (= .cse11 .cse3) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)))))) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12)) (<= 0 (+ (select .cse0 c_func_to_recursive_line_0_to_41_0_~X.offset) 2147483648)) .cse12)) is different from false [2024-12-06 01:37:39,219 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~y.base)) (.cse1 (not (= c_func_to_recursive_line_0_to_41_0_~xy.base c_func_to_recursive_line_0_to_41_0_~yx.base))) (.cse2 (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~X.base))) (.cse4 (= c_func_to_recursive_line_0_to_41_0_~X.offset 0)) (.cse5 (not (= c_func_to_recursive_line_0_to_41_0_~y.base c_func_to_recursive_line_0_to_41_0_~yx.base))) (.cse6 (= c_func_to_recursive_line_0_to_41_0_~yx.offset 0)) (.cse7 (= c_func_to_recursive_line_0_to_41_0_~y.offset 0)) (.cse8 (not (= c_func_to_recursive_line_0_to_41_0_~yx.base c_func_to_recursive_line_0_to_41_0_~X.base))) (.cse0 (select |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~X.base)) (.cse12 (= c_func_to_recursive_line_0_to_41_0_~xy.offset 0))) (and (<= (select .cse0 0) 2147483647) (exists ((func_to_recursive_line_0_to_41_0_~x.base Int) (func_to_recursive_line_0_to_41_0_~Y.offset Int) (func_to_recursive_line_0_to_41_0_~Y.base Int) (func_to_recursive_line_0_to_41_0_~x.offset Int)) (and (not (= func_to_recursive_line_0_to_41_0_~Y.base c_func_to_recursive_line_0_to_41_0_~y.base)) (= |c_func_to_recursive_line_0_to_41_0_#t~mem4| (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~Y.base) func_to_recursive_line_0_to_41_0_~Y.offset)) (not (= func_to_recursive_line_0_to_41_0_~Y.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (= (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base) func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)) (not (= func_to_recursive_line_0_to_41_0_~Y.base func_to_recursive_line_0_to_41_0_~x.base)))) (exists ((func_to_recursive_line_0_to_41_0_~x.base Int) (func_to_recursive_line_0_to_41_0_~x.offset Int)) (and (= (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base) func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~xy.base func_to_recursive_line_0_to_41_0_~x.base)) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)))) (not (= c_func_to_recursive_line_0_to_41_0_~xy.base c_func_to_recursive_line_0_to_41_0_~X.base)) .cse1 .cse2 (exists ((func_to_recursive_line_0_to_41_0_~x.base Int) (func_to_recursive_line_0_to_41_0_~x.offset Int)) (and (= (select (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base) func_to_recursive_line_0_to_41_0_~x.offset) 0) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)))) (= (select .cse3 0) 0) .cse4 .cse5 (= |c_func_to_recursive_line_0_to_41_0_#t~mem5| 0) .cse6 (not (= c_func_to_recursive_line_0_to_41_0_~xy.base c_func_to_recursive_line_0_to_41_0_~y.base)) .cse7 (= (select .cse3 c_func_to_recursive_line_0_to_41_0_~y.offset) 0) .cse8 (not (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (func_to_recursive_line_0_to_41_0_~x.base Int) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|func_to_recursive_line_0_to_41_0_#in~v.base| Int)) (let ((.cse10 (store (store (store |c_#memory_int| c_func_to_recursive_line_0_to_41_0_~y.base v_DerPreprocessor_38) func_to_recursive_line_0_to_41_0_~x.base v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40))) (let ((.cse9 (select |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base)) (.cse11 (store (select .cse10 c_func_to_recursive_line_0_to_41_0_~y.base) 0 0))) (and (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~y.base)) (= (select .cse9 0) |c_func_to_recursive_line_0_to_41_0_#t~mem5|) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~X.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= |func_to_recursive_line_0_to_41_0_#in~v.base| func_to_recursive_line_0_to_41_0_~x.base)) (<= 0 (+ (select (select .cse10 c_func_to_recursive_line_0_to_41_0_~X.base) 0) 2147483648)) (= (store (select (store (store (store |c_#memory_int| func_to_recursive_line_0_to_41_0_~x.base v_DerPreprocessor_39) |func_to_recursive_line_0_to_41_0_#in~v.base| v_DerPreprocessor_40) c_func_to_recursive_line_0_to_41_0_~y.base .cse11) func_to_recursive_line_0_to_41_0_~x.base) 0 0) .cse9) (= .cse11 .cse3) (not (= func_to_recursive_line_0_to_41_0_~x.base c_func_to_recursive_line_0_to_41_0_~yx.base)) (not (= c_func_to_recursive_line_0_to_41_0_~y.base func_to_recursive_line_0_to_41_0_~x.base)))))) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12)) (<= 0 (+ (select .cse0 c_func_to_recursive_line_0_to_41_0_~X.offset) 2147483648)) .cse12))) is different from true