./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound20.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_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6a7b66d62d8261743d542694624b328b551f76289ee08b3039b7ca01c3c317e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:23:09,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:23:09,757 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-12-06 05:23:09,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:23:09,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:23:09,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:23:09,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:23:09,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:23:09,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:23:09,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:23:09,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:23:09,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:23:09,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:23:09,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:23:09,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:23:09,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:23:09,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:23:09,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:23:09,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:23:09,781 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-06 05:23:09,781 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 05:23:09,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:23:09,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:23:09,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:23:09,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:23:09,781 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:23:09,781 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:23:09,781 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:23:09,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:23:09,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:23:09,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:23:09,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:23:09,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:23:09,782 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:23:09,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:23:09,782 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_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6a7b66d62d8261743d542694624b328b551f76289ee08b3039b7ca01c3c317e [2024-12-06 05:23:09,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:23:09,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:23:09,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:23:09,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:23:09,991 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:23:09,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound20.c [2024-12-06 05:23:12,589 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/data/ac555b8d7/838f454cf17a4006be9ed8050bdc7e58/FLAG63c9c2450 [2024-12-06 05:23:12,788 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:23:12,789 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound20.c [2024-12-06 05:23:12,796 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/data/ac555b8d7/838f454cf17a4006be9ed8050bdc7e58/FLAG63c9c2450 [2024-12-06 05:23:13,174 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/data/ac555b8d7/838f454cf17a4006be9ed8050bdc7e58 [2024-12-06 05:23:13,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:23:13,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:23:13,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:23:13,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:23:13,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:23:13,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ef688b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13, skipping insertion in model container [2024-12-06 05:23:13,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:23:13,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:23:13,316 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:23:13,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:23:13,345 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:23:13,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13 WrapperNode [2024-12-06 05:23:13,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:23:13,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:23:13,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:23:13,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:23:13,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,372 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2024-12-06 05:23:13,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:23:13,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:23:13,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:23:13,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:23:13,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:23:13,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:23:13,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:23:13,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:23:13,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:23:13,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:23:13,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:23:13,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1933eefa-ba6f-4a6e-a763-c50e436fc5db/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:23:13,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:23:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-06 05:23:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-06 05:23:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:23:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:23:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:23:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-06 05:23:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-06 05:23:13,489 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:23:13,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:23:13,800 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-12-06 05:23:13,800 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:23:13,829 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:23:13,830 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 05:23:13,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:23:13 BoogieIcfgContainer [2024-12-06 05:23:13,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:23:13,831 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:23:13,831 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:23:13,839 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:23:13,840 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:23:13" (1/1) ... [2024-12-06 05:23:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:23:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 103 states and 111 transitions. [2024-12-06 05:23:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2024-12-06 05:23:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 05:23:13,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:13,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:13,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-06 05:23:13,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:23:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 104 states and 115 transitions. [2024-12-06 05:23:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2024-12-06 05:23:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:23:14,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:14,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:14,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:23:14,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 106 states and 122 transitions. [2024-12-06 05:23:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2024-12-06 05:23:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:23:14,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:14,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-06 05:23:14,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:23:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 109 states and 130 transitions. [2024-12-06 05:23:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2024-12-06 05:23:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 05:23:15,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:15,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-06 05:23:15,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 113 states and 138 transitions. [2024-12-06 05:23:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2024-12-06 05:23:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 05:23:15,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:15,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 118 states and 148 transitions. [2024-12-06 05:23:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2024-12-06 05:23:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 05:23:16,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:16,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 119 states and 149 transitions. [2024-12-06 05:23:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 149 transitions. [2024-12-06 05:23:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 05:23:16,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:16,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-06 05:23:16,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:23:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 126 states and 162 transitions. [2024-12-06 05:23:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 162 transitions. [2024-12-06 05:23:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 05:23:17,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:17,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-06 05:23:17,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 134 states and 176 transitions. [2024-12-06 05:23:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2024-12-06 05:23:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 05:23:18,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:18,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 137 states and 181 transitions. [2024-12-06 05:23:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2024-12-06 05:23:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 05:23:18,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 136 states and 180 transitions. [2024-12-06 05:23:19,377 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 180 transitions. [2024-12-06 05:23:19,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 05:23:19,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 144 states and 195 transitions. [2024-12-06 05:23:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2024-12-06 05:23:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 05:23:20,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:20,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:20,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 144 states and 195 transitions. [2024-12-06 05:23:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2024-12-06 05:23:20,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 05:23:20,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 153 states and 212 transitions. [2024-12-06 05:23:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 212 transitions. [2024-12-06 05:23:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 05:23:22,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:22,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 155 states and 215 transitions. [2024-12-06 05:23:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 215 transitions. [2024-12-06 05:23:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 05:23:22,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 163 states and 232 transitions. [2024-12-06 05:23:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 232 transitions. [2024-12-06 05:23:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 05:23:24,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:24,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 173 states and 250 transitions. [2024-12-06 05:23:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-12-06 05:23:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 05:23:26,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 176 states and 255 transitions. [2024-12-06 05:23:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2024-12-06 05:23:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 05:23:27,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:23:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 181 states and 264 transitions. [2024-12-06 05:23:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 264 transitions. [2024-12-06 05:23:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 05:23:30,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:30,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 184 states and 269 transitions. [2024-12-06 05:23:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 269 transitions. [2024-12-06 05:23:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 05:23:30,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:30,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 195 states and 291 transitions. [2024-12-06 05:23:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 291 transitions. [2024-12-06 05:23:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 05:23:32,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:32,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 05:23:32,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 207 states and 313 transitions. [2024-12-06 05:23:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 313 transitions. [2024-12-06 05:23:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 05:23:34,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:34,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 211 states and 320 transitions. [2024-12-06 05:23:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 320 transitions. [2024-12-06 05:23:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:23:36,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:36,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:23:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 210 states and 319 transitions. [2024-12-06 05:23:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 319 transitions. [2024-12-06 05:23:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 05:23:39,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:39,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 213 states and 324 transitions. [2024-12-06 05:23:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 324 transitions. [2024-12-06 05:23:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 05:23:39,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:39,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:39,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 05:23:39,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 217 states and 331 transitions. [2024-12-06 05:23:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 331 transitions. [2024-12-06 05:23:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 05:23:40,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:40,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:40,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 05:23:40,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 221 states and 337 transitions. [2024-12-06 05:23:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 337 transitions. [2024-12-06 05:23:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 05:23:42,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 226 states and 346 transitions. [2024-12-06 05:23:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 346 transitions. [2024-12-06 05:23:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:23:43,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:43,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 230 states and 352 transitions. [2024-12-06 05:23:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 352 transitions. [2024-12-06 05:23:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:23:44,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:44,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:44,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 05:23:44,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 234 states and 358 transitions. [2024-12-06 05:23:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2024-12-06 05:23:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:23:45,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 245 states and 378 transitions. [2024-12-06 05:23:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 378 transitions. [2024-12-06 05:23:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:23:47,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:47,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 246 states and 381 transitions. [2024-12-06 05:23:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 381 transitions. [2024-12-06 05:23:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 05:23:47,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:47,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 250 states and 388 transitions. [2024-12-06 05:23:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2024-12-06 05:23:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 05:23:49,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:49,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 256 states and 398 transitions. [2024-12-06 05:23:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 398 transitions. [2024-12-06 05:23:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 05:23:50,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:50,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 257 states and 403 transitions. [2024-12-06 05:23:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 403 transitions. [2024-12-06 05:23:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 05:23:52,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:52,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:23:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:52,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-06 05:23:52,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:23:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:23:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 270 states and 427 transitions. [2024-12-06 05:23:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 427 transitions. [2024-12-06 05:23:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:23:56,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:56,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:23:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:23:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 274 states and 434 transitions. [2024-12-06 05:23:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 434 transitions. [2024-12-06 05:23:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:23:58,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:23:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:23:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:23:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:24:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:24:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 275 states and 442 transitions. [2024-12-06 05:24:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 442 transitions. [2024-12-06 05:24:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:24:00,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:24:00,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:24:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:24:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:24:00,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-06 05:24:00,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:24:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:24:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:24:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 288 states and 462 transitions. [2024-12-06 05:24:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 462 transitions. [2024-12-06 05:24:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 05:24:05,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:24:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:24:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:24:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:24:05,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-06 05:24:05,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:24:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:24:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:24:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 294 states and 479 transitions. [2024-12-06 05:24:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 479 transitions. [2024-12-06 05:24:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:24:11,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:24:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:24:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:24:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:24:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:24:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 293 states and 478 transitions. [2024-12-06 05:24:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 478 transitions. [2024-12-06 05:24:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:24:12,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:24:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:24:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:24:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:24:12,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-12-06 05:24:12,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:24:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:24:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:24:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 302 states and 503 transitions. [2024-12-06 05:24:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 503 transitions. [2024-12-06 05:24:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:24:17,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:24:17,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:24:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:24:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:24:17,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-06 05:24:17,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:24:29,841 WARN L286 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-06 05:24:40,398 WARN L286 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-06 05:24:50,459 WARN L286 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-06 05:25:00,530 WARN L286 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-06 05:25:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:25:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:25:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 317 states and 536 transitions. [2024-12-06 05:25:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 536 transitions. [2024-12-06 05:25:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:25:54,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:25:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:25:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:25:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:25:54,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-06 05:25:54,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:25:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:25:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:25:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 319 states and 544 transitions. [2024-12-06 05:25:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 544 transitions. [2024-12-06 05:25:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:25:58,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:25:58,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:25:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:25:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:25:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:25:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 321 states and 546 transitions. [2024-12-06 05:25:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 546 transitions. [2024-12-06 05:25:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:25:59,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:25:59,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:25:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:25:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:25:59,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-06 05:25:59,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:26:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:26:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:26:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 342 states and 593 transitions. [2024-12-06 05:26:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 593 transitions. [2024-12-06 05:26:41,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:26:41,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:26:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:26:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:26:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:26:41,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-06 05:26:41,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:28:55,126 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:28:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:29:16,003 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse1 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1| 0)))) (and .cse0 (not (and .cse0 .cse1 .cse2 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int)) (let ((.cse3 (* v_y_15 2)) (.cse4 (+ (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |c_ULTIMATE.start_main_~p~0#1|) 2)))) (and (<= (+ .cse3 1) |ULTIMATE.start_main_~y~0#1|) (<= .cse4 9223372036854775807) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse3) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse4)))))) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse5 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|))) (and (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse5 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~b~0#1| 1) |v_ULTIMATE.start_main_~b~0#1_82|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse5)))) .cse1 .cse2 (= |c_ULTIMATE.start_main_~p~0#1| 1) (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|))) is different from false [2024-12-06 05:29:28,013 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse1 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1| 0)))) (and .cse0 (not (and .cse0 .cse1 .cse2 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int)) (let ((.cse3 (* v_y_15 2)) (.cse4 (+ (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |c_ULTIMATE.start_main_~p~0#1|) 2)))) (and (<= (+ .cse3 1) |ULTIMATE.start_main_~y~0#1|) (<= .cse4 9223372036854775807) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse3) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse4)))))) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse5 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|))) (and (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse5 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~b~0#1| 1) |v_ULTIMATE.start_main_~b~0#1_82|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse5)))) .cse1 .cse2 (= |c_ULTIMATE.start_main_~p~0#1| 1) (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|)))) is different from true [2024-12-06 05:29:49,795 WARN L286 SmtUtils]: Spent 10.31s on a formula simplification. DAG size of input: 46 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:32:01,288 WARN L286 SmtUtils]: Spent 8.50s 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-12-06 05:32:11,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse4 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse5 (not (= |c_ULTIMATE.start_main_~a~0#1| 0))) (.cse0 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|))) (and (<= .cse0 9223372036854775807) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int) (|ULTIMATE.start_main_~p~0#1| Int)) (let ((.cse2 (* v_y_15 2)) (.cse3 (+ (* 2 (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |ULTIMATE.start_main_~p~0#1|)) (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|)))) (and (<= (+ .cse2 1) |ULTIMATE.start_main_~y~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse3) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse2) (<= .cse3 9223372036854775807)))) .cse4 .cse5)) .cse4 .cse5 (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse6 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|))) (and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|) 9223372036854775807) (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse6 9223372036854775807) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse6) (<= (+ |c_ULTIMATE.start_main_~b~0#1| 1) |v_ULTIMATE.start_main_~b~0#1_82|)))) (<= 0 (+ 9223372036854775808 .cse0)))) is different from false [2024-12-06 05:33:03,933 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse4 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse5 (not (= |c_ULTIMATE.start_main_~a~0#1| 0))) (.cse0 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|))) (and (<= .cse0 9223372036854775807) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int) (|ULTIMATE.start_main_~p~0#1| Int)) (let ((.cse2 (* v_y_15 2)) (.cse3 (+ (* 2 (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |ULTIMATE.start_main_~p~0#1|)) (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|)))) (and (<= (+ .cse2 1) |ULTIMATE.start_main_~y~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse3) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse2) (<= .cse3 9223372036854775807)))) .cse4 .cse5)) .cse4 .cse5 (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse6 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|))) (and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|) 9223372036854775807) (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse6 9223372036854775807) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse6) (<= (+ |c_ULTIMATE.start_main_~b~0#1| 1) |v_ULTIMATE.start_main_~b~0#1_82|)))) (<= 0 (+ 9223372036854775808 .cse0))))) is different from true [2024-12-06 05:33:33,818 WARN L286 SmtUtils]: Spent 18.89s on a formula simplification. DAG size of input: 43 DAG size of output: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:33:43,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse3 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1| 0)))) (and (<= (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|) 9223372036854775807) .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int) (|ULTIMATE.start_main_~p~0#1| Int)) (let ((.cse1 (* v_y_15 2)) (.cse2 (+ (* 2 (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |ULTIMATE.start_main_~p~0#1|)) (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|)))) (and (<= (+ .cse1 1) |ULTIMATE.start_main_~y~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse1) (<= .cse2 9223372036854775807)))) .cse3 .cse4)) .cse3 .cse4 (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse5 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|))) (and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|) 9223372036854775807) (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse5 9223372036854775807) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse5) (<= (+ |c_ULTIMATE.start_main_~b~0#1| 1) |v_ULTIMATE.start_main_~b~0#1_82|)))))) is different from false [2024-12-06 05:35:04,926 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse3 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1| 0)))) (and (<= (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|) 9223372036854775807) .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int) (|ULTIMATE.start_main_~p~0#1| Int)) (let ((.cse1 (* v_y_15 2)) (.cse2 (+ (* 2 (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |ULTIMATE.start_main_~p~0#1|)) (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|)))) (and (<= (+ .cse1 1) |ULTIMATE.start_main_~y~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse1) (<= .cse2 9223372036854775807)))) .cse3 .cse4)) .cse3 .cse4 (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse5 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|))) (and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|) 9223372036854775807) (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse5 9223372036854775807) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse5) (<= (+ |c_ULTIMATE.start_main_~b~0#1| 1) |v_ULTIMATE.start_main_~b~0#1_82|))))))) is different from true [2024-12-06 05:35:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:35:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 347 states and 622 transitions. [2024-12-06 05:35:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 622 transitions. [2024-12-06 05:35:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:35:06,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:35:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:35:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:35:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:35:06,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-06 05:35:06,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:35:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:36:26,151 WARN L286 SmtUtils]: Spent 10.22s on a formula simplification. DAG size of input: 48 DAG size of output: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:37:07,154 WARN L286 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:37:17,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse3 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1| 0))) (.cse6 (+ |c_ULTIMATE.start_main_~b~0#1| 1))) (and (<= (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|) 9223372036854775807) .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int) (|ULTIMATE.start_main_~p~0#1| Int)) (let ((.cse1 (* v_y_15 2)) (.cse2 (+ (* 2 (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |ULTIMATE.start_main_~p~0#1|)) (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|)))) (and (<= (+ .cse1 1) |ULTIMATE.start_main_~y~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse1) (<= .cse2 9223372036854775807)))) .cse3 .cse4)) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~b~0#1|) (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|)))) (and (<= .cse5 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) .cse5)))) .cse3 (<= 1 (mod .cse6 2)) .cse4 (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 0 .cse6) (<= 0 |c_ULTIMATE.start_main_~b~0#1|) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse7 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|))) (and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|) 9223372036854775807) (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse7 9223372036854775807) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse7) (<= .cse6 |v_ULTIMATE.start_main_~b~0#1_82|)))))) is different from false [2024-12-06 05:37:27,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse3 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1| 0))) (.cse6 (+ |c_ULTIMATE.start_main_~b~0#1| 1))) (and (<= (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|) 9223372036854775807) .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int) (|ULTIMATE.start_main_~p~0#1| Int)) (let ((.cse1 (* v_y_15 2)) (.cse2 (+ (* 2 (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |ULTIMATE.start_main_~p~0#1|)) (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|)))) (and (<= (+ .cse1 1) |ULTIMATE.start_main_~y~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse1) (<= .cse2 9223372036854775807)))) .cse3 .cse4)) (not (and .cse0 (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~b~0#1|) (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|)))) (and (<= .cse5 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) .cse5)))) .cse3 (<= 1 (mod .cse6 2)) .cse4 (<= 0 .cse6))) .cse3 .cse4 (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse7 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|))) (and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|) 9223372036854775807) (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse7 9223372036854775807) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse7) (<= .cse6 |v_ULTIMATE.start_main_~b~0#1_82|)))))) is different from false [2024-12-06 05:37:37,887 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse3 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 (not (= |c_ULTIMATE.start_main_~a~0#1| 0))) (.cse6 (+ |c_ULTIMATE.start_main_~b~0#1| 1))) (and (<= (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|) 9223372036854775807) .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int) (|ULTIMATE.start_main_~p~0#1| Int)) (let ((.cse1 (* v_y_15 2)) (.cse2 (+ (* 2 (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |ULTIMATE.start_main_~p~0#1|)) (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|)))) (and (<= (+ .cse1 1) |ULTIMATE.start_main_~y~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse1) (<= .cse2 9223372036854775807)))) .cse3 .cse4)) (not (and .cse0 (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~b~0#1|) (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|)))) (and (<= .cse5 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) .cse5)))) .cse3 (<= 1 (mod .cse6 2)) .cse4 (<= 0 .cse6))) .cse3 .cse4 (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse7 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|))) (and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~p~0#1|) 9223372036854775807) (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse7 9223372036854775807) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse7) (<= .cse6 |v_ULTIMATE.start_main_~b~0#1_82|))))))) is different from true [2024-12-06 05:37:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:37:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 350 states and 632 transitions. [2024-12-06 05:37:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 632 transitions. [2024-12-06 05:37:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:37:39,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:37:39,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:37:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:37:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:37:39,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-06 05:37:39,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:37:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:37:49,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse1 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1| 0)))) (and .cse0 (not (and .cse0 .cse1 .cse2 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int)) (let ((.cse3 (* v_y_15 2)) (.cse4 (+ (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |c_ULTIMATE.start_main_~p~0#1|) 2)))) (and (<= (+ .cse3 1) |ULTIMATE.start_main_~y~0#1|) (<= .cse4 9223372036854775807) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse3) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse4)))))) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse5 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|))) (and (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse5 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~b~0#1| 1) |v_ULTIMATE.start_main_~b~0#1_82|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse5)))) .cse1 .cse2 (= |c_ULTIMATE.start_main_~p~0#1| 1) (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 1 |c_ULTIMATE.start_main_~p~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|))) is different from false [2024-12-06 05:37:58,303 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse1 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1| 0)))) (and .cse0 (not (and .cse0 .cse1 .cse2 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int)) (let ((.cse3 (* v_y_15 2)) (.cse4 (+ (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |c_ULTIMATE.start_main_~p~0#1|) 2)))) (and (<= (+ .cse3 1) |ULTIMATE.start_main_~y~0#1|) (<= .cse4 9223372036854775807) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse3) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse4)))))) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse5 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|))) (and (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse5 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~b~0#1| 1) |v_ULTIMATE.start_main_~b~0#1_82|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse5)))) .cse1 .cse2 (= |c_ULTIMATE.start_main_~p~0#1| 1) (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 1 |c_ULTIMATE.start_main_~p~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|)))) is different from true [2024-12-06 05:37:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:37:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 350 states and 632 transitions. [2024-12-06 05:37:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 632 transitions. [2024-12-06 05:37:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:37:58,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:37:58,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:37:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:37:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:37:58,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-06 05:37:58,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:37:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:37:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:37:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 350 states and 632 transitions. [2024-12-06 05:37:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 632 transitions. [2024-12-06 05:37:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:37:59,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:37:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:37:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:37:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:37:59,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-06 05:37:59,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:38:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:38:19,839 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (<= |c_ULTIMATE.start_main_~a~0#1| 20)) (.cse1 (<= 0 |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1| 0))) (.cse3 (exists ((|ULTIMATE.start_main_~y~0#1| Int) (v_y_15 Int)) (let ((.cse5 (* v_y_15 2)) (.cse6 (+ (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_15 |c_ULTIMATE.start_main_~p~0#1|) 2)))) (and (<= (+ .cse5 1) |ULTIMATE.start_main_~y~0#1|) (<= .cse6 9223372036854775807) (<= 0 v_y_15) (<= |c_ULTIMATE.start_main_~b~0#1| .cse5) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse6)))))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3)) (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|v_ULTIMATE.start_main_~b~0#1_82| Int)) (let ((.cse4 (* |v_ULTIMATE.start_main_~b~0#1_82| |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~p~0#1|))) (and (<= |v_ULTIMATE.start_main_~b~0#1_82| |ULTIMATE.start_main_~y~0#1|) (<= .cse4 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~b~0#1| 1) |v_ULTIMATE.start_main_~b~0#1_82|) (<= (* |c_ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse4)))) .cse1 .cse2 (= |c_ULTIMATE.start_main_~p~0#1| 1) (= 0 |c_ULTIMATE.start_main_~q~0#1|) (<= 1 |c_ULTIMATE.start_main_~p~0#1|) (<= 0 |c_ULTIMATE.start_main_~b~0#1|) .cse3)) is different from false