./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/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_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:35:12,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:35:12,638 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:35:12,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:35:12,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:35:12,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:35:12,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:35:12,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:35:12,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:35:12,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:35:12,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:35:12,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:35:12,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:35:12,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:35:12,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:35:12,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:35:12,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:35:12,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:35:12,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:35:12,697 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:35:12,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:35:12,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:35:12,699 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:35:12,700 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:35:12,700 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:35:12,700 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:35:12,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:35:12,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:35:12,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:35:12,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:35:12,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:35:12,702 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:35:12,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:35:12,716 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_69b28c26-cd55-4e33-8d5a-7addaf9ee386/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_69b28c26-cd55-4e33-8d5a-7addaf9ee386/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 [2024-11-09 00:35:13,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:35:13,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:35:13,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:35:13,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:35:13,113 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:35:13,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c Unable to find full path for "g++" [2024-11-09 00:35:15,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:35:15,607 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:35:15,608 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2024-11-09 00:35:15,623 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/data/2ea7ddbc1/3766f57bda604b2b8b238278b14168a2/FLAG4b582138d [2024-11-09 00:35:15,641 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/data/2ea7ddbc1/3766f57bda604b2b8b238278b14168a2 [2024-11-09 00:35:15,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:35:15,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:35:15,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:15,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:35:15,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:35:15,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:15" (1/1) ... [2024-11-09 00:35:15,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc45a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:15, skipping insertion in model container [2024-11-09 00:35:15,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:15" (1/1) ... [2024-11-09 00:35:15,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:35:16,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/sv-benchmarks/c/eca-rers2012/Problem01_label30.c[21088,21101] [2024-11-09 00:35:16,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:16,217 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:35:16,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/sv-benchmarks/c/eca-rers2012/Problem01_label30.c[21088,21101] [2024-11-09 00:35:16,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:16,382 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:35:16,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16 WrapperNode [2024-11-09 00:35:16,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:16,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:16,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:35:16,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:35:16,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,494 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-09 00:35:16,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:16,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:35:16,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:35:16,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:35:16,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:35:16,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:35:16,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:35:16,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:35:16,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2024-11-09 00:35:16,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:35:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:35:16,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:35:16,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:35:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:35:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:35:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:35:16,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:35:16,752 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:35:16,755 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:35:17,933 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 00:35:17,933 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:35:18,292 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:35:18,293 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:35:18,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:18 BoogieIcfgContainer [2024-11-09 00:35:18,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:35:18,295 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:35:18,296 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:35:18,308 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:35:18,308 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:18" (1/1) ... [2024-11-09 00:35:18,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-09 00:35:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-09 00:35:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:35:18,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:18,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-09 00:35:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-09 00:35:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:35:20,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-09 00:35:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-09 00:35:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 00:35:21,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-09 00:35:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-09 00:35:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:35:22,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-09 00:35:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-09 00:35:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 00:35:23,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:35:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-09 00:35:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-09 00:35:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:35:24,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:35:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-09 00:35:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-09 00:35:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 00:35:24,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:35:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:26,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-09 00:35:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-09 00:35:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 00:35:26,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:35:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-09 00:35:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-09 00:35:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 00:35:27,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:27,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:35:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-09 00:35:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-09 00:35:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:35:28,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:28,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:35:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-09 00:35:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-09 00:35:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 00:35:30,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:30,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 00:35:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-09 00:35:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-09 00:35:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:35:30,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:30,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-09 00:35:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-09 00:35:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:35:33,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-09 00:35:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-09 00:35:33,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 00:35:33,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:35:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 511 states and 629 transitions. [2024-11-09 00:35:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 629 transitions. [2024-11-09 00:35:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 00:35:34,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:34,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:35:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:35,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 512 states and 629 transitions. [2024-11-09 00:35:35,298 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 629 transitions. [2024-11-09 00:35:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:35:35,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:35,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 581 states and 713 transitions. [2024-11-09 00:35:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 713 transitions. [2024-11-09 00:35:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 00:35:37,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:37,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 600 states and 736 transitions. [2024-11-09 00:35:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 736 transitions. [2024-11-09 00:35:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 00:35:39,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 602 states and 737 transitions. [2024-11-09 00:35:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 737 transitions. [2024-11-09 00:35:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:35:39,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:39,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 00:35:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-09 00:35:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-09 00:35:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:35:40,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:35:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 645 states and 784 transitions. [2024-11-09 00:35:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 784 transitions. [2024-11-09 00:35:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 00:35:41,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:41,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 00:35:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 670 states and 809 transitions. [2024-11-09 00:35:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 809 transitions. [2024-11-09 00:35:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-09 00:35:42,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:35:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 672 states and 810 transitions. [2024-11-09 00:35:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 810 transitions. [2024-11-09 00:35:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 00:35:42,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:42,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:35:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 718 states and 868 transitions. [2024-11-09 00:35:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 868 transitions. [2024-11-09 00:35:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 00:35:43,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:35:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 733 states and 887 transitions. [2024-11-09 00:35:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 887 transitions. [2024-11-09 00:35:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:35:44,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 817 states and 985 transitions. [2024-11-09 00:35:48,743 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 985 transitions. [2024-11-09 00:35:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:35:48,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:48,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 869 states and 1051 transitions. [2024-11-09 00:35:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1051 transitions. [2024-11-09 00:35:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-09 00:35:51,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:51,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:35:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 931 states and 1123 transitions. [2024-11-09 00:35:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1123 transitions. [2024-11-09 00:35:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-09 00:35:54,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:35:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 933 states and 1124 transitions. [2024-11-09 00:35:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1124 transitions. [2024-11-09 00:35:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:35:55,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:55,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1009 states and 1218 transitions. [2024-11-09 00:35:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1218 transitions. [2024-11-09 00:35:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:35:57,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:35:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:35:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1028 states and 1239 transitions. [2024-11-09 00:35:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1239 transitions. [2024-11-09 00:35:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:35:59,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:35:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 00:36:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1051 states and 1265 transitions. [2024-11-09 00:36:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1265 transitions. [2024-11-09 00:36:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-09 00:36:00,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 00:36:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1066 states and 1284 transitions. [2024-11-09 00:36:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1284 transitions. [2024-11-09 00:36:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-09 00:36:01,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:36:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1158 states and 1380 transitions. [2024-11-09 00:36:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1380 transitions. [2024-11-09 00:36:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:36:04,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:04,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1199 states and 1427 transitions. [2024-11-09 00:36:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1427 transitions. [2024-11-09 00:36:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:36:06,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1232 states and 1465 transitions. [2024-11-09 00:36:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1465 transitions. [2024-11-09 00:36:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:36:08,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:08,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1233 states and 1466 transitions. [2024-11-09 00:36:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1466 transitions. [2024-11-09 00:36:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 00:36:08,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:08,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:36:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1293 states and 1539 transitions. [2024-11-09 00:36:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1539 transitions. [2024-11-09 00:36:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 00:36:10,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:10,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:36:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1331 states and 1582 transitions. [2024-11-09 00:36:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1582 transitions. [2024-11-09 00:36:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 00:36:12,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:36:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1353 states and 1611 transitions. [2024-11-09 00:36:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1611 transitions. [2024-11-09 00:36:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 00:36:15,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:36:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1386 states and 1646 transitions. [2024-11-09 00:36:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1646 transitions. [2024-11-09 00:36:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 00:36:17,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1388 states and 1650 transitions. [2024-11-09 00:36:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1650 transitions. [2024-11-09 00:36:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 00:36:18,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:18,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1411 states and 1676 transitions. [2024-11-09 00:36:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1676 transitions. [2024-11-09 00:36:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 00:36:20,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:20,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1427 states and 1692 transitions. [2024-11-09 00:36:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1692 transitions. [2024-11-09 00:36:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:36:22,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:22,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:36:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1474 states and 1754 transitions. [2024-11-09 00:36:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1754 transitions. [2024-11-09 00:36:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:36:25,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:25,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:36:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1484 states and 1763 transitions. [2024-11-09 00:36:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1763 transitions. [2024-11-09 00:36:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:36:27,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:27,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:36:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1500 states and 1783 transitions. [2024-11-09 00:36:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1783 transitions. [2024-11-09 00:36:28,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:36:28,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 00:36:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1503 states and 1786 transitions. [2024-11-09 00:36:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1786 transitions. [2024-11-09 00:36:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-09 00:36:28,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:28,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:36:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1637 states and 1938 transitions. [2024-11-09 00:36:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 1938 transitions. [2024-11-09 00:36:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:36:33,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:33,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:36:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1662 states and 1964 transitions. [2024-11-09 00:36:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 1964 transitions. [2024-11-09 00:36:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:36:35,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:35,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1675 states and 1979 transitions. [2024-11-09 00:36:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1979 transitions. [2024-11-09 00:36:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:36:36,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:36:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1678 states and 1983 transitions. [2024-11-09 00:36:37,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1983 transitions. [2024-11-09 00:36:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-09 00:36:37,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:37,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 00:36:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 1766 states and 2083 transitions. [2024-11-09 00:36:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2083 transitions. [2024-11-09 00:36:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-09 00:36:40,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:40,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:36:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 1840 states and 2159 transitions. [2024-11-09 00:36:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2159 transitions. [2024-11-09 00:36:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 00:36:43,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:43,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:36:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 1861 states and 2181 transitions. [2024-11-09 00:36:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2181 transitions. [2024-11-09 00:36:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 00:36:45,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 00:36:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 1863 states and 2183 transitions. [2024-11-09 00:36:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2183 transitions. [2024-11-09 00:36:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 00:36:46,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:46,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 00:36:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 1878 states and 2200 transitions. [2024-11-09 00:36:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2200 transitions. [2024-11-09 00:36:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 00:36:47,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:47,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 00:36:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1915 states and 2245 transitions. [2024-11-09 00:36:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2245 transitions. [2024-11-09 00:36:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-09 00:36:49,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:49,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:36:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 1926 states and 2257 transitions. [2024-11-09 00:36:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2257 transitions. [2024-11-09 00:36:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-09 00:36:50,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:50,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:36:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 1929 states and 2261 transitions. [2024-11-09 00:36:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2261 transitions. [2024-11-09 00:36:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 00:36:52,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:52,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:36:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 1932 states and 2264 transitions. [2024-11-09 00:36:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2264 transitions. [2024-11-09 00:36:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-09 00:36:52,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 190 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:36:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1945 states and 2279 transitions. [2024-11-09 00:36:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2279 transitions. [2024-11-09 00:36:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:36:54,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:54,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:36:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 1959 states and 2295 transitions. [2024-11-09 00:36:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2295 transitions. [2024-11-09 00:36:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:36:56,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-09 00:36:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:36:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2000 states and 2343 transitions. [2024-11-09 00:36:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2343 transitions. [2024-11-09 00:36:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:36:57,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:36:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:36:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:37:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2039 states and 2395 transitions. [2024-11-09 00:37:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2395 transitions. [2024-11-09 00:37:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:37:01,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:01,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 00:37:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2053 states and 2410 transitions. [2024-11-09 00:37:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2410 transitions. [2024-11-09 00:37:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:37:02,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 00:37:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2056 states and 2413 transitions. [2024-11-09 00:37:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2413 transitions. [2024-11-09 00:37:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 00:37:03,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:37:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2068 states and 2429 transitions. [2024-11-09 00:37:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2429 transitions. [2024-11-09 00:37:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 00:37:05,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:05,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:37:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2070 states and 2431 transitions. [2024-11-09 00:37:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2431 transitions. [2024-11-09 00:37:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:37:06,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 00:37:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2082 states and 2443 transitions. [2024-11-09 00:37:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2443 transitions. [2024-11-09 00:37:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:37:07,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:37:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2159 states and 2535 transitions. [2024-11-09 00:37:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2535 transitions. [2024-11-09 00:37:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:37:15,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:15,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:37:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2161 states and 2536 transitions. [2024-11-09 00:37:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2536 transitions. [2024-11-09 00:37:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:37:16,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:37:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2164 states and 2539 transitions. [2024-11-09 00:37:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2539 transitions. [2024-11-09 00:37:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 00:37:17,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:17,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:37:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2173 states and 2548 transitions. [2024-11-09 00:37:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 2548 transitions. [2024-11-09 00:37:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 00:37:18,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:18,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-09 00:37:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2197 states and 2574 transitions. [2024-11-09 00:37:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 2574 transitions. [2024-11-09 00:37:19,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:37:19,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:19,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:37:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2274 states and 2670 transitions. [2024-11-09 00:37:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2670 transitions. [2024-11-09 00:37:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:37:25,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:25,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:37:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2278 states and 2674 transitions. [2024-11-09 00:37:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2674 transitions. [2024-11-09 00:37:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:37:26,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:26,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-09 00:37:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2281 states and 2677 transitions. [2024-11-09 00:37:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 2677 transitions. [2024-11-09 00:37:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:37:26,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-09 00:37:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2284 states and 2680 transitions. [2024-11-09 00:37:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2680 transitions. [2024-11-09 00:37:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 00:37:27,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:27,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:37:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2287 states and 2683 transitions. [2024-11-09 00:37:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2683 transitions. [2024-11-09 00:37:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:37:28,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:37:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2298 states and 2696 transitions. [2024-11-09 00:37:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2696 transitions. [2024-11-09 00:37:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:37:30,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:37:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2370 states and 2775 transitions. [2024-11-09 00:37:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2775 transitions. [2024-11-09 00:37:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:37:40,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:40,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:37:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2371 states and 2776 transitions. [2024-11-09 00:37:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2776 transitions. [2024-11-09 00:37:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:37:41,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:41,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:37:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2415 states and 2822 transitions. [2024-11-09 00:37:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 2822 transitions. [2024-11-09 00:37:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:37:46,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:37:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2417 states and 2823 transitions. [2024-11-09 00:37:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 2823 transitions. [2024-11-09 00:37:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:37:48,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-09 00:37:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2418 states and 2823 transitions. [2024-11-09 00:37:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2823 transitions. [2024-11-09 00:37:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:37:48,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-09 00:37:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2419 states and 2823 transitions. [2024-11-09 00:37:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2823 transitions. [2024-11-09 00:37:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-09 00:37:49,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:37:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2426 states and 2830 transitions. [2024-11-09 00:37:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2830 transitions. [2024-11-09 00:37:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-09 00:37:50,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 253 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:37:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2427 states and 2830 transitions. [2024-11-09 00:37:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 2830 transitions. [2024-11-09 00:37:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-09 00:37:51,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 00:37:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2458 states and 2863 transitions. [2024-11-09 00:37:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 2863 transitions. [2024-11-09 00:37:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:37:55,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:37:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2461 states and 2867 transitions. [2024-11-09 00:37:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2867 transitions. [2024-11-09 00:37:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:37:56,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:37:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:37:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2473 states and 2882 transitions. [2024-11-09 00:37:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 2882 transitions. [2024-11-09 00:37:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:37:58,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:37:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:37:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:37:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 00:38:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 2600 states and 3024 transitions. [2024-11-09 00:38:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3024 transitions. [2024-11-09 00:38:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 00:38:07,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:38:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 2661 states and 3093 transitions. [2024-11-09 00:38:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 3093 transitions. [2024-11-09 00:38:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 00:38:10,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:38:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 2666 states and 3099 transitions. [2024-11-09 00:38:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 3099 transitions. [2024-11-09 00:38:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-09 00:38:11,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:11,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 00:38:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 2667 states and 3099 transitions. [2024-11-09 00:38:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3099 transitions. [2024-11-09 00:38:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-09 00:38:12,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:12,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:38:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 2719 states and 3147 transitions. [2024-11-09 00:38:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3147 transitions. [2024-11-09 00:38:16,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:38:16,205 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 97 iterations. [2024-11-09 00:38:16,215 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-09 00:38:54,627 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,628 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,628 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,628 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,629 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,629 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,629 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,630 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,630 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,630 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,631 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,631 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,631 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,632 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,632 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,632 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,632 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,633 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,633 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,633 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,634 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,634 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,634 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,634 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,635 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,635 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,635 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,636 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,636 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,636 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,637 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,637 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,637 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,637 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,638 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,638 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,638 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,639 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,639 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,639 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,639 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,639 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,640 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,640 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,640 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,640 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,640 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:38:54,640 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,640 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-09 00:38:54,641 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,641 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,641 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,641 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,641 INFO L77 FloydHoareUtils]: At program point L557-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-09 00:38:54,641 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,642 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,642 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,642 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:38:54,642 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,642 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,642 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,643 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,643 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,643 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,643 INFO L77 FloydHoareUtils]: At program point L560-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-09 00:38:54,643 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,644 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,644 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse6 (= 14 ~a8~0)) (.cse5 (= 5 ~a16~0)) (.cse2 (not .cse7)) (.cse1 (= ~a12~0 8)) (.cse4 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse0 .cse1 .cse5 .cse2 .cse3)) (not (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (and .cse1 .cse6 .cse5 .cse2)) (= ~a21~0 1) (not (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4)) (= ~a7~0 1))))) [2024-11-09 00:38:54,644 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 561) no Hoare annotation was computed. [2024-11-09 00:38:54,644 INFO L75 FloydHoareUtils]: For program point L561(line 561) no Hoare annotation was computed. [2024-11-09 00:38:54,644 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,644 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,645 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,645 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,645 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,645 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-09 00:38:54,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:38:54 ImpRootNode [2024-11-09 00:38:54,669 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:38:54,670 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:38:54,670 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:38:54,670 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:38:54,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:18" (3/4) ... [2024-11-09 00:38:54,673 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:38:54,688 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-09 00:38:54,689 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 00:38:54,690 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:38:54,691 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:38:54,848 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:38:54,849 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:38:54,849 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:38:54,850 INFO L158 Benchmark]: Toolchain (without parser) took 219204.72ms. Allocated memory was 123.7MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 86.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 547.7MB. Max. memory is 16.1GB. [2024-11-09 00:38:54,850 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 123.7MB. Free memory was 95.7MB in the beginning and 95.6MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:38:54,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.68ms. Allocated memory is still 123.7MB. Free memory was 86.5MB in the beginning and 56.0MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 00:38:54,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.82ms. Allocated memory is still 123.7MB. Free memory was 56.0MB in the beginning and 92.9MB in the end (delta: -37.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-09 00:38:54,852 INFO L158 Benchmark]: Boogie Preprocessor took 74.98ms. Allocated memory is still 123.7MB. Free memory was 92.9MB in the beginning and 88.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:38:54,852 INFO L158 Benchmark]: RCFGBuilder took 1722.85ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 88.4MB in the beginning and 77.2MB in the end (delta: 11.1MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2024-11-09 00:38:54,852 INFO L158 Benchmark]: CodeCheck took 216373.75ms. Allocated memory was 163.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 77.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 485.2MB. Max. memory is 16.1GB. [2024-11-09 00:38:54,853 INFO L158 Benchmark]: Witness Printer took 179.55ms. Allocated memory is still 2.2GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:38:54,855 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 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 177.9s, OverallIterations: 97, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291595 SdHoareTripleChecker+Valid, 901.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290738 mSDsluCounter, 38593 SdHoareTripleChecker+Invalid, 777.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32749 mSDsCounter, 63441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 632604 IncrementalHoareTripleChecker+Invalid, 696045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63441 mSolverCounterUnsat, 5844 mSDtfsCounter, 632604 mSolverCounterSat, 8.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131151 GetRequests, 123274 SyntacticMatches, 6953 SemanticMatches, 924 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590818 ImplicationChecksByTransitivity, 115.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 34.4s InterpolantComputationTime, 19528 NumberOfCodeBlocks, 19528 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 19432 ConstructedInterpolants, 0 QuantifiedInterpolants, 156336 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 96 InterpolantComputations, 25 PerfectInterpolantSequences, 17654/22876 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: 561]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((!(((((a12 == 8) && (5 == a16)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 123.7MB. Free memory was 95.7MB in the beginning and 95.6MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.68ms. Allocated memory is still 123.7MB. Free memory was 86.5MB in the beginning and 56.0MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.82ms. Allocated memory is still 123.7MB. Free memory was 56.0MB in the beginning and 92.9MB in the end (delta: -37.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.98ms. Allocated memory is still 123.7MB. Free memory was 92.9MB in the beginning and 88.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1722.85ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 88.4MB in the beginning and 77.2MB in the end (delta: 11.1MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. * CodeCheck took 216373.75ms. Allocated memory was 163.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 77.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 485.2MB. Max. memory is 16.1GB. * Witness Printer took 179.55ms. Allocated memory is still 2.2GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-09 00:38:54,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69b28c26-cd55-4e33-8d5a-7addaf9ee386/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