./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/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_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe22a831ab045bcc67da4505e3ba36b6f549cf1239b349bc9f8fd22458d7fbac --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 03:58:18,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 03:58:18,646 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 03:58:18,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 03:58:18,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 03:58:18,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 03:58:18,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 03:58:18,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 03:58:18,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 03:58:18,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 03:58:18,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 03:58:18,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 03:58:18,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 03:58:18,674 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 03:58:18,674 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 03:58:18,674 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 03:58:18,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 03:58:18,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 03:58:18,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 03:58:18,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 03:58:18,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 03:58:18,675 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 03:58:18,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 03:58:18,675 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_bde1046d-98ad-47ae-8208-1bddae31ed3d/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe22a831ab045bcc67da4505e3ba36b6f549cf1239b349bc9f8fd22458d7fbac [2024-12-06 03:58:18,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 03:58:18,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 03:58:18,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 03:58:18,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 03:58:18,934 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 03:58:18,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.c [2024-12-06 03:58:21,612 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/data/b1b710a95/2cec652d2c92436bbcaac8b472951f20/FLAG2403ea5d9 [2024-12-06 03:58:21,784 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 03:58:21,785 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.c [2024-12-06 03:58:21,792 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/data/b1b710a95/2cec652d2c92436bbcaac8b472951f20/FLAG2403ea5d9 [2024-12-06 03:58:21,806 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/data/b1b710a95/2cec652d2c92436bbcaac8b472951f20 [2024-12-06 03:58:21,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 03:58:21,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 03:58:21,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 03:58:21,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 03:58:21,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 03:58:21,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:58:21" (1/1) ... [2024-12-06 03:58:21,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd3ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:21, skipping insertion in model container [2024-12-06 03:58:21,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:58:21" (1/1) ... [2024-12-06 03:58:21,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 03:58:21,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.c[1175,1188] [2024-12-06 03:58:21,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 03:58:21,989 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 03:58:21,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.c[1175,1188] [2024-12-06 03:58:22,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 03:58:22,016 INFO L204 MainTranslator]: Completed translation [2024-12-06 03:58:22,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22 WrapperNode [2024-12-06 03:58:22,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 03:58:22,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 03:58:22,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 03:58:22,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 03:58:22,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,045 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2024-12-06 03:58:22,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 03:58:22,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 03:58:22,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 03:58:22,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 03:58:22,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 03:58:22,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 03:58:22,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 03:58:22,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 03:58:22,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 03:58:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 03:58:22,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 03:58:22,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bde1046d-98ad-47ae-8208-1bddae31ed3d/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 03:58:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 03:58:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 03:58:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 03:58:22,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 03:58:22,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-06 03:58:22,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-06 03:58:22,171 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 03:58:22,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 03:58:22,265 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-12-06 03:58:22,265 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 03:58:22,309 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 03:58:22,309 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 03:58:22,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:58:22 BoogieIcfgContainer [2024-12-06 03:58:22,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 03:58:22,310 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 03:58:22,310 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 03:58:22,318 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 03:58:22,319 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:58:22" (1/1) ... [2024-12-06 03:58:22,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 03:58:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 14 states and 18 transitions. [2024-12-06 03:58:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2024-12-06 03:58:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 03:58:22,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:22,482 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 03:58:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2024-12-06 03:58:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-12-06 03:58:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 03:58:22,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:22,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:58:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:22,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 03:58:22,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:58:22,672 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 03:58:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 19 states and 26 transitions. [2024-12-06 03:58:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2024-12-06 03:58:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 03:58:22,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:22,836 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 03:58:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 21 states and 29 transitions. [2024-12-06 03:58:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2024-12-06 03:58:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 03:58:23,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:58:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2024-12-06 03:58:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2024-12-06 03:58:23,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 03:58:23,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:58:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:23,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-06 03:58:23,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:58:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:58:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2024-12-06 03:58:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2024-12-06 03:58:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 03:58:24,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:24,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:58:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 32 states and 53 transitions. [2024-12-06 03:58:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 53 transitions. [2024-12-06 03:58:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 03:58:25,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:58:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:25,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 03:58:25,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:58:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:58:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 34 states and 59 transitions. [2024-12-06 03:58:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2024-12-06 03:58:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 03:58:26,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:26,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:58:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:26,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-06 03:58:26,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:58:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:58:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 38 states and 69 transitions. [2024-12-06 03:58:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 69 transitions. [2024-12-06 03:58:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 03:58:34,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:58:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 42 states and 83 transitions. [2024-12-06 03:58:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 83 transitions. [2024-12-06 03:58:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 03:58:39,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:58:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:39,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-12-06 03:58:39,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:58:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:58:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:58:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 46 states and 92 transitions. [2024-12-06 03:58:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 92 transitions. [2024-12-06 03:58:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:58:43,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:58:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:58:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:58:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:58:43,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-12-06 03:58:43,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:58:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 03:59:08,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 03:59:09,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-06 03:59:10,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-06 03:59:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:59:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 50 states and 104 transitions. [2024-12-06 03:59:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 104 transitions. [2024-12-06 03:59:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:59:10,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:59:10,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:59:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:59:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 03:59:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:59:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 53 states and 112 transitions. [2024-12-06 03:59:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 112 transitions. [2024-12-06 03:59:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:59:15,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:59:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:59:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:59:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 03:59:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:59:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 55 states and 116 transitions. [2024-12-06 03:59:25,849 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 116 transitions. [2024-12-06 03:59:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:59:25,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:59:25,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:59:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:59:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 03:59:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:59:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 57 states and 122 transitions. [2024-12-06 03:59:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 122 transitions. [2024-12-06 03:59:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:59:26,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:59:26,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:59:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:59:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:59:26,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-06 03:59:26,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:59:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 03:59:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:59:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 58 states and 123 transitions. [2024-12-06 03:59:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 123 transitions. [2024-12-06 03:59:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:59:35,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:59:35,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:59:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:59:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 03:59:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:59:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 59 states and 130 transitions. [2024-12-06 03:59:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 130 transitions. [2024-12-06 03:59:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:59:36,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:59:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:59:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:59:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:59:36,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-06 03:59:36,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:59:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 03:59:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:59:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 60 states and 131 transitions. [2024-12-06 03:59:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 131 transitions. [2024-12-06 03:59:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 03:59:45,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:59:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:59:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:59:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:59:45,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-06 03:59:45,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:59:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 18 proven. 38 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 04:00:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:00:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 64 states and 152 transitions. [2024-12-06 04:00:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 152 transitions. [2024-12-06 04:00:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:00:04,713 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:00:04,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:00:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 04:00:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:00:04,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-06 04:00:04,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 04:01:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 04:02:30,403 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2))))))))))))) (<= c_~counter~0 3))) is different from false [2024-12-06 04:02:44,369 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2))))))))))))) (<= c_~counter~0 3)))) is different from true [2024-12-06 04:03:14,140 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (<= |c_ULTIMATE.start_main_#t~post6#1| 3) (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2))))))))))))))) is different from false [2024-12-06 04:03:27,732 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (<= |c_ULTIMATE.start_main_#t~post6#1| 3) (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2)))))))))))))))) is different from true [2024-12-06 04:03:53,727 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 258 DAG size of output: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 04:04:03,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2))))))))))))))) is different from false [2024-12-06 04:04:18,629 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2)))))))))))))))) is different from true [2024-12-06 04:06:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:06:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 68 states and 179 transitions. [2024-12-06 04:06:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 179 transitions. [2024-12-06 04:06:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:06:00,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:06:00,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:06:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:06:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 04:09:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 73 states and 200 transitions. [2024-12-06 04:09:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 200 transitions. [2024-12-06 04:09:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:09:23,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:23,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 04:09:38,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (<= c_~counter~0 4) (<= |c_ULTIMATE.start_main_#t~post6#1| 3) (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2))))))))))))))) is different from false [2024-12-06 04:09:48,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (<= |c_ULTIMATE.start_main_#t~post6#1| 3) (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2))))))))))))) (< 4 c_~counter~0))) is different from false [2024-12-06 04:09:59,579 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (<= c_~counter~0 4) (<= |c_ULTIMATE.start_main_#t~post6#1| 3) (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2)))))))))))))))) is different from true [2024-12-06 04:10:09,662 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (<= |c_ULTIMATE.start_main_#t~post6#1| 3) (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2))))))))))))) (< 4 c_~counter~0)))) is different from true [2024-12-06 04:10:19,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (<= c_~counter~0 4) (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2))))))))))))))) is different from false [2024-12-06 04:10:29,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2))))))))))))) (< 4 c_~counter~0))) is different from false [2024-12-06 04:10:40,132 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (<= c_~counter~0 4) (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2)))))))))))))))) is different from true [2024-12-06 04:10:50,249 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse31 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse32 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 8))) (.cse17 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse6 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse13 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| 4))) (and (not (and (let ((.cse0 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 8)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (= (+ .cse0 |c_ULTIMATE.start_main_~z~0#1|) .cse2)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (or (and (or (and (= (+ .cse0 .cse1) .cse2) (<= |c_ULTIMATE.start_main_~b~0#1| (+ .cse3 4))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 .cse3)) (= (+ .cse0 .cse4) .cse2))) .cse5) (and (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 7 .cse3)) (= .cse2 (+ .cse6 .cse0))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 6 .cse3)) (= .cse2 (+ .cse0 .cse7)))) .cse5) (exists ((v_z_100 Int) (v_y_100 Int) (v_y_99 Int)) (let ((.cse14 (* 2 v_y_100))) (let ((.cse8 (+ v_z_100 .cse14)) (.cse10 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_y_100))) (.cse11 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_100) 4)) (.cse9 (+ (* v_y_99 2) v_z_100 .cse14))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* v_z_100 4) .cse3 (* v_y_100 8))) (<= 0 .cse8) (<= 0 .cse9) (<= v_z_100 1) (<= .cse8 1) (<= 0 v_z_100) (= (+ .cse10 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse11) .cse2) (= (+ .cse10 .cse0 .cse12 .cse11) .cse2) (<= .cse9 1) (not (= (+ .cse13 v_z_100) 0)) (not (= .cse9 1)))))) (exists ((v_y_90 Int) (v_z_94 Int) (v_y_94 Int)) (let ((.cse20 (* v_y_94 2))) (let ((.cse15 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_94) 4)) (.cse16 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_94) 8)) (.cse19 (+ v_z_94 .cse20 (* v_y_90 2))) (.cse18 (+ v_z_94 .cse20))) (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_94 8) (* v_z_94 4) 3 .cse3)) (= .cse2 (+ .cse15 .cse0 .cse16 |c_ULTIMATE.start_main_~z~0#1|)) (= (+ .cse15 .cse0 .cse16 .cse17) .cse2) (<= .cse18 1) (not (= (+ .cse13 v_z_94) 0)) (<= v_z_94 1) (not (= .cse19 1)) (<= .cse19 1) (<= 0 v_z_94) (<= 0 .cse19) (<= 0 .cse18))))) (exists ((v_y_83 Int) (v_y_86 Int) (v_z_86 Int)) (let ((.cse25 (* v_y_86 2))) (let ((.cse21 (+ .cse25 v_z_86 (* v_y_83 2))) (.cse23 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_86) 4)) (.cse24 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_86) 8)) (.cse22 (+ .cse25 v_z_86))) (and (not (= .cse21 1)) (<= .cse21 1) (<= 0 .cse22) (= .cse2 (+ .cse23 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse24)) (<= 0 .cse21) (= .cse2 (+ .cse23 .cse0 .cse24)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_86 4) (* v_y_86 8) .cse3)) (<= 0 v_z_86) (<= .cse22 1) (<= v_z_86 1))))) (exists ((v_y_83 Int) (v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 2))) (let ((.cse26 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_87) 8)) (.cse27 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_87) 4)) (.cse28 (+ v_z_87 (* v_y_83 2) .cse30)) (.cse29 (+ v_z_87 .cse30))) (and (<= v_z_87 1) (not (= (+ .cse13 v_z_87) 0)) (= (+ .cse26 .cse0 |c_ULTIMATE.start_main_~z~0#1| .cse27) .cse2) (<= .cse28 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_y_87 8) (* v_z_87 4) .cse3 1)) (<= .cse29 1) (not (= .cse28 1)) (= (+ .cse26 |c_ULTIMATE.start_main_~a~0#1| .cse0 .cse27) .cse2) (<= 0 .cse28) (<= 0 v_z_87) (<= 0 .cse29)))))))) .cse31 .cse32)) .cse31 .cse32 (let ((.cse34 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1))) (or (let ((.cse40 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse33 (div .cse40 2))) (and (not (= .cse33 0)) .cse34 (let ((.cse36 (= (mod .cse33 2) 1))) (let ((.cse35 (div (+ (- 1) .cse33) 2)) (.cse38 (div .cse40 4)) (.cse37 (+ .cse13 1)) (.cse39 (not .cse36))) (or (and (<= .cse13 .cse35) (= |c_ULTIMATE.start_main_~z~0#1| .cse17) (not (= .cse35 0)) (<= 1 (mod (+ .cse35 1) 2)) .cse36 (<= .cse35 .cse37)) (and (= .cse35 .cse37) .cse36 (= .cse6 |c_ULTIMATE.start_main_~z~0#1|)) (and (<= .cse38 .cse37) (<= .cse13 .cse38) .cse39 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 1 (mod (+ .cse38 1) 2))) (and (= .cse38 .cse37) .cse39 (= |c_ULTIMATE.start_main_~z~0#1| .cse4)))))))) (and (not .cse34) (let ((.cse45 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse41 (= (mod .cse45 2) 1))) (or (let ((.cse44 (+ (- 1) .cse45))) (let ((.cse42 (div .cse44 2))) (and .cse41 (let ((.cse43 (= (mod .cse42 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse7) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ .cse42 (- 1)) 2)) .cse43) (and (not .cse43) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse44 4)) (= |c_ULTIMATE.start_main_~z~0#1| .cse12)))) (not (= .cse42 0))))) (and (not .cse41) (let ((.cse47 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse46 (= (mod .cse47 2) 1))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div |c_ULTIMATE.start_main_~b~0#1| 8)) (= |c_ULTIMATE.start_main_~z~0#1| 0) (not .cse46)) (and .cse46 (= |c_ULTIMATE.start_main_~z~0#1| .cse1) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse47) 2))))))))))))) (< 4 c_~counter~0)))) is different from true [2024-12-06 04:11:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 77 states and 221 transitions. [2024-12-06 04:11:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 221 transitions. [2024-12-06 04:11:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:11:03,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:03,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 04:11:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 79 states and 223 transitions. [2024-12-06 04:11:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 223 transitions. [2024-12-06 04:11:34,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:11:34,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:34,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 04:11:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 79 states and 223 transitions. [2024-12-06 04:11:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 223 transitions. [2024-12-06 04:11:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:11:41,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:41,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 04:12:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:12:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 81 states and 226 transitions. [2024-12-06 04:12:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 226 transitions. [2024-12-06 04:12:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:12:30,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:12:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:12:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:12:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 04:12:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:12:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 83 states and 230 transitions. [2024-12-06 04:12:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 230 transitions. [2024-12-06 04:12:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:12:49,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:12:49,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:12:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:12:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.