./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/geo3-ll2_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/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_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/geo3-ll2_unwindbound1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91c207b4b9ec9497b682edea4de56d410c70b882e6c03e91b56844bba1af20ff --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:54:08,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:54:08,781 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-11-25 03:54:08,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:54:08,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:54:08,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:54:08,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:54:08,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:54:08,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:54:08,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:54:08,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:54:08,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:54:08,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:54:08,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:54:08,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:54:08,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:54:08,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:54:08,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:54:08,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:54:08,827 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-25 03:54:08,827 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-25 03:54:08,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:54:08,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:54:08,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:54:08,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:54:08,829 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:54:08,829 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:54:08,829 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:54:08,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:54:08,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:54:08,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:54:08,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:54:08,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:54:08,830 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:54:08,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:54:08,830 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_e06b3d6e-2095-4d17-936a-41db46fcbf0f/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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 91c207b4b9ec9497b682edea4de56d410c70b882e6c03e91b56844bba1af20ff [2024-11-25 03:54:09,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:54:09,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:54:09,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:54:09,172 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:54:09,172 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:54:09,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/nla-digbench-scaling/geo3-ll2_unwindbound1.c [2024-11-25 03:54:12,141 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3/data/43200b0cc/1a3a1d222ef24d00b1192015bd6b1777/FLAG9134b7232 [2024-11-25 03:54:12,438 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:54:12,439 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/sv-benchmarks/c/nla-digbench-scaling/geo3-ll2_unwindbound1.c [2024-11-25 03:54:12,453 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3/data/43200b0cc/1a3a1d222ef24d00b1192015bd6b1777/FLAG9134b7232 [2024-11-25 03:54:12,475 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3/data/43200b0cc/1a3a1d222ef24d00b1192015bd6b1777 [2024-11-25 03:54:12,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:54:12,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:54:12,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:54:12,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:54:12,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:54:12,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c13d281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12, skipping insertion in model container [2024-11-25 03:54:12,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:54:12,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:54:12,675 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:54:12,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:54:12,717 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:54:12,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12 WrapperNode [2024-11-25 03:54:12,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:54:12,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:54:12,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:54:12,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:54:12,727 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:54:12" (1/1) ... [2024-11-25 03:54:12,733 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:54:12" (1/1) ... [2024-11-25 03:54:12,756 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2024-11-25 03:54:12,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:54:12,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:54:12,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:54:12,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:54:12,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:54:12,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:54:12,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:54:12,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:54:12,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:12" (1/1) ... [2024-11-25 03:54:12,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:54:12,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:54:12,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/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:54:12,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e06b3d6e-2095-4d17-936a-41db46fcbf0f/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:54:12,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:54:12,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:54:12,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:54:12,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:54:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-25 03:54:12,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-25 03:54:12,927 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:54:12,929 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:54:13,383 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-11-25 03:54:13,383 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:54:13,422 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:54:13,422 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-25 03:54:13,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:54:13 BoogieIcfgContainer [2024-11-25 03:54:13,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:54:13,424 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:54:13,424 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:54:13,433 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:54:13,433 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:54:13" (1/1) ... [2024-11-25 03:54:13,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:54:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 74 states and 77 transitions. [2024-11-25 03:54:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-25 03:54:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-25 03:54:13,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:13,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:54:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:13,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 03:54:13,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:54:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 73 states and 76 transitions. [2024-11-25 03:54:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-25 03:54:13,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 03:54:13,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:13,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:54:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:13,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 03:54:13,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:54:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 72 states and 75 transitions. [2024-11-25 03:54:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-25 03:54:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-25 03:54:13,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 72 states and 74 transitions. [2024-11-25 03:54:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-11-25 03:54:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-25 03:54:13,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:13,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 74 states and 77 transitions. [2024-11-25 03:54:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-25 03:54:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 03:54:14,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 75 states and 78 transitions. [2024-11-25 03:54:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-25 03:54:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 03:54:14,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:54:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:14,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-25 03:54:14,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:54:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 80 states and 85 transitions. [2024-11-25 03:54:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-25 03:54:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 03:54:15,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:15,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 81 states and 86 transitions. [2024-11-25 03:54:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-25 03:54:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 03:54:15,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:15,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:54:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:15,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-25 03:54:15,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:54:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 87 states and 93 transitions. [2024-11-25 03:54:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-11-25 03:54:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 03:54:17,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:17,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:54:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:17,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-25 03:54:17,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:54:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 94 states and 102 transitions. [2024-11-25 03:54:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2024-11-25 03:54:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:54:18,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:54:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:18,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 03:54:18,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:54:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 95 states and 104 transitions. [2024-11-25 03:54:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2024-11-25 03:54:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 03:54:19,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 104 states and 117 transitions. [2024-11-25 03:54:21,262 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2024-11-25 03:54:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:54:21,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 114 states and 131 transitions. [2024-11-25 03:54:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2024-11-25 03:54:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:54:23,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:23,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:54:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:23,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 03:54:23,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:54:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 125 states and 148 transitions. [2024-11-25 03:54:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2024-11-25 03:54:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 03:54:29,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:29,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:54:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:29,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 03:54:29,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:54:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:55:00,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1| 1))) (and (<= 0 (+ |c_ULTIMATE.start_main_~a~0#1| 2147483648)) .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse2)) (<= .cse2 |c_ULTIMATE.start_main_~az~0#1|)))) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~a~0#1| 2147483647) (= c_~counter~0 0) (<= |c_ULTIMATE.start_main_~z~0#1| 2147483647))) is different from false [2024-11-25 03:56:19,476 WARN L286 SmtUtils]: Spent 39.43s on a formula simplification. DAG size of input: 35 DAG size of output: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:56:22,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse2)) (<= .cse2 |c_ULTIMATE.start_main_~az~0#1|)))) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~x~0#1|) (= |c_ULTIMATE.start_main_#t~post7#1| 0) (<= |c_ULTIMATE.start_main_~z~0#1| 2147483647))) is different from false [2024-11-25 03:56:26,426 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse2)) (<= .cse2 |c_ULTIMATE.start_main_~az~0#1|)))) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~x~0#1|) (= |c_ULTIMATE.start_main_#t~post7#1| 0) (<= |c_ULTIMATE.start_main_~z~0#1| 2147483647)))) is different from true [2024-11-25 03:57:50,909 WARN L286 SmtUtils]: Spent 44.84s on a formula simplification. DAG size of input: 33 DAG size of output: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:57:59,729 WARN L873 $PredicateComparison]: unable to prove that (not (and (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) (= |c_ULTIMATE.start_main_~y~0#1| 1) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~x~0#1|) (not (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse0) (<= .cse0 9223372036854775807))))) (<= |c_ULTIMATE.start_main_~z~0#1| 2147483647))) is different from true [2024-11-25 03:58:02,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-25 03:58:07,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) 9223372036854775808)) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse2)) (<= .cse2 |c_ULTIMATE.start_main_~az~0#1|)))) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~x~0#1|) (<= |c_ULTIMATE.start_main_~z~0#1| 2147483647))) is different from false [2024-11-25 04:00:46,099 WARN L286 SmtUtils]: Spent 1.28m on a formula simplification. DAG size of input: 36 DAG size of output: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 04:00:49,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-25 04:00:52,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-25 04:01:02,240 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| .cse0 9223372036854775808)) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse2) (<= .cse2 9223372036854775807)))))) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse3)) (<= .cse3 |c_ULTIMATE.start_main_~az~0#1|)))) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= (+ |c_ULTIMATE.start_main_~a~0#1| .cse0) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807)) (<= |c_ULTIMATE.start_main_~z~0#1| 2147483647))) is different from false [2024-11-25 04:01:37,837 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| .cse0 9223372036854775808)) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse2) (<= .cse2 9223372036854775807)))))) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse3)) (<= .cse3 |c_ULTIMATE.start_main_~az~0#1|)))) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= (+ |c_ULTIMATE.start_main_~a~0#1| .cse0) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807)) (<= |c_ULTIMATE.start_main_~z~0#1| 2147483647)))) is different from true [2024-11-25 04:04:33,998 WARN L286 SmtUtils]: Spent 1.26m on a formula simplification. DAG size of input: 35 DAG size of output: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 04:04:44,211 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| .cse0 9223372036854775808)) (<= .cse0 9223372036854775807) (= |c_ULTIMATE.start_main_~y~0#1| 1) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= (+ |c_ULTIMATE.start_main_~a~0#1| .cse0) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807)) (not (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))))) is different from true [2024-11-25 04:06:43,572 WARN L286 SmtUtils]: Spent 10.52s on a formula simplification. DAG size of input: 29 DAG size of output: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 04:07:03,780 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| .cse0 9223372036854775808)) (= |c_ULTIMATE.start_main_~y~0#1| 1) (<= (+ |c_ULTIMATE.start_main_~a~0#1| .cse0) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807)) (not (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))))) is different from true [2024-11-25 04:08:47,896 WARN L286 SmtUtils]: Spent 33.60s on a formula simplification. DAG size of input: 27 DAG size of output: 19 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 04:09:00,372 WARN L873 $PredicateComparison]: unable to prove that (not (and (= |c_ULTIMATE.start_main_~y~0#1| 1) (<= (+ |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807)) (not (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse0) (<= .cse0 9223372036854775807))))))) is different from true [2024-11-25 04:09:03,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-25 04:09:20,237 WARN L286 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 04:09:23,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1| 1))) (and .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse2)) (<= .cse2 |c_ULTIMATE.start_main_~az~0#1|)))))) is different from false [2024-11-25 04:09:39,664 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1| 1))) (and .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse2)) (<= .cse2 |c_ULTIMATE.start_main_~az~0#1|))))))) is different from true [2024-11-25 04:09:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:39,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:39,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:39,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:39,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:39,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:39,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:39,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:40,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:40,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:40,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:40,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:40,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:40,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:40,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:40,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:40,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:40,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:40,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:40,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:41,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:41,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:41,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:41,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:41,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:41,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:41,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:41,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:41,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:41,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:41,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:41,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:41,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:41,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:41,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:41,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:42,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:42,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:42,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:42,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:42,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:42,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:42,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:42,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:42,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:42,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:42,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:42,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:42,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:42,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:42,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:42,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:09:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:09:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:09:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-25 04:09:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-25 04:09:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:09:43,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:09:43,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:09:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:09:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:09:43,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-25 04:09:43,142 INFO L279 TraceCheckSpWp]: Computing forward predicates...