./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.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_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3 --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 ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:52:48,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:52:48,985 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:52:48,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:52:48,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:52:49,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:52:49,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:52:49,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:52:49,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:52:49,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:52:49,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:52:49,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:52:49,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:52:49,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:52:49,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:52:49,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:52:49,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:52:49,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:52:49,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:52:49,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:52:49,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:52:49,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:52:49,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:52:49,031 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:52:49,031 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:52:49,032 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:52:49,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:52:49,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:52:49,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:52:49,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:52:49,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:52:49,033 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:52:49,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:52:49,034 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_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3 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 -> ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d [2024-11-25 03:52:49,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:52:49,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:52:49,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:52:49,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:52:49,400 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:52:49,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2024-11-25 03:52:52,369 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/data/da325dc3d/8ddb69f848884df8a233c22c06022c78/FLAGf7cbfc96b [2024-11-25 03:52:52,716 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:52:52,717 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2024-11-25 03:52:52,724 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/data/da325dc3d/8ddb69f848884df8a233c22c06022c78/FLAGf7cbfc96b [2024-11-25 03:52:52,742 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/data/da325dc3d/8ddb69f848884df8a233c22c06022c78 [2024-11-25 03:52:52,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:52:52,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:52:52,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:52:52,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:52:52,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:52:52,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:52:52" (1/1) ... [2024-11-25 03:52:52,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a892812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:52, skipping insertion in model container [2024-11-25 03:52:52,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:52:52" (1/1) ... [2024-11-25 03:52:52,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:52:52,960 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_a8a736da-c581-4dd3-8255-87a77d7ef4ab/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c[535,548] [2024-11-25 03:52:52,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:52:53,007 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:52:53,020 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_a8a736da-c581-4dd3-8255-87a77d7ef4ab/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c[535,548] [2024-11-25 03:52:53,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:52:53,051 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:52:53,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53 WrapperNode [2024-11-25 03:52:53,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:52:53,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:52:53,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:52:53,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:52:53,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,085 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-11-25 03:52:53,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:52:53,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:52:53,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:52:53,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:52:53,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:52:53,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:52:53,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:52:53,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:52:53,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:52:53,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:52:53,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:52:53,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8a736da-c581-4dd3-8255-87a77d7ef4ab/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:52:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:52:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-25 03:52:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-25 03:52:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:52:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:52:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:52:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-25 03:52:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-25 03:52:53,227 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:52:53,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:52:53,422 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-25 03:52:53,422 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:52:53,455 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:52:53,455 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-25 03:52:53,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:52:53 BoogieIcfgContainer [2024-11-25 03:52:53,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:52:53,457 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:52:53,457 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:52:53,468 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:52:53,468 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:52:53" (1/1) ... [2024-11-25 03:52:53,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:52:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2024-11-25 03:52:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2024-11-25 03:52:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:52:53,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:53,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:52:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2024-11-25 03:52:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-25 03:52:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:52:53,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:52:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:53,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-25 03:52:53,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:52:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:52:55,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 03:52:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 32 states and 50 transitions. [2024-11-25 03:52:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2024-11-25 03:52:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:52:55,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:52:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 34 states and 54 transitions. [2024-11-25 03:52:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2024-11-25 03:52:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 03:52:56,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:52:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 35 states and 55 transitions. [2024-11-25 03:52:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2024-11-25 03:52:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 03:52:58,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:58,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:52:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 38 states and 58 transitions. [2024-11-25 03:52:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2024-11-25 03:52:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 03:52:59,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:59,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:53:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 42 states and 67 transitions. [2024-11-25 03:53:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2024-11-25 03:53:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 03:53:18,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:53:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 66 transitions. [2024-11-25 03:53:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2024-11-25 03:53:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-25 03:53:18,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:53:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 75 transitions. [2024-11-25 03:53:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 75 transitions. [2024-11-25 03:53:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 03:53:50,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:50,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:54:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 48 states and 79 transitions. [2024-11-25 03:54:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 79 transitions. [2024-11-25 03:54:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 03:54:00,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:00,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 03:54:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 56 states and 94 transitions. [2024-11-25 03:54:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 94 transitions. [2024-11-25 03:54:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 03:54:45,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:54:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:45,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-25 03:54:45,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:54:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:55:15,420 WARN L286 SmtUtils]: Spent 14.75s on a formula simplification. DAG size of input: 32 DAG size of output: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:55:35,216 WARN L286 SmtUtils]: Spent 6.42s 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-11-25 03:56:09,937 WARN L286 SmtUtils]: Spent 7.78s on a formula simplification. DAG size of input: 36 DAG size of output: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:56:41,099 WARN L286 SmtUtils]: Spent 13.89s 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-11-25 03:57:12,275 WARN L286 SmtUtils]: Spent 11.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-11-25 03:57:40,832 WARN L286 SmtUtils]: Spent 17.12s 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-11-25 03:58:25,426 WARN L286 SmtUtils]: Spent 6.37s 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-11-25 03:59:06,068 WARN L286 SmtUtils]: Spent 20.97s on a formula simplification. DAG size of input: 32 DAG size of output: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:59:19,068 WARN L286 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:59:47,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 03:59:50,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 03:59:57,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 04:00:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 65 states and 117 transitions. [2024-11-25 04:00:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 117 transitions. [2024-11-25 04:00:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:00:00,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:00:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:00,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-25 04:00:00,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:00:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 04:00:17,143 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-11-25 04:00:27,155 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-11-25 04:00:37,162 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-11-25 04:00:52,412 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-11-25 04:01:22,677 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-11-25 04:01:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 67 states and 122 transitions. [2024-11-25 04:01:37,298 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2024-11-25 04:01:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:01:37,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:01:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:37,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-25 04:01:37,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:01:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 04:01:56,739 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-11-25 04:02:06,750 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-11-25 04:02:16,758 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-11-25 04:02:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:02:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 71 states and 136 transitions. [2024-11-25 04:02:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 136 transitions. [2024-11-25 04:02:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:02:27,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:02:27,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:02:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:02:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:02:27,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-25 04:02:27,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:02:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 04:02:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:02:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 75 states and 154 transitions. [2024-11-25 04:02:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 154 transitions. [2024-11-25 04:02:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:02:57,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:02:57,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:02:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:02:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:02:57,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-25 04:02:57,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:03:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 04:03:16,503 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-11-25 04:04:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:04:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 77 states and 165 transitions. [2024-11-25 04:04:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 165 transitions. [2024-11-25 04:04:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:04:02,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:04:02,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:04:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:04:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:04:02,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-25 04:04:02,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:04:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 04:04:27,858 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-11-25 04:04:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:04:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 83 states and 207 transitions. [2024-11-25 04:04:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 207 transitions. [2024-11-25 04:04:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:04:34,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:04:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:04:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:04:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:04:34,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-25 04:04:34,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:05:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 3 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:05:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:05:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 84 states and 217 transitions. [2024-11-25 04:05:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 217 transitions. [2024-11-25 04:05:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:05:40,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:05:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:05:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:05:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:05:40,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-25 04:05:40,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:05:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 3 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 04:06:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:06:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 85 states and 228 transitions. [2024-11-25 04:06:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 228 transitions. [2024-11-25 04:06:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:06:03,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:06:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:06:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:06:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:06:03,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-25 04:06:03,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:06:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 04:06:20,132 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-11-25 04:06:30,140 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-11-25 04:06:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:06:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 88 states and 254 transitions. [2024-11-25 04:06:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 254 transitions. [2024-11-25 04:06:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:06:34,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:06:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:06:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:06:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:06:34,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-25 04:06:34,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:06:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 04:06:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:06:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 89 states and 263 transitions. [2024-11-25 04:06:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 263 transitions. [2024-11-25 04:06:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:06:39,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:06:39,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:06:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:06:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:06:39,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-25 04:06:39,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:06:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 04:06:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:06:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 91 states and 283 transitions. [2024-11-25 04:06:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 283 transitions. [2024-11-25 04:06:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:06:58,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:06:58,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:06:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:06:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:06:58,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-25 04:06:58,358 INFO L279 TraceCheckSpWp]: Computing forward predicates...