./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/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_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk --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.2.5-dev-a016563 [2024-11-08 23:33:11,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:33:11,943 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-11-08 23:33:11,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:33:11,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:33:11,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:33:11,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:33:11,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:33:11,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:33:11,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:33:11,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:33:11,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:33:11,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:33:11,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:33:11,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:33:11,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:33:11,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:33:11,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:33:11,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:33:11,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:33:11,999 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-08 23:33:12,002 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 23:33:12,002 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:33:12,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:33:12,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:33:12,003 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:33:12,003 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:33:12,004 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:33:12,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:33:12,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:33:12,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:33:12,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:33:12,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:33:12,006 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:33:12,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:33:12,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk 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-08 23:33:12,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:33:12,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:33:12,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:33:12,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:33:12,319 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:33:12,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c Unable to find full path for "g++" [2024-11-08 23:33:14,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:33:14,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:33:14,597 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c [2024-11-08 23:33:14,604 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/data/0d4465d63/11e9130e91424990986b5d2d938b9800/FLAG353901eec [2024-11-08 23:33:14,982 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/data/0d4465d63/11e9130e91424990986b5d2d938b9800 [2024-11-08 23:33:14,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:33:14,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:33:14,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:33:14,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:33:14,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:33:14,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:33:14" (1/1) ... [2024-11-08 23:33:14,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51cde588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:14, skipping insertion in model container [2024-11-08 23:33:14,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:33:14" (1/1) ... [2024-11-08 23:33:15,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:33:15,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:33:15,239 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:33:15,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:33:15,280 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:33:15,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15 WrapperNode [2024-11-08 23:33:15,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:33:15,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:33:15,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:33:15,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:33:15,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,329 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2024-11-08 23:33:15,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:33:15,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:33:15,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:33:15,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:33:15,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:33:15,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:33:15,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:33:15,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:33:15,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:33:15" (1/1) ... [2024-11-08 23:33:15,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:33:15,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:33:15,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:33:15,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:33:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:33:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:33:15,437 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:33:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:33:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:33:15,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:33:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 23:33:15,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 23:33:15,499 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:33:15,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:33:16,199 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-08 23:33:16,199 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:33:16,269 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:33:16,269 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:33:16,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:33:16 BoogieIcfgContainer [2024-11-08 23:33:16,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:33:16,272 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:33:16,273 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:33:16,284 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:33:16,284 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:33:16" (1/1) ... [2024-11-08 23:33:16,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:33:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 219 states and 223 transitions. [2024-11-08 23:33:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2024-11-08 23:33:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:33:16,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:16,540 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-08 23:33:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 219 states and 222 transitions. [2024-11-08 23:33:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 222 transitions. [2024-11-08 23:33:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:33:16,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:16,690 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-08 23:33:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 221 states and 225 transitions. [2024-11-08 23:33:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2024-11-08 23:33:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:33:16,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:16,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:16,815 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-08 23:33:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 222 states and 226 transitions. [2024-11-08 23:33:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 226 transitions. [2024-11-08 23:33:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:33:16,836 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:16,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:16,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:16,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:16,949 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-08 23:33:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 223 states and 227 transitions. [2024-11-08 23:33:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2024-11-08 23:33:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:33:16,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:16,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,023 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-08 23:33:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 222 states and 226 transitions. [2024-11-08 23:33:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 226 transitions. [2024-11-08 23:33:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:33:17,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:17,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:17,110 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-08 23:33:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 224 states and 228 transitions. [2024-11-08 23:33:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 228 transitions. [2024-11-08 23:33:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:33:17,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:17,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:17,191 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-08 23:33:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 225 states and 229 transitions. [2024-11-08 23:33:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2024-11-08 23:33:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:33:17,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:17,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:17,265 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-08 23:33:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 226 states and 230 transitions. [2024-11-08 23:33:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 230 transitions. [2024-11-08 23:33:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:33:17,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,326 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-08 23:33:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 225 states and 229 transitions. [2024-11-08 23:33:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2024-11-08 23:33:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 23:33:17,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:17,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:17,406 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-08 23:33:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 227 states and 231 transitions. [2024-11-08 23:33:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2024-11-08 23:33:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 23:33:17,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:17,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:17,509 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-08 23:33:17,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 228 states and 232 transitions. [2024-11-08 23:33:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2024-11-08 23:33:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 23:33:17,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:17,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:17,604 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-08 23:33:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 229 states and 233 transitions. [2024-11-08 23:33:17,620 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2024-11-08 23:33:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:33:17,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,654 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-08 23:33:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 228 states and 232 transitions. [2024-11-08 23:33:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2024-11-08 23:33:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:33:17,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,726 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-08 23:33:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 230 states and 234 transitions. [2024-11-08 23:33:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 234 transitions. [2024-11-08 23:33:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:33:17,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,805 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-08 23:33:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 231 states and 235 transitions. [2024-11-08 23:33:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2024-11-08 23:33:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 23:33:17,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,846 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-08 23:33:17,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 230 states and 234 transitions. [2024-11-08 23:33:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 234 transitions. [2024-11-08 23:33:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:33:17,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:17,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:17,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:17,933 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-08 23:33:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 232 states and 236 transitions. [2024-11-08 23:33:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 236 transitions. [2024-11-08 23:33:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:33:17,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:17,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:18,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:18,040 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-08 23:33:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 233 states and 237 transitions. [2024-11-08 23:33:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2024-11-08 23:33:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:33:18,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:18,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:18,122 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-08 23:33:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 234 states and 238 transitions. [2024-11-08 23:33:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 238 transitions. [2024-11-08 23:33:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 23:33:18,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,154 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-08 23:33:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 233 states and 237 transitions. [2024-11-08 23:33:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2024-11-08 23:33:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 23:33:18,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:18,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:18,239 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-08 23:33:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 235 states and 239 transitions. [2024-11-08 23:33:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 239 transitions. [2024-11-08 23:33:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 23:33:18,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:18,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:18,329 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-08 23:33:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 236 states and 240 transitions. [2024-11-08 23:33:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 240 transitions. [2024-11-08 23:33:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 23:33:18,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:18,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:18,428 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-08 23:33:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 237 states and 241 transitions. [2024-11-08 23:33:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 241 transitions. [2024-11-08 23:33:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 23:33:18,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:18,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:18,539 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-08 23:33:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 238 states and 242 transitions. [2024-11-08 23:33:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 242 transitions. [2024-11-08 23:33:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 23:33:18,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,586 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-08 23:33:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 237 states and 241 transitions. [2024-11-08 23:33:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 241 transitions. [2024-11-08 23:33:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 23:33:18,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,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-08 23:33:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 239 states and 243 transitions. [2024-11-08 23:33:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 243 transitions. [2024-11-08 23:33:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:33:18,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,750 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-08 23:33:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 240 states and 244 transitions. [2024-11-08 23:33:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2024-11-08 23:33:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:33:18,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,796 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-08 23:33:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 239 states and 243 transitions. [2024-11-08 23:33:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 243 transitions. [2024-11-08 23:33:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:33:18,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,875 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-08 23:33:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 241 states and 246 transitions. [2024-11-08 23:33:18,925 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 246 transitions. [2024-11-08 23:33:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 23:33:18,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:18,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-08 23:33:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 244 states and 251 transitions. [2024-11-08 23:33:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2024-11-08 23:33:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:33:19,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:19,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-08 23:33:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 248 states and 256 transitions. [2024-11-08 23:33:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 256 transitions. [2024-11-08 23:33:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:33:19,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:19,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:19,382 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-08 23:33:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 247 states and 255 transitions. [2024-11-08 23:33:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 255 transitions. [2024-11-08 23:33:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 23:33:19,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:19,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:19,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-08 23:33:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 253 states and 262 transitions. [2024-11-08 23:33:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 262 transitions. [2024-11-08 23:33:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:33:19,674 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:19,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:19,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:19,801 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-08 23:33:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 260 states and 269 transitions. [2024-11-08 23:33:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 269 transitions. [2024-11-08 23:33:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:33:19,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:19,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:19,926 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-08 23:33:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 259 states and 268 transitions. [2024-11-08 23:33:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 268 transitions. [2024-11-08 23:33:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 23:33:19,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:19,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-08 23:33:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 258 states and 267 transitions. [2024-11-08 23:33:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 267 transitions. [2024-11-08 23:33:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:33:19,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:20,078 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-08 23:33:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 257 states and 266 transitions. [2024-11-08 23:33:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 266 transitions. [2024-11-08 23:33:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 23:33:20,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:20,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:20,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:20,281 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-08 23:33:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 261 states and 270 transitions. [2024-11-08 23:33:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 270 transitions. [2024-11-08 23:33:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 23:33:20,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:20,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:20,404 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-08 23:33:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 260 states and 269 transitions. [2024-11-08 23:33:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 269 transitions. [2024-11-08 23:33:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 23:33:20,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:20,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:20,487 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-08 23:33:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 300 states and 311 transitions. [2024-11-08 23:33:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 311 transitions. [2024-11-08 23:33:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 23:33:20,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:20,878 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-08 23:33:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 301 states and 312 transitions. [2024-11-08 23:33:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 312 transitions. [2024-11-08 23:33:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 23:33:20,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:20,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:21,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-08 23:33:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 302 states and 313 transitions. [2024-11-08 23:33:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 313 transitions. [2024-11-08 23:33:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 23:33:21,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:21,339 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-08 23:33:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 303 states and 314 transitions. [2024-11-08 23:33:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 314 transitions. [2024-11-08 23:33:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 23:33:21,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:21,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-08 23:33:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 311 states and 325 transitions. [2024-11-08 23:33:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 325 transitions. [2024-11-08 23:33:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 23:33:21,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:21,814 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-08 23:33:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 357 states and 376 transitions. [2024-11-08 23:33:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 376 transitions. [2024-11-08 23:33:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 23:33:22,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:22,321 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-08 23:33:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 358 states and 377 transitions. [2024-11-08 23:33:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 377 transitions. [2024-11-08 23:33:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 23:33:22,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:22,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-08 23:33:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 359 states and 378 transitions. [2024-11-08 23:33:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 378 transitions. [2024-11-08 23:33:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 23:33:22,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:22,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:22,480 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-08 23:33:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 360 states and 379 transitions. [2024-11-08 23:33:22,562 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 379 transitions. [2024-11-08 23:33:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 23:33:22,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:22,630 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-08 23:33:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 363 states and 383 transitions. [2024-11-08 23:33:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 383 transitions. [2024-11-08 23:33:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 23:33:22,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:22,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:22,789 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-08 23:33:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 362 states and 382 transitions. [2024-11-08 23:33:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 382 transitions. [2024-11-08 23:33:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 23:33:22,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:22,868 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-08 23:33:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 363 states and 383 transitions. [2024-11-08 23:33:22,893 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 383 transitions. [2024-11-08 23:33:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 23:33:22,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:22,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-08 23:33:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 366 states and 386 transitions. [2024-11-08 23:33:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 386 transitions. [2024-11-08 23:33:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 23:33:23,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:23,305 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-08 23:33:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 365 states and 385 transitions. [2024-11-08 23:33:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 385 transitions. [2024-11-08 23:33:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 23:33:23,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:23,405 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-08 23:33:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 369 states and 389 transitions. [2024-11-08 23:33:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 389 transitions. [2024-11-08 23:33:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 23:33:23,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:23,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:23,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:23,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:23,877 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-08 23:33:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 371 states and 391 transitions. [2024-11-08 23:33:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 391 transitions. [2024-11-08 23:33:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 23:33:23,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:24,047 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-08 23:33:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 376 states and 396 transitions. [2024-11-08 23:33:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 396 transitions. [2024-11-08 23:33:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 23:33:24,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:24,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:24,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:24,640 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-08 23:33:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 377 states and 398 transitions. [2024-11-08 23:33:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 398 transitions. [2024-11-08 23:33:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 23:33:24,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:24,839 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-08 23:33:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 376 states and 397 transitions. [2024-11-08 23:33:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 397 transitions. [2024-11-08 23:33:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 23:33:24,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:24,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:24,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:25,072 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-08 23:33:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 378 states and 399 transitions. [2024-11-08 23:33:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 399 transitions. [2024-11-08 23:33:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:33:25,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:25,310 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-08 23:33:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 385 states and 406 transitions. [2024-11-08 23:33:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 406 transitions. [2024-11-08 23:33:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 23:33:25,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:25,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:25,757 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-08 23:33:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 384 states and 405 transitions. [2024-11-08 23:33:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 405 transitions. [2024-11-08 23:33:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 23:33:25,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:25,876 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-08 23:33:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 392 states and 413 transitions. [2024-11-08 23:33:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 413 transitions. [2024-11-08 23:33:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 23:33:26,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:26,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:26,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:26,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:26,466 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-08 23:33:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 395 states and 416 transitions. [2024-11-08 23:33:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 416 transitions. [2024-11-08 23:33:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 23:33:26,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:26,651 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-08 23:33:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 404 states and 425 transitions. [2024-11-08 23:33:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 425 transitions. [2024-11-08 23:33:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 23:33:27,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:27,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:27,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:27,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-08 23:33:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 405 states and 427 transitions. [2024-11-08 23:33:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 427 transitions. [2024-11-08 23:33:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 23:33:27,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:27,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:27,335 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-08 23:33:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 404 states and 426 transitions. [2024-11-08 23:33:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 426 transitions. [2024-11-08 23:33:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 23:33:27,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:27,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:27,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:27,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:27,514 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-08 23:33:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 406 states and 428 transitions. [2024-11-08 23:33:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 428 transitions. [2024-11-08 23:33:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 23:33:27,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:27,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:27,668 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-08 23:33:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 417 states and 439 transitions. [2024-11-08 23:33:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 439 transitions. [2024-11-08 23:33:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 23:33:27,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:27,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-08 23:33:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 432 states and 459 transitions. [2024-11-08 23:33:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 459 transitions. [2024-11-08 23:33:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 23:33:28,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:28,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-08 23:33:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 433 states and 460 transitions. [2024-11-08 23:33:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 460 transitions. [2024-11-08 23:33:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 23:33:28,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:28,756 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-08 23:33:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 434 states and 461 transitions. [2024-11-08 23:33:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 461 transitions. [2024-11-08 23:33:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 23:33:29,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:29,154 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-08 23:33:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 433 states and 460 transitions. [2024-11-08 23:33:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 460 transitions. [2024-11-08 23:33:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 23:33:29,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:29,203 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-08 23:33:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 435 states and 462 transitions. [2024-11-08 23:33:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 462 transitions. [2024-11-08 23:33:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 23:33:29,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:29,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:29,338 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-08 23:33:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 439 states and 467 transitions. [2024-11-08 23:33:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 467 transitions. [2024-11-08 23:33:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 23:33:29,713 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:29,762 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-08 23:33:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 442 states and 470 transitions. [2024-11-08 23:33:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 470 transitions. [2024-11-08 23:33:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 23:33:29,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:29,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:29,890 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-08 23:33:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 448 states and 477 transitions. [2024-11-08 23:33:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 477 transitions. [2024-11-08 23:33:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 23:33:30,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:30,372 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-08 23:33:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 452 states and 481 transitions. [2024-11-08 23:33:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 481 transitions. [2024-11-08 23:33:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 23:33:30,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:30,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:30,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:30,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:30,607 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-08 23:33:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 454 states and 483 transitions. [2024-11-08 23:33:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 483 transitions. [2024-11-08 23:33:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 23:33:30,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:30,797 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-08 23:33:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 453 states and 482 transitions. [2024-11-08 23:33:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 482 transitions. [2024-11-08 23:33:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 23:33:30,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:30,848 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-08 23:33:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 459 states and 488 transitions. [2024-11-08 23:33:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 488 transitions. [2024-11-08 23:33:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 23:33:30,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:30,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:30,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:30,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:31,106 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-08 23:33:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 461 states and 491 transitions. [2024-11-08 23:33:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 491 transitions. [2024-11-08 23:33:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 23:33:31,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:31,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-08 23:33:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 468 states and 498 transitions. [2024-11-08 23:33:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 498 transitions. [2024-11-08 23:33:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 23:33:31,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:31,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:31,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:31,941 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-08 23:33:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 471 states and 501 transitions. [2024-11-08 23:33:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 501 transitions. [2024-11-08 23:33:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 23:33:32,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:32,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:32,235 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-08 23:33:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 479 states and 509 transitions. [2024-11-08 23:33:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 509 transitions. [2024-11-08 23:33:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 23:33:32,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:32,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:32,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:32,938 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-08 23:33:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 481 states and 511 transitions. [2024-11-08 23:33:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 511 transitions. [2024-11-08 23:33:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 23:33:32,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:32,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:33,161 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-08 23:33:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 490 states and 520 transitions. [2024-11-08 23:33:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 520 transitions. [2024-11-08 23:33:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 23:33:33,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:33,796 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-08 23:33:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 489 states and 519 transitions. [2024-11-08 23:33:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 519 transitions. [2024-11-08 23:33:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 23:33:33,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:33,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:33,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:34,002 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-08 23:33:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 491 states and 522 transitions. [2024-11-08 23:33:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 522 transitions. [2024-11-08 23:33:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 23:33:34,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:34,125 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-08 23:33:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 502 states and 533 transitions. [2024-11-08 23:33:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 533 transitions. [2024-11-08 23:33:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 23:33:34,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:34,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:34,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:34,494 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-08 23:33:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 505 states and 536 transitions. [2024-11-08 23:33:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 536 transitions. [2024-11-08 23:33:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:33:34,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:34,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:34,713 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-08 23:33:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 506 states and 537 transitions. [2024-11-08 23:33:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 537 transitions. [2024-11-08 23:33:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:33:34,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:34,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:34,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:34,882 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-08 23:33:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 508 states and 539 transitions. [2024-11-08 23:33:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 539 transitions. [2024-11-08 23:33:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 23:33:34,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:34,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:34,956 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-08 23:33:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 507 states and 538 transitions. [2024-11-08 23:33:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 538 transitions. [2024-11-08 23:33:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 23:33:34,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:34,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:35,010 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-08 23:33:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 509 states and 541 transitions. [2024-11-08 23:33:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 541 transitions. [2024-11-08 23:33:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 23:33:35,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:35,139 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-08 23:33:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 511 states and 544 transitions. [2024-11-08 23:33:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 544 transitions. [2024-11-08 23:33:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 23:33:35,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:35,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:35,270 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-08 23:33:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 514 states and 549 transitions. [2024-11-08 23:33:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 549 transitions. [2024-11-08 23:33:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 23:33:35,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:35,428 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-08 23:33:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 517 states and 552 transitions. [2024-11-08 23:33:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 552 transitions. [2024-11-08 23:33:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 23:33:35,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:35,552 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-08 23:33:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 521 states and 557 transitions. [2024-11-08 23:33:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 557 transitions. [2024-11-08 23:33:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 23:33:35,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:35,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:35,669 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-08 23:33:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 520 states and 556 transitions. [2024-11-08 23:33:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 556 transitions. [2024-11-08 23:33:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 23:33:35,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:35,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:35,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:35,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:35,850 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-08 23:33:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 523 states and 559 transitions. [2024-11-08 23:33:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 559 transitions. [2024-11-08 23:33:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 23:33:35,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:35,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:35,946 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-08 23:33:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 529 states and 566 transitions. [2024-11-08 23:33:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 566 transitions. [2024-11-08 23:33:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 23:33:36,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:36,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:36,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:36,204 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-08 23:33:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 530 states and 568 transitions. [2024-11-08 23:33:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 568 transitions. [2024-11-08 23:33:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 23:33:36,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:36,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:36,458 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-08 23:33:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 537 states and 575 transitions. [2024-11-08 23:33:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 575 transitions. [2024-11-08 23:33:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 23:33:36,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:36,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:36,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:36,954 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-08 23:33:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 539 states and 577 transitions. [2024-11-08 23:33:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 577 transitions. [2024-11-08 23:33:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 23:33:37,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:37,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:37,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-08 23:33:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 538 states and 576 transitions. [2024-11-08 23:33:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 576 transitions. [2024-11-08 23:33:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 23:33:37,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:37,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:37,101 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-08 23:33:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 537 states and 575 transitions. [2024-11-08 23:33:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 575 transitions. [2024-11-08 23:33:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 23:33:37,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:37,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:37,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:37,277 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-08 23:33:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 540 states and 578 transitions. [2024-11-08 23:33:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 578 transitions. [2024-11-08 23:33:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 23:33:37,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:37,390 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-08 23:33:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 539 states and 577 transitions. [2024-11-08 23:33:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 577 transitions. [2024-11-08 23:33:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 23:33:37,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:37,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:37,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:37,663 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-08 23:33:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 540 states and 579 transitions. [2024-11-08 23:33:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 579 transitions. [2024-11-08 23:33:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 23:33:37,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:37,954 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-08 23:33:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 539 states and 578 transitions. [2024-11-08 23:33:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 578 transitions. [2024-11-08 23:33:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 23:33:38,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:38,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:38,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:38,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:38,435 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-08 23:33:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 541 states and 580 transitions. [2024-11-08 23:33:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 580 transitions. [2024-11-08 23:33:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 23:33:38,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:38,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:38,546 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-08 23:33:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 540 states and 579 transitions. [2024-11-08 23:33:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 579 transitions. [2024-11-08 23:33:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 23:33:38,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:38,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:38,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:38,735 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-08 23:33:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 542 states and 581 transitions. [2024-11-08 23:33:38,775 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 581 transitions. [2024-11-08 23:33:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 23:33:38,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:38,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:38,828 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-08 23:33:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 581 states and 622 transitions. [2024-11-08 23:33:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 622 transitions. [2024-11-08 23:33:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 23:33:39,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:39,384 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-08 23:33:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 582 states and 623 transitions. [2024-11-08 23:33:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 623 transitions. [2024-11-08 23:33:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 23:33:39,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:39,512 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-08 23:33:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 581 states and 622 transitions. [2024-11-08 23:33:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 622 transitions. [2024-11-08 23:33:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 23:33:39,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:39,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:39,860 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-08 23:33:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 582 states and 623 transitions. [2024-11-08 23:33:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 623 transitions. [2024-11-08 23:33:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 23:33:40,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:40,354 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-08 23:33:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 581 states and 622 transitions. [2024-11-08 23:33:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 622 transitions. [2024-11-08 23:33:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 23:33:40,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:40,768 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-08 23:33:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 580 states and 621 transitions. [2024-11-08 23:33:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 621 transitions. [2024-11-08 23:33:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:33:41,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:41,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:41,174 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-08 23:33:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 577 states and 616 transitions. [2024-11-08 23:33:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 616 transitions. [2024-11-08 23:33:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:33:41,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:41,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:41,610 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-08 23:33:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 573 states and 611 transitions. [2024-11-08 23:33:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 611 transitions. [2024-11-08 23:33:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 23:33:41,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:41,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:41,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:42,004 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-08 23:33:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 591 states and 631 transitions. [2024-11-08 23:33:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 631 transitions. [2024-11-08 23:33:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 23:33:42,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:42,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:42,770 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-08 23:33:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 586 states and 625 transitions. [2024-11-08 23:33:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 625 transitions. [2024-11-08 23:33:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:33:43,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:43,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:43,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:33:43,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:43,209 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-08 23:33:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 587 states and 626 transitions. [2024-11-08 23:33:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 626 transitions. [2024-11-08 23:33:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 23:33:43,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:43,268 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-08 23:33:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 586 states and 625 transitions. [2024-11-08 23:33:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 625 transitions. [2024-11-08 23:33:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:33:43,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:43,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:43,353 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-08 23:33:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 579 states and 617 transitions. [2024-11-08 23:33:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 617 transitions. [2024-11-08 23:33:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 23:33:43,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:43,536 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-08 23:33:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 581 states and 620 transitions. [2024-11-08 23:33:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 620 transitions. [2024-11-08 23:33:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 23:33:43,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:43,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:43,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:43,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:43,804 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-08 23:33:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 591 states and 630 transitions. [2024-11-08 23:33:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 630 transitions. [2024-11-08 23:33:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 23:33:44,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:44,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:33:44,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:44,179 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-08 23:33:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 590 states and 629 transitions. [2024-11-08 23:33:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 629 transitions. [2024-11-08 23:33:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 23:33:44,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:44,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:44,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:45,542 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-08 23:33:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 630 states and 672 transitions. [2024-11-08 23:33:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 672 transitions. [2024-11-08 23:33:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:33:47,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:47,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:47,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:47,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:47,980 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-08 23:33:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 671 states and 715 transitions. [2024-11-08 23:33:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 715 transitions. [2024-11-08 23:33:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:33:50,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:50,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 23:33:50,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:50,769 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-08 23:33:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 679 states and 724 transitions. [2024-11-08 23:33:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 724 transitions. [2024-11-08 23:33:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 23:33:52,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:52,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:33:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:52,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:33:52,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:33:53,365 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-08 23:33:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 681 states and 729 transitions. [2024-11-08 23:33:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 729 transitions. [2024-11-08 23:33:54,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:33:54,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:54,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:54,638 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-08 23:33:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 684 states and 736 transitions. [2024-11-08 23:33:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 736 transitions. [2024-11-08 23:33:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:33:54,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:55,150 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-08 23:33:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 742 states and 804 transitions. [2024-11-08 23:33:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 804 transitions. [2024-11-08 23:33:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:33:57,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:57,487 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-08 23:33:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:33:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 744 states and 809 transitions. [2024-11-08 23:33:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 809 transitions. [2024-11-08 23:33:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:33:57,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:33:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:33:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:33:58,075 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-08 23:34:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 803 states and 879 transitions. [2024-11-08 23:34:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 879 transitions. [2024-11-08 23:34:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:34:00,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:00,930 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-08 23:34:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 807 states and 888 transitions. [2024-11-08 23:34:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 888 transitions. [2024-11-08 23:34:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:34:01,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:01,915 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-08 23:34:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 809 states and 893 transitions. [2024-11-08 23:34:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 893 transitions. [2024-11-08 23:34:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 23:34:02,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:02,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:02,649 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-08 23:34:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 812 states and 899 transitions. [2024-11-08 23:34:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 899 transitions. [2024-11-08 23:34:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 23:34:03,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:03,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:03,389 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-08 23:34:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 816 states and 908 transitions. [2024-11-08 23:34:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 908 transitions. [2024-11-08 23:34:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:34:04,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:04,388 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-08 23:34:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 820 states and 915 transitions. [2024-11-08 23:34:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 915 transitions. [2024-11-08 23:34:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:34:05,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:05,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:05,125 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-08 23:34:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 824 states and 924 transitions. [2024-11-08 23:34:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 924 transitions. [2024-11-08 23:34:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 23:34:06,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:06,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:07,109 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-08 23:34:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 928 states and 1037 transitions. [2024-11-08 23:34:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1037 transitions. [2024-11-08 23:34:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 23:34:11,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:11,097 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-08 23:34:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 932 states and 1047 transitions. [2024-11-08 23:34:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1047 transitions. [2024-11-08 23:34:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 23:34:12,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:12,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:12,804 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-08 23:34:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 368 states and 384 transitions. [2024-11-08 23:34:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 384 transitions. [2024-11-08 23:34:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 23:34:13,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:13,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:13,627 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-08 23:34:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 362 states and 378 transitions. [2024-11-08 23:34:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 378 transitions. [2024-11-08 23:34:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:34:15,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:15,345 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-08 23:34:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 354 states and 370 transitions. [2024-11-08 23:34:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 370 transitions. [2024-11-08 23:34:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 23:34:17,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:17,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,250 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-08 23:34:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 345 states and 361 transitions. [2024-11-08 23:34:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 361 transitions. [2024-11-08 23:34:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 23:34:19,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,078 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-08 23:34:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 335 states and 351 transitions. [2024-11-08 23:34:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 351 transitions. [2024-11-08 23:34:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 23:34:20,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:20,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:20,808 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-08 23:34:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 334 states and 350 transitions. [2024-11-08 23:34:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 350 transitions. [2024-11-08 23:34:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 23:34:20,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:20,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:20,952 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-08 23:34:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 333 states and 349 transitions. [2024-11-08 23:34:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 349 transitions. [2024-11-08 23:34:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 23:34:21,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:21,124 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-08 23:34:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 330 states and 346 transitions. [2024-11-08 23:34:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 346 transitions. [2024-11-08 23:34:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 23:34:21,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:21,405 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-08 23:34:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 326 states and 342 transitions. [2024-11-08 23:34:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 342 transitions. [2024-11-08 23:34:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 23:34:21,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:21,697 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-08 23:34:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 321 states and 337 transitions. [2024-11-08 23:34:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 337 transitions. [2024-11-08 23:34:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 23:34:21,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:21,935 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-08 23:34:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 314 states and 330 transitions. [2024-11-08 23:34:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 330 transitions. [2024-11-08 23:34:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 23:34:22,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,210 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-08 23:34:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 306 states and 322 transitions. [2024-11-08 23:34:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 322 transitions. [2024-11-08 23:34:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 23:34:22,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:22,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,742 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-08 23:34:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 297 states and 313 transitions. [2024-11-08 23:34:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 313 transitions. [2024-11-08 23:34:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 23:34:23,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:23,352 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-08 23:34:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 287 states and 303 transitions. [2024-11-08 23:34:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 303 transitions. [2024-11-08 23:34:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:34:26,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:26,200 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-08 23:34:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 286 states and 302 transitions. [2024-11-08 23:34:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 302 transitions. [2024-11-08 23:34:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:34:26,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:26,381 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-08 23:34:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 285 states and 301 transitions. [2024-11-08 23:34:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 301 transitions. [2024-11-08 23:34:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 23:34:26,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:26,575 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-08 23:34:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 282 states and 296 transitions. [2024-11-08 23:34:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 296 transitions. [2024-11-08 23:34:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 23:34:26,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:26,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:26,812 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-08 23:34:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 278 states and 291 transitions. [2024-11-08 23:34:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 291 transitions. [2024-11-08 23:34:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 23:34:26,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:27,023 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-08 23:34:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 273 states and 285 transitions. [2024-11-08 23:34:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 285 transitions. [2024-11-08 23:34:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:34:27,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:27,356 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-08 23:34:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 266 states and 277 transitions. [2024-11-08 23:34:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 277 transitions. [2024-11-08 23:34:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 23:34:27,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:27,827 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-08 23:34:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 258 states and 269 transitions. [2024-11-08 23:34:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 269 transitions. [2024-11-08 23:34:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:34:28,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:28,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:28,385 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-08 23:34:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 271 states and 282 transitions. [2024-11-08 23:34:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 282 transitions. [2024-11-08 23:34:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:34:30,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:30,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:30,902 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-08 23:34:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 257 states and 268 transitions. [2024-11-08 23:34:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 268 transitions. [2024-11-08 23:34:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:34:32,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:32,605 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-08 23:34:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 271 states and 282 transitions. [2024-11-08 23:34:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 282 transitions. [2024-11-08 23:34:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:34:34,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:34,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:34,968 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-08 23:34:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 256 states and 267 transitions. [2024-11-08 23:34:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 267 transitions. [2024-11-08 23:34:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:34:36,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:36,546 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-08 23:34:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 270 states and 281 transitions. [2024-11-08 23:34:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 281 transitions. [2024-11-08 23:34:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:34:40,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:40,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:40,726 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-08 23:34:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:34:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 254 states and 265 transitions. [2024-11-08 23:34:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 265 transitions. [2024-11-08 23:34:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 23:34:48,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:34:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:34:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:48,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 23:34:48,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:34:49,731 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-08 23:35:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 272 states and 287 transitions. [2024-11-08 23:35:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 287 transitions. [2024-11-08 23:35:02,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 23:35:02,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:35:02,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:35:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:02,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 23:35:02,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:02,959 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-08 23:35:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 253 states and 264 transitions. [2024-11-08 23:35:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 264 transitions. [2024-11-08 23:35:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 23:35:05,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:35:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:35:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:05,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 23:35:05,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:06,336 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-08 23:35:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 252 states and 263 transitions. [2024-11-08 23:35:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 263 transitions. [2024-11-08 23:35:09,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:35:09,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:35:09,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:35:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:09,718 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-08 23:35:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:35:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 251 states and 262 transitions. [2024-11-08 23:35:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 262 transitions. [2024-11-08 23:35:13,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:35:13,104 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 177 iterations. [2024-11-08 23:35:13,113 INFO L729 CodeCheckObserver]: All specifications hold 102 specifications checked. All of them hold [2024-11-08 23:35:36,840 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,841 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,841 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,841 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,841 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,841 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,841 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,841 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,841 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-08 23:35:36,841 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-08 23:35:36,842 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-08 23:35:36,842 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-08 23:35:36,842 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-08 23:35:36,842 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-08 23:35:36,842 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-08 23:35:36,842 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-08 23:35:36,842 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-08 23:35:36,842 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-08 23:35:36,842 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,843 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,843 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,843 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,843 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-08 23:35:36,843 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,843 INFO L77 FloydHoareUtils]: At program point L21(line 21) the Hoare annotation is: true [2024-11-08 23:35:36,843 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-08 23:35:36,843 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,843 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2024-11-08 23:35:36,843 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,843 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,843 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-08 23:35:36,844 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2024-11-08 23:35:36,844 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,844 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,844 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,844 INFO L77 FloydHoareUtils]: At program point L22(line 22) the Hoare annotation is: true [2024-11-08 23:35:36,844 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,844 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,844 INFO L77 FloydHoareUtils]: At program point L39(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,844 INFO L77 FloydHoareUtils]: At program point L39-1(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,844 INFO L77 FloydHoareUtils]: At program point L39-2(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,844 INFO L77 FloydHoareUtils]: At program point L39-3(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,844 INFO L77 FloydHoareUtils]: At program point L39-4(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,845 INFO L77 FloydHoareUtils]: At program point L39-5(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,845 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-11-08 23:35:36,845 INFO L77 FloydHoareUtils]: At program point L39-6(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,845 INFO L77 FloydHoareUtils]: At program point L39-7(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,846 INFO L77 FloydHoareUtils]: At program point L39-8(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,846 INFO L77 FloydHoareUtils]: At program point L39-9(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,846 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-08 23:35:36,846 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-08 23:35:36,846 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-08 23:35:36,846 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-08 23:35:36,846 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,847 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-08 23:35:36,847 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-08 23:35:36,847 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,847 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-08 23:35:36,847 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-08 23:35:36,847 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-08 23:35:36,848 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-08 23:35:36,848 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-08 23:35:36,848 INFO L77 FloydHoareUtils]: At program point L39-21(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,848 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,848 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-08 23:35:36,848 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-08 23:35:36,849 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-08 23:35:36,849 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-08 23:35:36,849 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-08 23:35:36,849 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-08 23:35:36,849 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-08 23:35:36,850 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-08 23:35:36,850 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-08 23:35:36,850 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-08 23:35:36,850 INFO L77 FloydHoareUtils]: At program point L40(line 40) the Hoare annotation is: true [2024-11-08 23:35:36,850 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-08 23:35:36,850 INFO L77 FloydHoareUtils]: At program point L40-1(line 40) the Hoare annotation is: true [2024-11-08 23:35:36,851 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,851 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-08 23:35:36,851 INFO L77 FloydHoareUtils]: At program point L40-2(line 40) the Hoare annotation is: true [2024-11-08 23:35:36,851 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-08 23:35:36,851 INFO L77 FloydHoareUtils]: At program point L40-3(line 40) the Hoare annotation is: true [2024-11-08 23:35:36,851 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-08 23:35:36,851 INFO L77 FloydHoareUtils]: At program point L40-4(line 40) the Hoare annotation is: true [2024-11-08 23:35:36,851 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-08 23:35:36,851 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-08 23:35:36,851 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,852 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-08 23:35:36,852 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-08 23:35:36,852 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,852 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-08 23:35:36,853 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-08 23:35:36,853 INFO L77 FloydHoareUtils]: At program point L39-42(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,853 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,853 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,853 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,853 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) the Hoare annotation is: true [2024-11-08 23:35:36,853 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,854 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 23:35:36,854 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,854 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,854 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,854 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,854 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,854 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,855 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-08 23:35:36,855 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,855 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,855 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,855 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,855 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,855 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2024-11-08 23:35:36,855 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,856 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,856 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,856 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) the Hoare annotation is: true [2024-11-08 23:35:36,856 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,856 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-08 23:35:36,856 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,856 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-11-08 23:35:36,856 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,856 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,856 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-08 23:35:36,856 INFO L77 FloydHoareUtils]: At program point L28-3(lines 28 37) the Hoare annotation is: true [2024-11-08 23:35:36,857 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,857 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,857 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,857 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,857 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-08 23:35:36,858 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,858 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-08 23:35:36,858 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) the Hoare annotation is: true [2024-11-08 23:35:36,858 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-08 23:35:36,858 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-08 23:35:36,858 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-08 23:35:36,859 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-08 23:35:36,859 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-08 23:35:36,859 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-08 23:35:36,859 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,859 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-08 23:35:36,859 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,860 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-08 23:35:36,860 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-08 23:35:36,860 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-08 23:35:36,860 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-08 23:35:36,860 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-08 23:35:36,860 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-08 23:35:36,861 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-08 23:35:36,861 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-08 23:35:36,861 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-08 23:35:36,861 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-08 23:35:36,861 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-08 23:35:36,862 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 23:35:36,862 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-08 23:35:36,862 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-08 23:35:36,862 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-08 23:35:36,862 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-08 23:35:36,863 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-08 23:35:36,863 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,863 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-08 23:35:36,866 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-08 23:35:36,866 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-08 23:35:36,866 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-08 23:35:36,866 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-08 23:35:36,867 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-08 23:35:36,867 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-08 23:35:36,867 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-08 23:35:36,867 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-08 23:35:36,867 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,868 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-08 23:35:36,868 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-08 23:35:36,868 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-08 23:35:36,868 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-08 23:35:36,868 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-08 23:35:36,869 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-08 23:35:36,869 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-08 23:35:36,869 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,869 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-08 23:35:36,869 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,869 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-08 23:35:36,869 INFO L77 FloydHoareUtils]: At program point L29-43(lines 28 37) the Hoare annotation is: true [2024-11-08 23:35:36,870 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,873 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,873 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,873 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-08 23:35:36,873 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,873 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,873 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,873 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,874 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,874 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-08 23:35:36,874 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,874 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,874 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,874 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,874 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,875 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-08 23:35:36,875 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-11-08 23:35:36,875 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,875 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,875 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,875 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,875 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,875 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,876 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-08 23:35:36,876 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-08 23:35:36,876 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,876 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) the Hoare annotation is: true [2024-11-08 23:35:36,876 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-11-08 23:35:36,876 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-11-08 23:35:36,876 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) the Hoare annotation is: true [2024-11-08 23:35:36,877 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-11-08 23:35:36,942 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-11-08 23:35:36,943 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-08 23:35:36,943 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-08 23:35:36,943 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2024-11-08 23:35:36,943 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-08 23:35:36,943 INFO L77 FloydHoareUtils]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: true [2024-11-08 23:35:36,943 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2024-11-08 23:35:36,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:35:36 ImpRootNode [2024-11-08 23:35:36,969 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:35:36,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:35:36,970 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:35:36,970 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:35:36,971 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:33:16" (3/4) ... [2024-11-08 23:35:36,973 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:35:36,977 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 23:35:36,977 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-08 23:35:36,984 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-08 23:35:36,985 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-08 23:35:36,985 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:35:36,985 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:35:37,092 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:35:37,092 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 23:35:37,092 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:35:37,093 INFO L158 Benchmark]: Toolchain (without parser) took 142107.78ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 128.3MB in the beginning and 907.6MB in the end (delta: -779.2MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. [2024-11-08 23:35:37,093 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 155.2MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:35:37,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.90ms. Allocated memory is still 155.2MB. Free memory was 127.9MB in the beginning and 114.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:35:37,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.06ms. Allocated memory is still 155.2MB. Free memory was 114.7MB in the beginning and 112.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:35:37,095 INFO L158 Benchmark]: Boogie Preprocessor took 34.31ms. Allocated memory is still 155.2MB. Free memory was 112.6MB in the beginning and 111.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:35:37,095 INFO L158 Benchmark]: RCFGBuilder took 906.82ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 73.6MB in the end (delta: 37.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 23:35:37,095 INFO L158 Benchmark]: CodeCheck took 140696.81ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 73.6MB in the beginning and 914.9MB in the end (delta: -841.4MB). Peak memory consumption was 582.4MB. Max. memory is 16.1GB. [2024-11-08 23:35:37,096 INFO L158 Benchmark]: Witness Printer took 122.75ms. Allocated memory is still 1.0GB. Free memory was 914.9MB in the beginning and 907.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:35:37,097 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: 116.8s, 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, 433.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129349 mSDsluCounter, 13631 SdHoareTripleChecker+Invalid, 375.6s 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, 4.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93244 GetRequests, 88278 SyntacticMatches, 4310 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 24 DeprecatedPredicates, 304155 ImplicationChecksByTransitivity, 85.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 17.2s 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.33ms. Allocated memory is still 155.2MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.90ms. Allocated memory is still 155.2MB. Free memory was 127.9MB in the beginning and 114.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.06ms. Allocated memory is still 155.2MB. Free memory was 114.7MB in the beginning and 112.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.31ms. Allocated memory is still 155.2MB. Free memory was 112.6MB in the beginning and 111.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 906.82ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 73.6MB in the end (delta: 37.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * CodeCheck took 140696.81ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 73.6MB in the beginning and 914.9MB in the end (delta: -841.4MB). Peak memory consumption was 582.4MB. Max. memory is 16.1GB. * Witness Printer took 122.75ms. Allocated memory is still 1.0GB. Free memory was 914.9MB in the beginning and 907.6MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-08 23:35:37,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11664d89-e137-479f-9641-98b558333ff2/bin/ukojak-verify-ImItNfHLgk/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