./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-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_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/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_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/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_0e92000c-96e1-4b7a-8db8-06910cbccc3e/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 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 02:43:16,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 02:43:16,763 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 02:43:16,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 02:43:16,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 02:43:16,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 02:43:16,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 02:43:16,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 02:43:16,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 02:43:16,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 02:43:16,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 02:43:16,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 02:43:16,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 02:43:16,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 02:43:16,790 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 02:43:16,790 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 02:43:16,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 02:43:16,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:43:16,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 02:43:16,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 02:43:16,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 02:43:16,791 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 02:43:16,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 02:43:16,791 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_0e92000c-96e1-4b7a-8db8-06910cbccc3e/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 -> 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 [2024-12-06 02:43:17,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 02:43:17,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 02:43:17,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 02:43:17,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 02:43:17,053 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 02:43:17,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-12-06 02:43:19,658 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/data/6bb0dfefb/beb4c31214ad44fbade61cffbca7c3ec/FLAGb1672dbd1 [2024-12-06 02:43:19,866 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 02:43:19,866 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-12-06 02:43:19,873 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/data/6bb0dfefb/beb4c31214ad44fbade61cffbca7c3ec/FLAGb1672dbd1 [2024-12-06 02:43:19,885 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/data/6bb0dfefb/beb4c31214ad44fbade61cffbca7c3ec [2024-12-06 02:43:19,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 02:43:19,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 02:43:19,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 02:43:19,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 02:43:19,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 02:43:19,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:43:19" (1/1) ... [2024-12-06 02:43:19,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10db9aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:19, skipping insertion in model container [2024-12-06 02:43:19,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:43:19" (1/1) ... [2024-12-06 02:43:19,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 02:43:20,053 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_0e92000c-96e1-4b7a-8db8-06910cbccc3e/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c[535,548] [2024-12-06 02:43:20,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:43:20,087 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 02:43:20,098 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_0e92000c-96e1-4b7a-8db8-06910cbccc3e/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c[535,548] [2024-12-06 02:43:20,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:43:20,122 INFO L204 MainTranslator]: Completed translation [2024-12-06 02:43:20,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20 WrapperNode [2024-12-06 02:43:20,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 02:43:20,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 02:43:20,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 02:43:20,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 02:43:20,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,155 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-12-06 02:43:20,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 02:43:20,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 02:43:20,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 02:43:20,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 02:43:20,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 02:43:20,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 02:43:20,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 02:43:20,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 02:43:20,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:43:20,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 02:43:20,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 02:43:20,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e92000c-96e1-4b7a-8db8-06910cbccc3e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 02:43:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 02:43:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-06 02:43:20,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-06 02:43:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 02:43:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 02:43:20,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 02:43:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-06 02:43:20,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-06 02:43:20,285 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 02:43:20,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 02:43:20,446 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-12-06 02:43:20,446 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 02:43:20,471 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 02:43:20,471 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-12-06 02:43:20,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:43:20 BoogieIcfgContainer [2024-12-06 02:43:20,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 02:43:20,472 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 02:43:20,472 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 02:43:20,480 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 02:43:20,480 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:43:20" (1/1) ... [2024-12-06 02:43:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 02:43:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:43:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2024-12-06 02:43:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2024-12-06 02:43:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 02:43:20,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:43:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:43:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:43:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 02:43:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:43:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2024-12-06 02:43:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-12-06 02:43:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 02:43:20,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:43:20,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:43:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:43:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:43:20,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-06 02:43:20,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:43:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 02:43:23,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 02:43:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:43:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 32 states and 50 transitions. [2024-12-06 02:43:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2024-12-06 02:43:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 02:43:23,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:43:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:43:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:43:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 02:43:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:43:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 34 states and 54 transitions. [2024-12-06 02:43:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2024-12-06 02:43:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 02:43:23,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:43:23,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:43:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:43:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 02:43:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:43:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 35 states and 55 transitions. [2024-12-06 02:43:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2024-12-06 02:43:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 02:43:27,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:43:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:43:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:43:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 02:43:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:43:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 38 states and 58 transitions. [2024-12-06 02:43:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2024-12-06 02:43:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 02:43:27,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:43:27,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:43:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:43:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 02:43:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:43:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 42 states and 67 transitions. [2024-12-06 02:43:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2024-12-06 02:43:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 02:43:52,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:43:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:43:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:43:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:43:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:43:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 66 transitions. [2024-12-06 02:43:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2024-12-06 02:43:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 02:43:52,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:43:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:43:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:43:52,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 02:44:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:44:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 75 transitions. [2024-12-06 02:44:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 75 transitions. [2024-12-06 02:44:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 02:44:16,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:44:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:44:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:44:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 02:44:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:44:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 48 states and 79 transitions. [2024-12-06 02:44:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 79 transitions. [2024-12-06 02:44:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:44:27,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:44:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:44:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:44:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:44:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:44:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 56 states and 94 transitions. [2024-12-06 02:44:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 94 transitions. [2024-12-06 02:44:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:44:54,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:44:54,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:44:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:44:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:44:54,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-06 02:44:54,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:45:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:45:30,108 WARN L286 SmtUtils]: Spent 12.39s on a formula simplification. DAG size of input: 32 DAG size of output: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 02:46:05,073 WARN L286 SmtUtils]: Spent 14.96s on a formula simplification. DAG size of input: 34 DAG size of output: 25 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 02:46:41,437 WARN L286 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 32 DAG size of output: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 02:47:02,900 WARN L286 SmtUtils]: Spent 13.50s on a formula simplification. DAG size of input: 32 DAG size of output: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 02:47:13,898 WARN L286 SmtUtils]: Spent 7.70s on a formula simplification. DAG size of input: 34 DAG size of output: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 02:47:35,686 WARN L286 SmtUtils]: Spent 18.69s on a formula simplification. DAG size of input: 32 DAG size of output: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 02:47:43,798 WARN L286 SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 34 DAG size of output: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 02:48:23,276 WARN L286 SmtUtils]: Spent 14.60s on a formula simplification. DAG size of input: 30 DAG size of output: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 02:49:49,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 02:49:59,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 02:50:01,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 02:50:11,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 02:50:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:50:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 65 states and 118 transitions. [2024-12-06 02:50:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 118 transitions. [2024-12-06 02:50:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:50:18,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:50:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:50:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:50:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:50:18,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-06 02:50:18,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:50:28,761 WARN L286 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-06 02:50:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:50:45,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= |c_ULTIMATE.start_main_#t~post7#1| 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 02:51:04,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 02:51:15,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 02:51:44,193 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (<= |c_ULTIMATE.start_main_#t~post8#1| 2) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 02:51:54,204 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (<= |c_ULTIMATE.start_main_#t~post8#1| 2) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 02:51:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:51:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 66 states and 120 transitions. [2024-12-06 02:51:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 120 transitions. [2024-12-06 02:51:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:51:56,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:51:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:51:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:51:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:51:57,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:51:57,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:52:02,071 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:52:30,656 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 02:52:40,665 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 02:52:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:52:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 70 states and 139 transitions. [2024-12-06 02:52:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 139 transitions. [2024-12-06 02:52:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:52:45,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:52:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:52:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:52:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:52:45,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:52:45,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:52:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:53:01,913 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= |c_ULTIMATE.start_main_#t~post7#1| 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 02:53:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:53:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 72 states and 149 transitions. [2024-12-06 02:53:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 149 transitions. [2024-12-06 02:53:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:53:05,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:53:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:53:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:53:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:53:05,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:53:05,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:53:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:53:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:53:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 75 states and 164 transitions. [2024-12-06 02:53:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 164 transitions. [2024-12-06 02:53:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:53:33,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:53:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:53:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:53:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:53:33,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:53:33,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:53:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:53:50,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= c_~counter~0 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 02:54:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:54:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 77 states and 182 transitions. [2024-12-06 02:54:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 182 transitions. [2024-12-06 02:54:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:54:18,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:54:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:54:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:54:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:54:18,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:54:18,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:54:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:54:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:54:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 80 states and 208 transitions. [2024-12-06 02:54:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 208 transitions. [2024-12-06 02:54:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:54:43,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:54:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:54:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:54:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:54:43,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-06 02:54:43,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:54:55,587 WARN L286 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-06 02:55:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:55:21,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 02:55:38,094 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 02:55:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:55:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 81 states and 213 transitions. [2024-12-06 02:55:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 213 transitions. [2024-12-06 02:55:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:55:45,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:55:45,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:55:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:55:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:55:45,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:55:45,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:55:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:56:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 85 states and 249 transitions. [2024-12-06 02:56:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 249 transitions. [2024-12-06 02:56:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:56:03,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:56:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:03,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:56:03,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:56:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:56:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 88 states and 275 transitions. [2024-12-06 02:56:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 275 transitions. [2024-12-06 02:56:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:56:20,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:56:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:20,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:56:20,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:56:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:56:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:56:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 88 states and 275 transitions. [2024-12-06 02:56:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 275 transitions. [2024-12-06 02:56:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:56:44,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:56:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:56:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:56:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:56:44,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:56:44,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:56:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:57:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 90 states and 301 transitions. [2024-12-06 02:57:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 301 transitions. [2024-12-06 02:57:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:57:01,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:01,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:57:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:01,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:57:01,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:57:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:57:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 91 states and 315 transitions. [2024-12-06 02:57:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 315 transitions. [2024-12-06 02:57:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:57:24,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:57:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:24,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:57:24,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:57:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:57:44,678 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= c_~counter~0 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 02:57:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 92 states and 321 transitions. [2024-12-06 02:57:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 321 transitions. [2024-12-06 02:57:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:57:46,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:57:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:46,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:57:46,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:57:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:57:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:57:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 94 states and 341 transitions. [2024-12-06 02:57:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 341 transitions. [2024-12-06 02:57:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:57:55,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:57:55,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:57:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:57:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:57:55,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-06 02:57:55,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:58:06,354 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-06 02:58:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:58:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:58:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 95 states and 347 transitions. [2024-12-06 02:58:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 347 transitions. [2024-12-06 02:58:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:58:24,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:58:24,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:58:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:58:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:58:24,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 02:58:24,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 02:58:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:58:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:58:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 95 states and 347 transitions. [2024-12-06 02:58:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 347 transitions. [2024-12-06 02:58:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:58:40,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:58:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:58:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:58:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:58:40,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-06 02:58:40,236 INFO L279 TraceCheckSpWp]: Computing forward predicates...