./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm --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 87608ec580cc80a59c7836f9aeadd0fc773dea5ebb620dd020651936daa4e397 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:17:32,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:17:32,460 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-11-13 21:17:32,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:17:32,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:17:32,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:17:32,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:17:32,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:17:32,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:17:32,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:17:32,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:17:32,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:17:32,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:17:32,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:17:32,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:17:32,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:17:32,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:17:32,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:17:32,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:17:32,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:17:32,515 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-13 21:17:32,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 21:17:32,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:17:32,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:17:32,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:17:32,518 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:17:32,518 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:17:32,518 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:17:32,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:17:32,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:17:32,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:17:32,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:17:32,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:17:32,519 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:17:32,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:17:32,520 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_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm 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 -> 87608ec580cc80a59c7836f9aeadd0fc773dea5ebb620dd020651936daa4e397 [2024-11-13 21:17:32,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:17:32,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:17:32,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:17:32,842 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:17:32,842 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:17:32,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c Unable to find full path for "g++" [2024-11-13 21:17:34,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:17:35,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:17:35,091 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c [2024-11-13 21:17:35,107 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/data/f60691eb5/2dda1981b0a4472b8223ba5e186a68ae/FLAG5e436b12b [2024-11-13 21:17:35,129 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/data/f60691eb5/2dda1981b0a4472b8223ba5e186a68ae [2024-11-13 21:17:35,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:17:35,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:17:35,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:17:35,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:17:35,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:17:35,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6fcaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35, skipping insertion in model container [2024-11-13 21:17:35,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:17:35,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:17:35,370 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:17:35,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:17:35,424 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:17:35,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35 WrapperNode [2024-11-13 21:17:35,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:17:35,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:17:35,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:17:35,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:17:35,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,490 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2024-11-13 21:17:35,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:17:35,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:17:35,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:17:35,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:17:35,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:17:35,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:17:35,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:17:35,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:17:35,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:17:35" (1/1) ... [2024-11-13 21:17:35,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:17:35,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:17:35,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:17:35,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:17:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:17:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 21:17:35,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 21:17:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:17:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:17:35,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:17:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 21:17:35,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 21:17:35,682 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:17:35,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:17:36,599 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-13 21:17:36,599 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:17:36,677 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:17:36,678 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:17:36,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:17:36 BoogieIcfgContainer [2024-11-13 21:17:36,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:17:36,679 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:17:36,679 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:17:36,698 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:17:36,698 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:17:36" (1/1) ... [2024-11-13 21:17:36,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:17:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 219 states and 223 transitions. [2024-11-13 21:17:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2024-11-13 21:17:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:17:36,788 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 219 states and 222 transitions. [2024-11-13 21:17:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 222 transitions. [2024-11-13 21:17:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:17:37,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 221 states and 225 transitions. [2024-11-13 21:17:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2024-11-13 21:17:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:17:37,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 222 states and 226 transitions. [2024-11-13 21:17:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 226 transitions. [2024-11-13 21:17:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:17:37,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:37,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 223 states and 227 transitions. [2024-11-13 21:17:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2024-11-13 21:17:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:17:37,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 222 states and 226 transitions. [2024-11-13 21:17:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 226 transitions. [2024-11-13 21:17:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:17:37,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:37,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 224 states and 228 transitions. [2024-11-13 21:17:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 228 transitions. [2024-11-13 21:17:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:17:37,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:37,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 225 states and 229 transitions. [2024-11-13 21:17:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2024-11-13 21:17:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 21:17:37,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:37,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 226 states and 230 transitions. [2024-11-13 21:17:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 230 transitions. [2024-11-13 21:17:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:17:37,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 225 states and 229 transitions. [2024-11-13 21:17:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2024-11-13 21:17:37,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 21:17:37,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:37,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 227 states and 231 transitions. [2024-11-13 21:17:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2024-11-13 21:17:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 21:17:37,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:37,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 228 states and 232 transitions. [2024-11-13 21:17:37,875 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2024-11-13 21:17:37,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:17:37,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:37,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:37,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:37,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 229 states and 233 transitions. [2024-11-13 21:17:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2024-11-13 21:17:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:17:38,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 228 states and 232 transitions. [2024-11-13 21:17:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2024-11-13 21:17:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:17:38,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 230 states and 234 transitions. [2024-11-13 21:17:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 234 transitions. [2024-11-13 21:17:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:17:38,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 231 states and 235 transitions. [2024-11-13 21:17:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2024-11-13 21:17:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 21:17:38,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 230 states and 234 transitions. [2024-11-13 21:17:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 234 transitions. [2024-11-13 21:17:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:17:38,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:38,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:38,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 232 states and 236 transitions. [2024-11-13 21:17:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 236 transitions. [2024-11-13 21:17:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:17:38,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:38,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:38,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 233 states and 237 transitions. [2024-11-13 21:17:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2024-11-13 21:17:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 21:17:38,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:38,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:38,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 234 states and 238 transitions. [2024-11-13 21:17:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 238 transitions. [2024-11-13 21:17:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:17:38,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 233 states and 237 transitions. [2024-11-13 21:17:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2024-11-13 21:17:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:17:38,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:38,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:38,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 235 states and 239 transitions. [2024-11-13 21:17:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 239 transitions. [2024-11-13 21:17:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 21:17:38,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:38,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:38,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 236 states and 240 transitions. [2024-11-13 21:17:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 240 transitions. [2024-11-13 21:17:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 21:17:38,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:38,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:39,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:39,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 237 states and 241 transitions. [2024-11-13 21:17:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 241 transitions. [2024-11-13 21:17:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 21:17:39,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:39,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:39,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 238 states and 242 transitions. [2024-11-13 21:17:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 242 transitions. [2024-11-13 21:17:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 21:17:39,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:39,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 237 states and 241 transitions. [2024-11-13 21:17:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 241 transitions. [2024-11-13 21:17:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:17:39,289 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 239 states and 243 transitions. [2024-11-13 21:17:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 243 transitions. [2024-11-13 21:17:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:17:39,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:39,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 240 states and 244 transitions. [2024-11-13 21:17:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2024-11-13 21:17:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:17:39,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 239 states and 243 transitions. [2024-11-13 21:17:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 243 transitions. [2024-11-13 21:17:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:17:39,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 241 states and 246 transitions. [2024-11-13 21:17:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 246 transitions. [2024-11-13 21:17:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 21:17:39,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 244 states and 251 transitions. [2024-11-13 21:17:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2024-11-13 21:17:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:17:39,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:39,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 248 states and 256 transitions. [2024-11-13 21:17:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 256 transitions. [2024-11-13 21:17:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:17:40,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 247 states and 255 transitions. [2024-11-13 21:17:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 255 transitions. [2024-11-13 21:17:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 21:17:40,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 253 states and 262 transitions. [2024-11-13 21:17:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 262 transitions. [2024-11-13 21:17:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:17:40,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:40,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:40,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:40,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 260 states and 269 transitions. [2024-11-13 21:17:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 269 transitions. [2024-11-13 21:17:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 21:17:40,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 259 states and 268 transitions. [2024-11-13 21:17:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 268 transitions. [2024-11-13 21:17:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 21:17:40,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 258 states and 267 transitions. [2024-11-13 21:17:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 267 transitions. [2024-11-13 21:17:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 21:17:40,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:41,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 257 states and 266 transitions. [2024-11-13 21:17:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 266 transitions. [2024-11-13 21:17:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 21:17:41,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:41,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:41,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:41,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 261 states and 270 transitions. [2024-11-13 21:17:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 270 transitions. [2024-11-13 21:17:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 21:17:41,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 260 states and 269 transitions. [2024-11-13 21:17:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 269 transitions. [2024-11-13 21:17:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 21:17:41,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 300 states and 311 transitions. [2024-11-13 21:17:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 311 transitions. [2024-11-13 21:17:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 21:17:41,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 301 states and 312 transitions. [2024-11-13 21:17:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 312 transitions. [2024-11-13 21:17:41,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 21:17:41,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:41,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 302 states and 313 transitions. [2024-11-13 21:17:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 313 transitions. [2024-11-13 21:17:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-13 21:17:42,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 303 states and 314 transitions. [2024-11-13 21:17:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 314 transitions. [2024-11-13 21:17:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 21:17:42,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:42,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 311 states and 325 transitions. [2024-11-13 21:17:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 325 transitions. [2024-11-13 21:17:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 21:17:42,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 357 states and 376 transitions. [2024-11-13 21:17:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 376 transitions. [2024-11-13 21:17:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 21:17:43,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 358 states and 377 transitions. [2024-11-13 21:17:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 377 transitions. [2024-11-13 21:17:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 21:17:43,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:43,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 359 states and 378 transitions. [2024-11-13 21:17:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 378 transitions. [2024-11-13 21:17:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-13 21:17:43,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 360 states and 379 transitions. [2024-11-13 21:17:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 379 transitions. [2024-11-13 21:17:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-13 21:17:43,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:43,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 363 states and 383 transitions. [2024-11-13 21:17:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 383 transitions. [2024-11-13 21:17:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 21:17:43,713 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 362 states and 382 transitions. [2024-11-13 21:17:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 382 transitions. [2024-11-13 21:17:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 21:17:43,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:43,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 363 states and 383 transitions. [2024-11-13 21:17:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 383 transitions. [2024-11-13 21:17:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-13 21:17:43,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:43,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 366 states and 386 transitions. [2024-11-13 21:17:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 386 transitions. [2024-11-13 21:17:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-13 21:17:44,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 365 states and 385 transitions. [2024-11-13 21:17:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 385 transitions. [2024-11-13 21:17:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 21:17:44,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 369 states and 389 transitions. [2024-11-13 21:17:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 389 transitions. [2024-11-13 21:17:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 21:17:44,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:44,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:17:44,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 371 states and 391 transitions. [2024-11-13 21:17:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 391 transitions. [2024-11-13 21:17:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 21:17:45,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 376 states and 396 transitions. [2024-11-13 21:17:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 396 transitions. [2024-11-13 21:17:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 21:17:45,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:45,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:45,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:45,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 377 states and 398 transitions. [2024-11-13 21:17:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 398 transitions. [2024-11-13 21:17:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-13 21:17:46,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:46,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 376 states and 397 transitions. [2024-11-13 21:17:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 397 transitions. [2024-11-13 21:17:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-13 21:17:46,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:46,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:46,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:46,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 378 states and 399 transitions. [2024-11-13 21:17:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 399 transitions. [2024-11-13 21:17:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-13 21:17:46,445 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 385 states and 406 transitions. [2024-11-13 21:17:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 406 transitions. [2024-11-13 21:17:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-13 21:17:47,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 384 states and 405 transitions. [2024-11-13 21:17:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 405 transitions. [2024-11-13 21:17:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 21:17:47,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:47,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 392 states and 413 transitions. [2024-11-13 21:17:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 413 transitions. [2024-11-13 21:17:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 21:17:47,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:47,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:17:47,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 395 states and 416 transitions. [2024-11-13 21:17:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 416 transitions. [2024-11-13 21:17:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 21:17:47,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:47,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 404 states and 425 transitions. [2024-11-13 21:17:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 425 transitions. [2024-11-13 21:17:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 21:17:48,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:48,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:48,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 405 states and 427 transitions. [2024-11-13 21:17:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 427 transitions. [2024-11-13 21:17:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 21:17:48,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 404 states and 426 transitions. [2024-11-13 21:17:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 426 transitions. [2024-11-13 21:17:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 21:17:48,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:48,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:48,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:48,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 406 states and 428 transitions. [2024-11-13 21:17:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 428 transitions. [2024-11-13 21:17:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 21:17:48,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 417 states and 439 transitions. [2024-11-13 21:17:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 439 transitions. [2024-11-13 21:17:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 21:17:49,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:49,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 432 states and 459 transitions. [2024-11-13 21:17:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 459 transitions. [2024-11-13 21:17:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 21:17:49,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 433 states and 460 transitions. [2024-11-13 21:17:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 460 transitions. [2024-11-13 21:17:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 21:17:49,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 434 states and 461 transitions. [2024-11-13 21:17:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 461 transitions. [2024-11-13 21:17:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 21:17:50,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:50,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 433 states and 460 transitions. [2024-11-13 21:17:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 460 transitions. [2024-11-13 21:17:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 21:17:50,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:50,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 435 states and 462 transitions. [2024-11-13 21:17:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 462 transitions. [2024-11-13 21:17:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 21:17:50,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:50,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 439 states and 467 transitions. [2024-11-13 21:17:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 467 transitions. [2024-11-13 21:17:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 21:17:51,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 442 states and 470 transitions. [2024-11-13 21:17:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 470 transitions. [2024-11-13 21:17:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 21:17:51,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 448 states and 477 transitions. [2024-11-13 21:17:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 477 transitions. [2024-11-13 21:17:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 21:17:51,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 452 states and 481 transitions. [2024-11-13 21:17:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 481 transitions. [2024-11-13 21:17:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 21:17:51,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:51,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:51,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:17:51,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 454 states and 483 transitions. [2024-11-13 21:17:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 483 transitions. [2024-11-13 21:17:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 21:17:52,160 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:52,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 453 states and 482 transitions. [2024-11-13 21:17:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 482 transitions. [2024-11-13 21:17:52,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:17:52,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 459 states and 488 transitions. [2024-11-13 21:17:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 488 transitions. [2024-11-13 21:17:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:17:52,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:52,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:52,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:52,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 461 states and 491 transitions. [2024-11-13 21:17:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 491 transitions. [2024-11-13 21:17:52,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 21:17:52,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:52,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 468 states and 498 transitions. [2024-11-13 21:17:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 498 transitions. [2024-11-13 21:17:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 21:17:53,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:53,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:53,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:53,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 471 states and 501 transitions. [2024-11-13 21:17:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 501 transitions. [2024-11-13 21:17:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 21:17:53,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 479 states and 509 transitions. [2024-11-13 21:17:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 509 transitions. [2024-11-13 21:17:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 21:17:54,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:54,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:54,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:17:54,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 481 states and 511 transitions. [2024-11-13 21:17:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 511 transitions. [2024-11-13 21:17:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:17:54,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 490 states and 520 transitions. [2024-11-13 21:17:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 520 transitions. [2024-11-13 21:17:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-13 21:17:55,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 489 states and 519 transitions. [2024-11-13 21:17:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 519 transitions. [2024-11-13 21:17:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-13 21:17:55,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:55,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:55,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:55,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 491 states and 522 transitions. [2024-11-13 21:17:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 522 transitions. [2024-11-13 21:17:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 21:17:55,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:55,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 502 states and 533 transitions. [2024-11-13 21:17:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 533 transitions. [2024-11-13 21:17:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 21:17:55,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:55,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:55,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 505 states and 536 transitions. [2024-11-13 21:17:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 536 transitions. [2024-11-13 21:17:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 21:17:56,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:56,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 506 states and 537 transitions. [2024-11-13 21:17:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 537 transitions. [2024-11-13 21:17:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 21:17:56,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:56,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:56,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:17:56,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 508 states and 539 transitions. [2024-11-13 21:17:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 539 transitions. [2024-11-13 21:17:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 21:17:56,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 507 states and 538 transitions. [2024-11-13 21:17:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 538 transitions. [2024-11-13 21:17:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 21:17:56,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 509 states and 541 transitions. [2024-11-13 21:17:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 541 transitions. [2024-11-13 21:17:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 21:17:56,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:56,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 511 states and 544 transitions. [2024-11-13 21:17:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 544 transitions. [2024-11-13 21:17:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 21:17:56,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 514 states and 549 transitions. [2024-11-13 21:17:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 549 transitions. [2024-11-13 21:17:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 21:17:56,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:56,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 517 states and 552 transitions. [2024-11-13 21:17:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 552 transitions. [2024-11-13 21:17:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 21:17:57,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 521 states and 557 transitions. [2024-11-13 21:17:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 557 transitions. [2024-11-13 21:17:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 21:17:57,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 520 states and 556 transitions. [2024-11-13 21:17:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 556 transitions. [2024-11-13 21:17:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 21:17:57,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:57,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:57,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:17:57,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 523 states and 559 transitions. [2024-11-13 21:17:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 559 transitions. [2024-11-13 21:17:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 21:17:57,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:57,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 529 states and 566 transitions. [2024-11-13 21:17:57,580 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 566 transitions. [2024-11-13 21:17:57,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 21:17:57,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:57,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:57,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:57,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 530 states and 568 transitions. [2024-11-13 21:17:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 568 transitions. [2024-11-13 21:17:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 21:17:57,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:57,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 537 states and 575 transitions. [2024-11-13 21:17:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 575 transitions. [2024-11-13 21:17:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 21:17:58,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:58,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:58,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:58,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 539 states and 577 transitions. [2024-11-13 21:17:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 577 transitions. [2024-11-13 21:17:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 21:17:58,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 538 states and 576 transitions. [2024-11-13 21:17:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 576 transitions. [2024-11-13 21:17:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 21:17:58,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 537 states and 575 transitions. [2024-11-13 21:17:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 575 transitions. [2024-11-13 21:17:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 21:17:58,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:58,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:17:58,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 540 states and 578 transitions. [2024-11-13 21:17:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 578 transitions. [2024-11-13 21:17:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 21:17:58,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:58,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 539 states and 577 transitions. [2024-11-13 21:17:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 577 transitions. [2024-11-13 21:17:59,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 21:17:59,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:59,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:59,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:59,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:17:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 540 states and 579 transitions. [2024-11-13 21:17:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 579 transitions. [2024-11-13 21:17:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 21:17:59,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:59,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:17:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:17:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 539 states and 578 transitions. [2024-11-13 21:17:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 578 transitions. [2024-11-13 21:17:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 21:17:59,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:17:59,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:17:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:17:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:17:59,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:17:59,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 541 states and 580 transitions. [2024-11-13 21:18:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 580 transitions. [2024-11-13 21:18:00,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 21:18:00,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:00,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 540 states and 579 transitions. [2024-11-13 21:18:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 579 transitions. [2024-11-13 21:18:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 21:18:00,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:00,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:00,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:18:00,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 542 states and 581 transitions. [2024-11-13 21:18:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 581 transitions. [2024-11-13 21:18:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 21:18:00,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 581 states and 622 transitions. [2024-11-13 21:18:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 622 transitions. [2024-11-13 21:18:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 21:18:01,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 582 states and 623 transitions. [2024-11-13 21:18:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 623 transitions. [2024-11-13 21:18:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 21:18:01,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:18:01,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 581 states and 622 transitions. [2024-11-13 21:18:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 622 transitions. [2024-11-13 21:18:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 21:18:01,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 582 states and 623 transitions. [2024-11-13 21:18:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 623 transitions. [2024-11-13 21:18:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 21:18:02,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:02,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:18:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 581 states and 622 transitions. [2024-11-13 21:18:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 622 transitions. [2024-11-13 21:18:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 21:18:02,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:02,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 580 states and 621 transitions. [2024-11-13 21:18:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 621 transitions. [2024-11-13 21:18:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 21:18:02,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 21:18:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 577 states and 616 transitions. [2024-11-13 21:18:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 616 transitions. [2024-11-13 21:18:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 21:18:03,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:03,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 21:18:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 573 states and 611 transitions. [2024-11-13 21:18:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 611 transitions. [2024-11-13 21:18:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 21:18:03,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:03,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:18:03,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:18:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 591 states and 631 transitions. [2024-11-13 21:18:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 631 transitions. [2024-11-13 21:18:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 21:18:04,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:18:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 586 states and 625 transitions. [2024-11-13 21:18:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 625 transitions. [2024-11-13 21:18:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 21:18:04,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:04,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:04,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 21:18:04,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:18:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 587 states and 626 transitions. [2024-11-13 21:18:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 626 transitions. [2024-11-13 21:18:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 21:18:05,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:18:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 586 states and 625 transitions. [2024-11-13 21:18:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 625 transitions. [2024-11-13 21:18:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 21:18:05,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:05,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-13 21:18:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 579 states and 617 transitions. [2024-11-13 21:18:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 617 transitions. [2024-11-13 21:18:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 21:18:05,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:18:05,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 581 states and 620 transitions. [2024-11-13 21:18:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 620 transitions. [2024-11-13 21:18:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 21:18:05,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:05,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:18:05,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 591 states and 630 transitions. [2024-11-13 21:18:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 630 transitions. [2024-11-13 21:18:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 21:18:05,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:06,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 21:18:06,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:18:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 590 states and 629 transitions. [2024-11-13 21:18:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 629 transitions. [2024-11-13 21:18:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 21:18:06,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:06,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:06,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:18:06,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 630 states and 672 transitions. [2024-11-13 21:18:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 672 transitions. [2024-11-13 21:18:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 21:18:09,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:09,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:18:09,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 671 states and 715 transitions. [2024-11-13 21:18:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 715 transitions. [2024-11-13 21:18:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 21:18:12,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:12,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 21:18:12,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 679 states and 724 transitions. [2024-11-13 21:18:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 724 transitions. [2024-11-13 21:18:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 21:18:15,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:15,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:18:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:15,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 21:18:15,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:18:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:18:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 681 states and 729 transitions. [2024-11-13 21:18:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 729 transitions. [2024-11-13 21:18:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 21:18:17,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:18:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 684 states and 736 transitions. [2024-11-13 21:18:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 736 transitions. [2024-11-13 21:18:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 21:18:17,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:17,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:18:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 742 states and 804 transitions. [2024-11-13 21:18:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 804 transitions. [2024-11-13 21:18:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 21:18:20,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:20,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:18:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 744 states and 809 transitions. [2024-11-13 21:18:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 809 transitions. [2024-11-13 21:18:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 21:18:21,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:21,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:18:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 803 states and 879 transitions. [2024-11-13 21:18:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 879 transitions. [2024-11-13 21:18:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 21:18:23,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:23,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:18:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 807 states and 888 transitions. [2024-11-13 21:18:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 888 transitions. [2024-11-13 21:18:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 21:18:24,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:24,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:18:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 809 states and 893 transitions. [2024-11-13 21:18:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 893 transitions. [2024-11-13 21:18:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 21:18:25,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:25,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:18:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 812 states and 899 transitions. [2024-11-13 21:18:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 899 transitions. [2024-11-13 21:18:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 21:18:26,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:18:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 816 states and 908 transitions. [2024-11-13 21:18:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 908 transitions. [2024-11-13 21:18:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 21:18:27,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:18:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 820 states and 915 transitions. [2024-11-13 21:18:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 915 transitions. [2024-11-13 21:18:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 21:18:27,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:27,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:18:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 824 states and 924 transitions. [2024-11-13 21:18:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 924 transitions. [2024-11-13 21:18:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 21:18:29,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:29,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:18:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 928 states and 1037 transitions. [2024-11-13 21:18:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1037 transitions. [2024-11-13 21:18:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 21:18:34,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:18:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 932 states and 1047 transitions. [2024-11-13 21:18:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1047 transitions. [2024-11-13 21:18:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 21:18:35,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:35,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:18:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 368 states and 384 transitions. [2024-11-13 21:18:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 384 transitions. [2024-11-13 21:18:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 21:18:36,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 21:18:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 362 states and 378 transitions. [2024-11-13 21:18:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 378 transitions. [2024-11-13 21:18:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 21:18:38,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:38,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 21:18:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 354 states and 370 transitions. [2024-11-13 21:18:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 370 transitions. [2024-11-13 21:18:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 21:18:40,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:40,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 21:18:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 345 states and 361 transitions. [2024-11-13 21:18:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 361 transitions. [2024-11-13 21:18:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 21:18:41,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:41,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 21:18:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 335 states and 351 transitions. [2024-11-13 21:18:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 351 transitions. [2024-11-13 21:18:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 21:18:43,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 21:18:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 334 states and 350 transitions. [2024-11-13 21:18:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 350 transitions. [2024-11-13 21:18:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 21:18:43,835 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 21:18:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 333 states and 349 transitions. [2024-11-13 21:18:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 349 transitions. [2024-11-13 21:18:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 21:18:43,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:18:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 330 states and 346 transitions. [2024-11-13 21:18:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 346 transitions. [2024-11-13 21:18:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 21:18:44,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:18:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 326 states and 342 transitions. [2024-11-13 21:18:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 342 transitions. [2024-11-13 21:18:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 21:18:44,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:44,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-13 21:18:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 321 states and 337 transitions. [2024-11-13 21:18:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 337 transitions. [2024-11-13 21:18:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 21:18:44,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 21:18:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 314 states and 330 transitions. [2024-11-13 21:18:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 330 transitions. [2024-11-13 21:18:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 21:18:44,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 21:18:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 306 states and 322 transitions. [2024-11-13 21:18:45,389 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 322 transitions. [2024-11-13 21:18:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 21:18:45,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:45,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 21:18:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 297 states and 313 transitions. [2024-11-13 21:18:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 313 transitions. [2024-11-13 21:18:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 21:18:46,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:46,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 21:18:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 287 states and 303 transitions. [2024-11-13 21:18:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 303 transitions. [2024-11-13 21:18:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 21:18:48,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 21:18:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 286 states and 302 transitions. [2024-11-13 21:18:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 302 transitions. [2024-11-13 21:18:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 21:18:48,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 21:18:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 285 states and 301 transitions. [2024-11-13 21:18:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 301 transitions. [2024-11-13 21:18:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 21:18:49,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:18:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 282 states and 296 transitions. [2024-11-13 21:18:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 296 transitions. [2024-11-13 21:18:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 21:18:49,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:18:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 278 states and 291 transitions. [2024-11-13 21:18:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 291 transitions. [2024-11-13 21:18:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 21:18:49,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:49,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-13 21:18:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 273 states and 285 transitions. [2024-11-13 21:18:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 285 transitions. [2024-11-13 21:18:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 21:18:50,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:50,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 21:18:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 266 states and 277 transitions. [2024-11-13 21:18:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 277 transitions. [2024-11-13 21:18:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 21:18:50,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 21:18:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 258 states and 269 transitions. [2024-11-13 21:18:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 269 transitions. [2024-11-13 21:18:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 21:18:50,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:50,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 21:18:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 271 states and 282 transitions. [2024-11-13 21:18:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 282 transitions. [2024-11-13 21:18:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 21:18:53,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:53,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 21:18:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 257 states and 268 transitions. [2024-11-13 21:18:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 268 transitions. [2024-11-13 21:18:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 21:18:55,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:55,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 21:18:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 271 states and 282 transitions. [2024-11-13 21:18:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 282 transitions. [2024-11-13 21:18:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 21:18:57,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 21:18:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:18:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 256 states and 267 transitions. [2024-11-13 21:18:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 267 transitions. [2024-11-13 21:18:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 21:18:58,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:18:58,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:18:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:18:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:19:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 270 states and 281 transitions. [2024-11-13 21:19:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 281 transitions. [2024-11-13 21:19:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 21:19:03,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 21:19:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 254 states and 265 transitions. [2024-11-13 21:19:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 265 transitions. [2024-11-13 21:19:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 21:19:10,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:10,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:19:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:10,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 21:19:10,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:19:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:19:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 272 states and 287 transitions. [2024-11-13 21:19:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 287 transitions. [2024-11-13 21:19:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 21:19:23,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:23,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:19:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:23,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 21:19:23,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:19:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:19:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 253 states and 264 transitions. [2024-11-13 21:19:26,997 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 264 transitions. [2024-11-13 21:19:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-13 21:19:26,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 21:19:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:27,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 21:19:27,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 21:19:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:19:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 252 states and 263 transitions. [2024-11-13 21:19:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 263 transitions. [2024-11-13 21:19:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 21:19:31,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:19:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:19:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:19:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:19:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:19:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 251 states and 262 transitions. [2024-11-13 21:19:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 262 transitions. [2024-11-13 21:19:34,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:19:34,598 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 177 iterations. [2024-11-13 21:19:34,607 INFO L729 CodeCheckObserver]: All specifications hold 102 specifications checked. All of them hold [2024-11-13 21:19:59,676 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,676 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,676 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,676 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,677 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,677 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,677 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,677 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,677 INFO L77 FloydHoareUtils]: At program point L36(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,677 INFO L77 FloydHoareUtils]: At program point L36-1(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,677 INFO L77 FloydHoareUtils]: At program point L36-2(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,677 INFO L77 FloydHoareUtils]: At program point L36-3(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,678 INFO L77 FloydHoareUtils]: At program point L36-4(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,678 INFO L77 FloydHoareUtils]: At program point L36-5(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,678 INFO L77 FloydHoareUtils]: At program point L36-6(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,678 INFO L77 FloydHoareUtils]: At program point L36-7(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,678 INFO L77 FloydHoareUtils]: At program point L36-8(line 36) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (not (= |ULTIMATE.start_main_~x~0#1| 0)) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 9223372036854775807) (< 1 |ULTIMATE.start_main_~y~0#1|)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (< |ULTIMATE.start_main_~y~0#1| 1) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-11-13 21:19:59,678 INFO L77 FloydHoareUtils]: At program point L36-9(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,678 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,679 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,679 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-13 21:19:59,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,679 INFO L77 FloydHoareUtils]: At program point L21(line 21) the Hoare annotation is: true [2024-11-13 21:19:59,679 INFO L77 FloydHoareUtils]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1)) [2024-11-13 21:19:59,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2024-11-13 21:19:59,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,679 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,679 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-13 21:19:59,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2024-11-13 21:19:59,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,679 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,679 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,679 INFO L77 FloydHoareUtils]: At program point L22(line 22) the Hoare annotation is: true [2024-11-13 21:19:59,679 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,680 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,680 INFO L77 FloydHoareUtils]: At program point L39(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,680 INFO L77 FloydHoareUtils]: At program point L39-1(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,680 INFO L77 FloydHoareUtils]: At program point L39-2(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,680 INFO L77 FloydHoareUtils]: At program point L39-3(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,680 INFO L77 FloydHoareUtils]: At program point L39-4(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,680 INFO L77 FloydHoareUtils]: At program point L39-5(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,680 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-11-13 21:19:59,681 INFO L77 FloydHoareUtils]: At program point L39-6(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,681 INFO L77 FloydHoareUtils]: At program point L39-7(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,681 INFO L77 FloydHoareUtils]: At program point L39-8(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,681 INFO L77 FloydHoareUtils]: At program point L39-9(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,681 INFO L77 FloydHoareUtils]: At program point L39-10(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-11-13 21:19:59,681 INFO L77 FloydHoareUtils]: At program point L39-11(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-11-13 21:19:59,681 INFO L77 FloydHoareUtils]: At program point L39-12(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-11-13 21:19:59,681 INFO L77 FloydHoareUtils]: At program point L39-13(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-11-13 21:19:59,681 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,682 INFO L77 FloydHoareUtils]: At program point L39-14(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-11-13 21:19:59,682 INFO L77 FloydHoareUtils]: At program point L39-15(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-11-13 21:19:59,682 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,682 INFO L77 FloydHoareUtils]: At program point L39-16(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-11-13 21:19:59,682 INFO L77 FloydHoareUtils]: At program point L39-17(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-11-13 21:19:59,682 INFO L77 FloydHoareUtils]: At program point L39-18(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-11-13 21:19:59,682 INFO L77 FloydHoareUtils]: At program point L39-19(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-11-13 21:19:59,682 INFO L77 FloydHoareUtils]: At program point L39-20(line 39) the Hoare annotation is: (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) [2024-11-13 21:19:59,682 INFO L77 FloydHoareUtils]: At program point L39-21(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,682 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-22(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-23(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-24(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-25(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-26(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-27(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-28(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-29(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-30(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-31(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L40(line 40) the Hoare annotation is: true [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-32(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L40-1(line 40) the Hoare annotation is: true [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,683 INFO L77 FloydHoareUtils]: At program point L39-33(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L40-2(line 40) the Hoare annotation is: true [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L39-34(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L40-3(line 40) the Hoare annotation is: true [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L39-35(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L40-4(line 40) the Hoare annotation is: true [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L39-36(line 39) the Hoare annotation is: (not (and (< (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L39-37(line 39) the Hoare annotation is: (not (and (< (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,684 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L39-38(line 39) the Hoare annotation is: (not (and (< (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L39-39(line 39) the Hoare annotation is: (let ((.cse2 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse3 (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse4 (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse5 (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (let ((.cse0 (<= (+ .cse2 .cse1) (+ .cse3 9223372036854775807 .cse4 .cse5)))) (or (and .cse0 (<= .cse1 9223372036854775807)) (and (not (and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 (+ 1537228672809129301 |ULTIMATE.start_main_~y~0#1|)))) .cse0) (<= (+ .cse2 9223372036854775809 .cse1) (+ .cse3 .cse4 .cse5))))) [2024-11-13 21:19:59,684 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L39-40(line 39) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (<= (+ (* |ULTIMATE.start_main_~x~0#1| 12) .cse1) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 9223372036854775807 (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))))) (or (and .cse0 (<= .cse1 9223372036854775807)) (and (not (and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 (+ 1537228672809129301 |ULTIMATE.start_main_~y~0#1|)))) .cse0)))) [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L39-41(line 39) the Hoare annotation is: (or (not (and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 (+ 1537228672809129301 |ULTIMATE.start_main_~y~0#1|)))) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 9223372036854775807)) [2024-11-13 21:19:59,684 INFO L77 FloydHoareUtils]: At program point L39-42(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,685 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,685 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,685 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,685 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) the Hoare annotation is: true [2024-11-13 21:19:59,685 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,685 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:19:59,686 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,686 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,686 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,686 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,686 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,686 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,686 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-13 21:19:59,686 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,687 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,687 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,687 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,687 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,687 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2024-11-13 21:19:59,687 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,687 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,687 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,687 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) the Hoare annotation is: true [2024-11-13 21:19:59,688 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,688 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-13 21:19:59,688 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,688 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-11-13 21:19:59,688 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,688 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,688 INFO L77 FloydHoareUtils]: At program point L28-2(lines 28 37) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,688 INFO L77 FloydHoareUtils]: At program point L28-3(lines 28 37) the Hoare annotation is: true [2024-11-13 21:19:59,688 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,689 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,689 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,689 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,689 INFO L77 FloydHoareUtils]: At program point L29(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,689 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,689 INFO L77 FloydHoareUtils]: At program point L29-1(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,689 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) the Hoare annotation is: true [2024-11-13 21:19:59,689 INFO L77 FloydHoareUtils]: At program point L29-2(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,690 INFO L77 FloydHoareUtils]: At program point L29-3(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,690 INFO L77 FloydHoareUtils]: At program point L29-4(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,690 INFO L77 FloydHoareUtils]: At program point L29-5(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,690 INFO L77 FloydHoareUtils]: At program point L29-6(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,690 INFO L77 FloydHoareUtils]: At program point L29-7(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,690 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,690 INFO L77 FloydHoareUtils]: At program point L29-8(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,690 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,690 INFO L77 FloydHoareUtils]: At program point L29-9(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,690 INFO L77 FloydHoareUtils]: At program point L29-10(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-11(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-12(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-13(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-14(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-15(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-16(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-17(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-18(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-19(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-20(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-21(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,691 INFO L77 FloydHoareUtils]: At program point L29-22(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,692 INFO L77 FloydHoareUtils]: At program point L29-23(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-11-13 21:19:59,692 INFO L77 FloydHoareUtils]: At program point L29-24(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-11-13 21:19:59,693 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,693 INFO L77 FloydHoareUtils]: At program point L29-25(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-11-13 21:19:59,693 INFO L77 FloydHoareUtils]: At program point L29-26(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-11-13 21:19:59,693 INFO L77 FloydHoareUtils]: At program point L29-27(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-11-13 21:19:59,694 INFO L77 FloydHoareUtils]: At program point L29-28(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-11-13 21:19:59,694 INFO L77 FloydHoareUtils]: At program point L29-29(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-11-13 21:19:59,694 INFO L77 FloydHoareUtils]: At program point L29-30(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-11-13 21:19:59,694 INFO L77 FloydHoareUtils]: At program point L29-31(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-11-13 21:19:59,695 INFO L77 FloydHoareUtils]: At program point L29-32(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,695 INFO L77 FloydHoareUtils]: At program point L29-33(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse1 (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse1 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse1) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0) (and (not .cse0) .cse1))) [2024-11-13 21:19:59,695 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,696 INFO L77 FloydHoareUtils]: At program point L29-34(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse1 (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse1 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse1) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0) (and (not .cse0) .cse1))) [2024-11-13 21:19:59,696 INFO L77 FloydHoareUtils]: At program point L29-35(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse1 (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse1 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse1) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0) (and (not .cse0) .cse1))) [2024-11-13 21:19:59,696 INFO L77 FloydHoareUtils]: At program point L29-36(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse1 (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse1 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse1) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0) (and (not .cse0) .cse1))) [2024-11-13 21:19:59,697 INFO L77 FloydHoareUtils]: At program point L29-37(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))))) (or (and (<= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) .cse0) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse1) (and .cse1 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1)))) (and (< |ULTIMATE.start_main_~c~0#1| 1) .cse1) (and (not (and (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))) (not .cse0)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse1))) [2024-11-13 21:19:59,697 INFO L77 FloydHoareUtils]: At program point L29-38(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))))) (or (and (<= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) .cse0) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse1) (and .cse1 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1)))) (and (< |ULTIMATE.start_main_~c~0#1| 1) .cse1) (and (not (and (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))) (not .cse0)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse1))) [2024-11-13 21:19:59,697 INFO L77 FloydHoareUtils]: At program point L29-39(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))))) (or (and (<= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) .cse0) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse1) (and .cse1 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1)))) (and (< |ULTIMATE.start_main_~c~0#1| 1) .cse1) (and (not (and (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))) (not .cse0)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse1))) [2024-11-13 21:19:59,697 INFO L77 FloydHoareUtils]: At program point L29-40(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-11-13 21:19:59,697 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,697 INFO L77 FloydHoareUtils]: At program point L29-41(line 29) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (< 1 |ULTIMATE.start_main_~c~0#1|) (and (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~c~0#1|))) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4611686018427387904)) (not (and (<= |ULTIMATE.start_main_~x~0#1| 768614336404564650) (<= |ULTIMATE.start_main_~x~0#1| .cse0) (<= .cse1 1537228672809129301))) (and (< 4611686018427387904 (+ .cse2 (* 3 .cse0))) (<= .cse2 4611686018427387904)) (< (+ (* 6 .cse0) (* 2 .cse2) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) 9223372036854775809 .cse1)) (< |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,698 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,698 INFO L77 FloydHoareUtils]: At program point L29-42(line 29) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (< 1 |ULTIMATE.start_main_~c~0#1|) (< 4611686018427387904 (+ .cse0 (* 3 .cse1))) (and (<= |ULTIMATE.start_main_~x~0#1| 768614336404564650) (< 0 (+ 768614336404564651 |ULTIMATE.start_main_~x~0#1|))) (< |ULTIMATE.start_main_~c~0#1| 1) (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~c~0#1|))) (and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (< (+ (* 6 .cse1) (* 2 .cse0) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) 9223372036854775809 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))))) [2024-11-13 21:19:59,698 INFO L77 FloydHoareUtils]: At program point L29-43(lines 28 37) the Hoare annotation is: true [2024-11-13 21:19:59,698 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,698 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,698 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,698 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-13 21:19:59,698 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,698 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,698 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,698 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,698 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,698 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-13 21:19:59,698 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,698 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,698 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,698 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,699 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,699 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,699 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point L34(line 34) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point L34-1(line 34) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,699 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) the Hoare annotation is: true [2024-11-13 21:19:59,699 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-13 21:19:59,699 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) the Hoare annotation is: true [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-13 21:19:59,699 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-13 21:19:59,700 INFO L77 FloydHoareUtils]: At program point L35(line 35) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,700 INFO L77 FloydHoareUtils]: At program point L35-1(line 35) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-11-13 21:19:59,700 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2024-11-13 21:19:59,700 INFO L77 FloydHoareUtils]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (not (= |assume_abort_if_not_#in~cond| 0)) [2024-11-13 21:19:59,700 INFO L77 FloydHoareUtils]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: true [2024-11-13 21:19:59,700 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2024-11-13 21:19:59,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:19:59 ImpRootNode [2024-11-13 21:19:59,727 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:19:59,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:19:59,728 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:19:59,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:19:59,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:17:36" (3/4) ... [2024-11-13 21:19:59,733 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:19:59,736 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-13 21:19:59,736 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-13 21:19:59,746 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-13 21:19:59,747 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-13 21:19:59,747 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 21:19:59,748 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:19:59,859 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:19:59,860 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:19:59,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:19:59,861 INFO L158 Benchmark]: Toolchain (without parser) took 144727.11ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 94.1MB in the beginning and 699.3MB in the end (delta: -605.2MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. [2024-11-13 21:19:59,861 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:19:59,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.78ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 82.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:19:59,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.31ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 80.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:19:59,863 INFO L158 Benchmark]: Boogie Preprocessor took 42.66ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.4MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:19:59,864 INFO L158 Benchmark]: RCFGBuilder took 1140.47ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 43.8MB in the end (delta: 35.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 21:19:59,864 INFO L158 Benchmark]: CodeCheck took 143047.71ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 43.8MB in the beginning and 703.6MB in the end (delta: -659.9MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2024-11-13 21:19:59,866 INFO L158 Benchmark]: Witness Printer took 132.48ms. Allocated memory is still 906.0MB. Free memory was 703.6MB in the beginning and 699.3MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:19:59,867 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 3 procedures, 219 locations, 102 error locations. Started 1 CEGAR loops. OverallTime: 117.9s, OverallIterations: 177, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151892 SdHoareTripleChecker+Valid, 450.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129349 mSDsluCounter, 13631 SdHoareTripleChecker+Invalid, 385.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4504 mSDsCounter, 19587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287854 IncrementalHoareTripleChecker+Invalid, 307441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19587 mSolverCounterUnsat, 9127 mSDtfsCounter, 287854 mSolverCounterSat, 6.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93244 GetRequests, 88278 SyntacticMatches, 4310 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 24 DeprecatedPredicates, 304155 ImplicationChecksByTransitivity, 86.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 14371 NumberOfCodeBlocks, 14371 NumberOfCodeBlocksAsserted, 176 NumberOfCheckSat, 14195 ConstructedInterpolants, 81 QuantifiedInterpolants, 52108 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5126 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 176 InterpolantComputations, 148 PerfectInterpolantSequences, 2281/3072 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 102 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: !(((((((0 <= k) && (c <= 1)) && (1 <= c)) && (x <= (((((__int128) y * y) * y) * y) * y))) && (y == 1)) && (1 <= x)) && (k < 1)) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.78ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 82.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.31ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 80.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.66ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.4MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1140.47ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 43.8MB in the end (delta: 35.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * CodeCheck took 143047.71ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 43.8MB in the beginning and 703.6MB in the end (delta: -659.9MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. * Witness Printer took 132.48ms. Allocated memory is still 906.0MB. Free memory was 703.6MB in the beginning and 699.3MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 21:19:59,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b64d66c-436c-4481-93d1-ba1e2df3a695/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE