./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label06.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b --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 8fe6fb83fb08ef54afbd8d78d8c97f9d20e73a7ae4eae7f287d2ff90296f8470 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 23:29:12,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 23:29:12,352 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 23:29:12,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 23:29:12,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 23:29:12,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 23:29:12,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 23:29:12,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 23:29:12,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 23:29:12,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 23:29:12,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 23:29:12,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 23:29:12,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 23:29:12,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 23:29:12,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 23:29:12,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 23:29:12,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 23:29:12,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 23:29:12,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 23:29:12,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 23:29:12,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 23:29:12,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 23:29:12,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 23:29:12,379 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 23:29:12,380 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 23:29:12,380 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 23:29:12,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 23:29:12,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:29:12,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 23:29:12,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 23:29:12,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 23:29:12,380 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 23:29:12,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 23:29:12,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 8fe6fb83fb08ef54afbd8d78d8c97f9d20e73a7ae4eae7f287d2ff90296f8470 [2024-12-05 23:29:12,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 23:29:12,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 23:29:12,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 23:29:12,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 23:29:12,628 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 23:29:12,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2024-12-05 23:29:15,296 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/data/9a24e4a72/804126b101184c4988b9bd11c5d81bbd/FLAGa062db67e [2024-12-05 23:29:15,547 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 23:29:15,548 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2024-12-05 23:29:15,560 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/data/9a24e4a72/804126b101184c4988b9bd11c5d81bbd/FLAGa062db67e [2024-12-05 23:29:15,848 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/data/9a24e4a72/804126b101184c4988b9bd11c5d81bbd [2024-12-05 23:29:15,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 23:29:15,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 23:29:15,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 23:29:15,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 23:29:15,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 23:29:15,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:29:15" (1/1) ... [2024-12-05 23:29:15,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1519fc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:15, skipping insertion in model container [2024-12-05 23:29:15,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:29:15" (1/1) ... [2024-12-05 23:29:15,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 23:29:16,131 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_f5e1ef11-568d-4f1e-b247-7df723ddd320/sv-benchmarks/c/eca-rers2012/Problem02_label06.c[21333,21346] [2024-12-05 23:29:16,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:29:16,152 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 23:29:16,232 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_f5e1ef11-568d-4f1e-b247-7df723ddd320/sv-benchmarks/c/eca-rers2012/Problem02_label06.c[21333,21346] [2024-12-05 23:29:16,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:29:16,251 INFO L204 MainTranslator]: Completed translation [2024-12-05 23:29:16,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16 WrapperNode [2024-12-05 23:29:16,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 23:29:16,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 23:29:16,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 23:29:16,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 23:29:16,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,301 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-05 23:29:16,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 23:29:16,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 23:29:16,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 23:29:16,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 23:29:16,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 23:29:16,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 23:29:16,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 23:29:16,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 23:29:16,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:29:16" (1/1) ... [2024-12-05 23:29:16,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:29:16,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 23:29:16,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 23:29:16,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 23:29:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 23:29:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 23:29:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 23:29:16,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 23:29:16,470 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 23:29:16,471 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 23:29:17,269 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-05 23:29:17,269 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 23:29:17,474 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 23:29:17,474 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-05 23:29:17,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:29:17 BoogieIcfgContainer [2024-12-05 23:29:17,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 23:29:17,476 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 23:29:17,476 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 23:29:17,483 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 23:29:17,483 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:29:17" (1/1) ... [2024-12-05 23:29:17,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 23:29:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-05 23:29:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-05 23:29:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-05 23:29:17,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-12-05 23:29:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-12-05 23:29:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-05 23:29:18,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 246 states and 356 transitions. [2024-12-05 23:29:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 356 transitions. [2024-12-05 23:29:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-05 23:29:20,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 325 states and 443 transitions. [2024-12-05 23:29:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 443 transitions. [2024-12-05 23:29:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-05 23:29:21,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 330 states and 449 transitions. [2024-12-05 23:29:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 449 transitions. [2024-12-05 23:29:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-05 23:29:21,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 412 states and 544 transitions. [2024-12-05 23:29:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 544 transitions. [2024-12-05 23:29:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-05 23:29:23,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 417 states and 549 transitions. [2024-12-05 23:29:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 549 transitions. [2024-12-05 23:29:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-05 23:29:23,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 424 states and 556 transitions. [2024-12-05 23:29:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 556 transitions. [2024-12-05 23:29:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 23:29:23,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 524 states and 661 transitions. [2024-12-05 23:29:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 661 transitions. [2024-12-05 23:29:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 23:29:25,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 529 states and 666 transitions. [2024-12-05 23:29:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 666 transitions. [2024-12-05 23:29:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-05 23:29:25,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 530 states and 667 transitions. [2024-12-05 23:29:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 667 transitions. [2024-12-05 23:29:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-05 23:29:25,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:27,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 609 states and 750 transitions. [2024-12-05 23:29:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 750 transitions. [2024-12-05 23:29:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-12-05 23:29:27,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 687 states and 830 transitions. [2024-12-05 23:29:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 830 transitions. [2024-12-05 23:29:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-05 23:29:28,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:28,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-05 23:29:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 709 states and 856 transitions. [2024-12-05 23:29:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 856 transitions. [2024-12-05 23:29:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-05 23:29:29,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-05 23:29:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 733 states and 883 transitions. [2024-12-05 23:29:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 883 transitions. [2024-12-05 23:29:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-05 23:29:29,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-05 23:29:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 737 states and 887 transitions. [2024-12-05 23:29:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 887 transitions. [2024-12-05 23:29:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-05 23:29:29,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-05 23:29:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 744 states and 894 transitions. [2024-12-05 23:29:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 894 transitions. [2024-12-05 23:29:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-05 23:29:29,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 804 states and 959 transitions. [2024-12-05 23:29:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 959 transitions. [2024-12-05 23:29:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 23:29:30,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 836 states and 997 transitions. [2024-12-05 23:29:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 997 transitions. [2024-12-05 23:29:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-05 23:29:31,442 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:31,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-05 23:29:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 842 states and 1005 transitions. [2024-12-05 23:29:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1005 transitions. [2024-12-05 23:29:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-05 23:29:31,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:31,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 878 states and 1043 transitions. [2024-12-05 23:29:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1043 transitions. [2024-12-05 23:29:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-05 23:29:31,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:31,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 23:29:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 942 states and 1111 transitions. [2024-12-05 23:29:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1111 transitions. [2024-12-05 23:29:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-05 23:29:32,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-05 23:29:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 943 states and 1113 transitions. [2024-12-05 23:29:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1113 transitions. [2024-12-05 23:29:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-05 23:29:32,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 82 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 23:29:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1022 states and 1202 transitions. [2024-12-05 23:29:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1202 transitions. [2024-12-05 23:29:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-05 23:29:33,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-05 23:29:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1023 states and 1202 transitions. [2024-12-05 23:29:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1202 transitions. [2024-12-05 23:29:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:29:33,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-05 23:29:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1024 states and 1202 transitions. [2024-12-05 23:29:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1202 transitions. [2024-12-05 23:29:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 23:29:34,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:34,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-12-05 23:29:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1027 states and 1205 transitions. [2024-12-05 23:29:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1205 transitions. [2024-12-05 23:29:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 23:29:34,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-05 23:29:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1036 states and 1219 transitions. [2024-12-05 23:29:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1219 transitions. [2024-12-05 23:29:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 23:29:34,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-05 23:29:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1054 states and 1238 transitions. [2024-12-05 23:29:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1238 transitions. [2024-12-05 23:29:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 23:29:35,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:35,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-05 23:29:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1058 states and 1242 transitions. [2024-12-05 23:29:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1242 transitions. [2024-12-05 23:29:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-12-05 23:29:35,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:35,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 147 proven. 35 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-05 23:29:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1169 states and 1361 transitions. [2024-12-05 23:29:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1361 transitions. [2024-12-05 23:29:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-12-05 23:29:36,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:36,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1265 states and 1468 transitions. [2024-12-05 23:29:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1468 transitions. [2024-12-05 23:29:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 23:29:38,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-12-05 23:29:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1341 states and 1548 transitions. [2024-12-05 23:29:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1548 transitions. [2024-12-05 23:29:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 23:29:39,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-12-05 23:29:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1407 states and 1620 transitions. [2024-12-05 23:29:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1620 transitions. [2024-12-05 23:29:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 23:29:40,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-12-05 23:29:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1425 states and 1638 transitions. [2024-12-05 23:29:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1638 transitions. [2024-12-05 23:29:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-05 23:29:40,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-05 23:29:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1444 states and 1657 transitions. [2024-12-05 23:29:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1657 transitions. [2024-12-05 23:29:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-05 23:29:40,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-12-05 23:29:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1446 states and 1658 transitions. [2024-12-05 23:29:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1658 transitions. [2024-12-05 23:29:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-05 23:29:41,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 204 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:29:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1609 states and 1829 transitions. [2024-12-05 23:29:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1829 transitions. [2024-12-05 23:29:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-12-05 23:29:44,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:44,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-12-05 23:29:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1689 states and 1918 transitions. [2024-12-05 23:29:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 1918 transitions. [2024-12-05 23:29:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-05 23:29:45,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:45,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-05 23:29:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1767 states and 1997 transitions. [2024-12-05 23:29:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 1997 transitions. [2024-12-05 23:29:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-12-05 23:29:46,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:46,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 189 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-12-05 23:29:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1889 states and 2140 transitions. [2024-12-05 23:29:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2140 transitions. [2024-12-05 23:29:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-12-05 23:29:49,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:49,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 280 proven. 49 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-05 23:29:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2016 states and 2270 transitions. [2024-12-05 23:29:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2270 transitions. [2024-12-05 23:29:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-12-05 23:29:51,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:51,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 299 proven. 51 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-12-05 23:29:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2097 states and 2355 transitions. [2024-12-05 23:29:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2355 transitions. [2024-12-05 23:29:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-12-05 23:29:53,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:53,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 273 proven. 64 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-12-05 23:29:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2143 states and 2403 transitions. [2024-12-05 23:29:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 2403 transitions. [2024-12-05 23:29:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-12-05 23:29:55,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:55,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-12-05 23:29:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2215 states and 2476 transitions. [2024-12-05 23:29:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2476 transitions. [2024-12-05 23:29:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-12-05 23:29:56,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:56,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-12-05 23:29:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2293 states and 2555 transitions. [2024-12-05 23:29:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 2555 transitions. [2024-12-05 23:29:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-12-05 23:29:57,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-12-05 23:29:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2298 states and 2559 transitions. [2024-12-05 23:29:58,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2559 transitions. [2024-12-05 23:29:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-12-05 23:29:58,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-12-05 23:29:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:29:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2341 states and 2603 transitions. [2024-12-05 23:29:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 2603 transitions. [2024-12-05 23:29:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-12-05 23:29:59,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:29:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:29:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:29:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 234 proven. 70 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-12-05 23:30:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2419 states and 2681 transitions. [2024-12-05 23:30:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2681 transitions. [2024-12-05 23:30:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-12-05 23:30:00,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:00,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-12-05 23:30:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2478 states and 2741 transitions. [2024-12-05 23:30:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 2741 transitions. [2024-12-05 23:30:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-12-05 23:30:01,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:01,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-12-05 23:30:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2537 states and 2800 transitions. [2024-12-05 23:30:02,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 2800 transitions. [2024-12-05 23:30:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-12-05 23:30:02,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 312 proven. 154 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-12-05 23:30:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2569 states and 2833 transitions. [2024-12-05 23:30:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 2833 transitions. [2024-12-05 23:30:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-12-05 23:30:03,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:03,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 423 proven. 88 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-12-05 23:30:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2691 states and 2961 transitions. [2024-12-05 23:30:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 2961 transitions. [2024-12-05 23:30:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-12-05 23:30:05,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 423 proven. 88 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-12-05 23:30:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2718 states and 2987 transitions. [2024-12-05 23:30:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 2987 transitions. [2024-12-05 23:30:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-12-05 23:30:06,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 348 proven. 10 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-12-05 23:30:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 2764 states and 3043 transitions. [2024-12-05 23:30:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3043 transitions. [2024-12-05 23:30:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-12-05 23:30:08,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:08,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 456 proven. 58 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-12-05 23:30:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 2791 states and 3072 transitions. [2024-12-05 23:30:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3072 transitions. [2024-12-05 23:30:09,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-12-05 23:30:09,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:09,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 268 proven. 138 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-12-05 23:30:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 2793 states and 3073 transitions. [2024-12-05 23:30:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 3073 transitions. [2024-12-05 23:30:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-12-05 23:30:10,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:10,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-12-05 23:30:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 2810 states and 3091 transitions. [2024-12-05 23:30:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 3091 transitions. [2024-12-05 23:30:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-12-05 23:30:10,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-12-05 23:30:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 2830 states and 3111 transitions. [2024-12-05 23:30:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3111 transitions. [2024-12-05 23:30:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-12-05 23:30:11,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:11,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 411 proven. 79 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-12-05 23:30:12,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 2832 states and 3112 transitions. [2024-12-05 23:30:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3112 transitions. [2024-12-05 23:30:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-12-05 23:30:12,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:12,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2024-12-05 23:30:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 2851 states and 3132 transitions. [2024-12-05 23:30:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3132 transitions. [2024-12-05 23:30:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-12-05 23:30:12,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 502 proven. 110 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-12-05 23:30:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 2902 states and 3182 transitions. [2024-12-05 23:30:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 3182 transitions. [2024-12-05 23:30:13,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-12-05 23:30:13,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 502 proven. 110 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-12-05 23:30:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 2952 states and 3231 transitions. [2024-12-05 23:30:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3231 transitions. [2024-12-05 23:30:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-12-05 23:30:14,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:14,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 525 proven. 97 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-12-05 23:30:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3003 states and 3281 transitions. [2024-12-05 23:30:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 3281 transitions. [2024-12-05 23:30:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-12-05 23:30:14,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 416 proven. 110 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-05 23:30:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3283 states to 3005 states and 3283 transitions. [2024-12-05 23:30:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 3283 transitions. [2024-12-05 23:30:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-12-05 23:30:15,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-12-05 23:30:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3019 states and 3297 transitions. [2024-12-05 23:30:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3297 transitions. [2024-12-05 23:30:15,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-12-05 23:30:15,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:15,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-12-05 23:30:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3046 states and 3323 transitions. [2024-12-05 23:30:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 3323 transitions. [2024-12-05 23:30:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-12-05 23:30:16,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 501 proven. 65 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-12-05 23:30:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3047 states and 3326 transitions. [2024-12-05 23:30:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 3326 transitions. [2024-12-05 23:30:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-12-05 23:30:17,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:17,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 669 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-12-05 23:30:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3189 states and 3478 transitions. [2024-12-05 23:30:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 3478 transitions. [2024-12-05 23:30:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-12-05 23:30:20,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:20,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 669 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-12-05 23:30:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 3216 states and 3504 transitions. [2024-12-05 23:30:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 3504 transitions. [2024-12-05 23:30:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-12-05 23:30:21,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:21,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-12-05 23:30:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3242 states and 3529 transitions. [2024-12-05 23:30:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 3529 transitions. [2024-12-05 23:30:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-12-05 23:30:21,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:21,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-05 23:30:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3320 states and 3607 transitions. [2024-12-05 23:30:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 3607 transitions. [2024-12-05 23:30:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-12-05 23:30:22,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:22,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-05 23:30:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3398 states and 3687 transitions. [2024-12-05 23:30:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 3687 transitions. [2024-12-05 23:30:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-12-05 23:30:23,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:23,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-05 23:30:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3425 states and 3713 transitions. [2024-12-05 23:30:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 3713 transitions. [2024-12-05 23:30:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-12-05 23:30:24,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:24,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-05 23:30:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 3503 states and 3791 transitions. [2024-12-05 23:30:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 3791 transitions. [2024-12-05 23:30:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-12-05 23:30:25,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:25,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-05 23:30:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3581 states and 3871 transitions. [2024-12-05 23:30:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 3871 transitions. [2024-12-05 23:30:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-12-05 23:30:26,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:30:26,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:30:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:30:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-05 23:30:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:30:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2264 states and 2454 transitions. [2024-12-05 23:30:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2454 transitions. [2024-12-05 23:30:27,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-05 23:30:27,716 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 77 iterations. [2024-12-05 23:30:27,722 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-05 23:30:48,760 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,760 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,761 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,761 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,761 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,761 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,762 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,762 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,762 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,762 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,762 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,762 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,763 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,763 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,763 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,763 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,764 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,764 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,764 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,764 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,764 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,764 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,764 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,765 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,765 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,765 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,765 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-05 23:30:48,765 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,766 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,766 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,766 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,766 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,766 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,766 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,767 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,767 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,767 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 602) no Hoare annotation was computed. [2024-12-05 23:30:48,767 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,767 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,767 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,768 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,768 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,768 INFO L77 FloydHoareUtils]: At program point L598-1(lines 39 608) the Hoare annotation is: (let ((.cse5 (= ~a19~0 1))) (let ((.cse2 (not .cse5)) (.cse3 (<= ~a28~0 9)) (.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse4 (<= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 (<= ~a28~0 10)) (and .cse3 .cse2) (and .cse3 .cse4) (and (<= 11 ~a28~0) .cse0 .cse5) (and .cse1 .cse4 (< ~a28~0 11) .cse5)))) [2024-12-05 23:30:48,768 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,768 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,768 INFO L77 FloydHoareUtils]: At program point L601-1(lines 39 608) the Hoare annotation is: (let ((.cse5 (= ~a19~0 1))) (let ((.cse2 (not .cse5)) (.cse3 (<= ~a28~0 9)) (.cse0 (= ~a25~0 1)) (.cse1 (not (= 7 ~a17~0))) (.cse4 (<= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 (<= ~a28~0 10)) (and .cse3 .cse2) (and .cse3 .cse4) (and (<= 11 ~a28~0) .cse0 .cse5) (and .cse1 .cse4 (< ~a28~0 11) .cse5)))) [2024-12-05 23:30:48,769 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,769 INFO L75 FloydHoareUtils]: For program point L602(line 602) no Hoare annotation was computed. [2024-12-05 23:30:48,769 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,769 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,769 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,769 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,769 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,769 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,770 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,770 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,770 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,770 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,770 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-05 23:30:48,770 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,770 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,770 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,771 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,771 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,771 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,771 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,771 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,771 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,772 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,772 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,772 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,772 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,773 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,773 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,773 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,773 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,773 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,773 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-05 23:30:48,774 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,774 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,774 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,774 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,774 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,774 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,775 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse6 (= ~a19~0 1)) (.cse10 (= 7 ~a17~0))) (let ((.cse4 (<= ~a28~0 9)) (.cse1 (not .cse10)) (.cse3 (<= ~a28~0 10)) (.cse5 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1)) (.cse2 (not .cse6)) (.cse7 (= ~a28~0 10)) (.cse8 (= ~a21~0 1)) (.cse0 (= ~a25~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse4 .cse5) (and .cse1 .cse5 .cse3 .cse6) (and (<= 11 ~a28~0) .cse0 .cse6) (and .cse7 .cse8 .cse5 .cse6 (not .cse9)) (and .cse9 .cse2 .cse7 .cse8 .cse10 (not .cse0))))) [2024-12-05 23:30:48,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 11:30:48 ImpRootNode [2024-12-05 23:30:48,788 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 23:30:48,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 23:30:48,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 23:30:48,789 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 23:30:48,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:29:17" (3/4) ... [2024-12-05 23:30:48,792 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-05 23:30:48,805 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-12-05 23:30:48,806 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-05 23:30:48,807 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-05 23:30:48,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-05 23:30:48,921 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 23:30:48,921 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 23:30:48,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 23:30:48,922 INFO L158 Benchmark]: Toolchain (without parser) took 93071.28ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 117.0MB in the beginning and 1.1GB in the end (delta: -935.3MB). Peak memory consumption was 231.1MB. Max. memory is 16.1GB. [2024-12-05 23:30:48,923 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:30:48,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.76ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 90.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-05 23:30:48,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.65ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 85.4MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:30:48,923 INFO L158 Benchmark]: Boogie Preprocessor took 49.05ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 81.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:30:48,924 INFO L158 Benchmark]: RCFGBuilder took 1123.31ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 63.2MB in the end (delta: 18.4MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2024-12-05 23:30:48,924 INFO L158 Benchmark]: CodeCheck took 91312.71ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 63.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. [2024-12-05 23:30:48,924 INFO L158 Benchmark]: Witness Printer took 132.84ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:30:48,925 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.2s, OverallIterations: 77, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282633 SdHoareTripleChecker+Valid, 618.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 282109 mSDsluCounter, 29906 SdHoareTripleChecker+Invalid, 526.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25464 mSDsCounter, 84859 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 624008 IncrementalHoareTripleChecker+Invalid, 708867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84859 mSolverCounterUnsat, 4442 mSDtfsCounter, 624008 mSolverCounterSat, 4.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130533 GetRequests, 125366 SyntacticMatches, 4593 SemanticMatches, 574 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218806 ImplicationChecksByTransitivity, 36.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 19458 NumberOfCodeBlocks, 19458 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 19382 ConstructedInterpolants, 0 QuantifiedInterpolants, 79691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 76 InterpolantComputations, 53 PerfectInterpolantSequences, 27279/28951 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, ConComCheckerStatistics: No data available - PositiveResult [Line: 602]: 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: 39]: Location Invariant Derived location invariant: ((((((((((a25 == 1) && (7 != a17)) && (a19 != 1)) && (a28 <= 10)) || ((a28 <= 9) && (a19 != 1))) || ((a28 <= 9) && (a17 <= 8))) || ((((7 != a17) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1))) || (((11 <= a28) && (a25 == 1)) && (a19 == 1))) || (((((a28 == 10) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || ((((((a11 == 1) && (a19 != 1)) && (a28 == 10)) && (a21 == 1)) && (7 == a17)) && (a25 != 1))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((((((a25 == 1) && (7 != a17)) && (a19 != 1)) && (a28 <= 10)) || ((a28 <= 9) && (a19 != 1))) || ((a28 <= 9) && (a17 <= 8))) || ((((7 != a17) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1))) || (((11 <= a28) && (a25 == 1)) && (a19 == 1))) || (((((a28 == 10) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || ((((((a11 == 1) && (a19 != 1)) && (a28 == 10)) && (a21 == 1)) && (7 == a17)) && (a25 != 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.76ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 90.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.65ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 85.4MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.05ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 81.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1123.31ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 63.2MB in the end (delta: 18.4MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. * CodeCheck took 91312.71ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 63.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. * Witness Printer took 132.84ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-05 23:30:48,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e1ef11-568d-4f1e-b247-7df723ddd320/bin/ukojak-verify-CZk0znPC7b/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