./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label31.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm --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 a6b4686a702c55ef2a6c6f32177e8de2a3958b27b177bd3bb0594e6295487599 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:29:53,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:29:53,673 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:29:53,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:29:53,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:29:53,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:29:53,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:29:53,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:29:53,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:29:53,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:29:53,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:29:53,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:29:53,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:29:53,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:29:53,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:29:53,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:29:53,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:29:53,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:29:53,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:29:53,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:29:53,723 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:29:53,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:29:53,724 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:29:53,724 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:29:53,724 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:29:53,724 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:29:53,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:29:53,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:29:53,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:29:53,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:29:53,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:29:53,725 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:29:53,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:29:53,725 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_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> a6b4686a702c55ef2a6c6f32177e8de2a3958b27b177bd3bb0594e6295487599 [2024-11-13 22:29:54,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:29:54,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:29:54,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:29:54,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:29:54,127 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:29:54,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem02_label31.c Unable to find full path for "g++" [2024-11-13 22:29:56,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:29:56,736 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:29:56,737 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/sv-benchmarks/c/eca-rers2012/Problem02_label31.c [2024-11-13 22:29:56,755 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/data/6b996ac98/8a710eb863ca4e5aac70d66fb11e7ded/FLAG6d0ac6da1 [2024-11-13 22:29:56,774 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/data/6b996ac98/8a710eb863ca4e5aac70d66fb11e7ded [2024-11-13 22:29:56,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:29:56,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:29:56,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:29:56,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:29:56,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:29:56,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:29:56" (1/1) ... [2024-11-13 22:29:56,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6382aab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:56, skipping insertion in model container [2024-11-13 22:29:56,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:29:56" (1/1) ... [2024-11-13 22:29:56,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:29:57,228 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_de8f8bcf-965a-4b8a-ba65-8efe998d9817/sv-benchmarks/c/eca-rers2012/Problem02_label31.c[18601,18614] [2024-11-13 22:29:57,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:29:57,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:29:57,347 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_de8f8bcf-965a-4b8a-ba65-8efe998d9817/sv-benchmarks/c/eca-rers2012/Problem02_label31.c[18601,18614] [2024-11-13 22:29:57,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:29:57,384 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:29:57,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57 WrapperNode [2024-11-13 22:29:57,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:29:57,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:29:57,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:29:57,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:29:57,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,490 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-13 22:29:57,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:29:57,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:29:57,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:29:57,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:29:57,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:29:57,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:29:57,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:29:57,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:29:57,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:29:57" (1/1) ... [2024-11-13 22:29:57,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:29:57,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:29:57,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:29:57,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:29:57,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:29:57,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:29:57,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:29:57,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:29:57,730 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:29:57,732 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:29:59,104 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-13 22:29:59,105 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:29:59,551 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:29:59,551 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:29:59,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:29:59 BoogieIcfgContainer [2024-11-13 22:29:59,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:29:59,553 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:29:59,553 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:29:59,566 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:29:59,566 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:29:59" (1/1) ... [2024-11-13 22:29:59,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:29:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:29:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-13 22:29:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-13 22:29:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 22:29:59,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:29:59,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:29:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-11-13 22:30:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-13 22:30:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 22:30:01,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:01,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-11-13 22:30:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-11-13 22:30:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 22:30:02,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:02,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-11-13 22:30:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-11-13 22:30:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 22:30:03,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:03,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-11-13 22:30:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-11-13 22:30:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 22:30:03,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:03,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 22:30:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-11-13 22:30:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-11-13 22:30:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 22:30:03,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:03,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-11-13 22:30:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-11-13 22:30:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 22:30:04,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-11-13 22:30:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-11-13 22:30:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 22:30:04,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-11-13 22:30:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-11-13 22:30:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 22:30:04,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:04,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 386 states and 495 transitions. [2024-11-13 22:30:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 495 transitions. [2024-11-13 22:30:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 22:30:06,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 418 states and 534 transitions. [2024-11-13 22:30:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 534 transitions. [2024-11-13 22:30:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 22:30:07,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:07,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 22:30:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 428 states and 545 transitions. [2024-11-13 22:30:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 545 transitions. [2024-11-13 22:30:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 22:30:08,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:08,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 460 states and 585 transitions. [2024-11-13 22:30:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 585 transitions. [2024-11-13 22:30:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 22:30:08,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:08,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 467 states and 592 transitions. [2024-11-13 22:30:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 592 transitions. [2024-11-13 22:30:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 22:30:09,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 473 states and 600 transitions. [2024-11-13 22:30:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 600 transitions. [2024-11-13 22:30:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 22:30:09,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 486 states and 615 transitions. [2024-11-13 22:30:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 615 transitions. [2024-11-13 22:30:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 22:30:10,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:10,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 22:30:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 507 states and 641 transitions. [2024-11-13 22:30:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 641 transitions. [2024-11-13 22:30:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 22:30:10,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 521 states and 658 transitions. [2024-11-13 22:30:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 658 transitions. [2024-11-13 22:30:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 22:30:11,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 22:30:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 536 states and 678 transitions. [2024-11-13 22:30:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 678 transitions. [2024-11-13 22:30:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 22:30:12,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:12,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:30:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 543 states and 685 transitions. [2024-11-13 22:30:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 685 transitions. [2024-11-13 22:30:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 22:30:12,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 22:30:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 574 states and 718 transitions. [2024-11-13 22:30:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 718 transitions. [2024-11-13 22:30:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 22:30:12,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 598 states and 750 transitions. [2024-11-13 22:30:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 750 transitions. [2024-11-13 22:30:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 22:30:13,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 22:30:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 601 states and 753 transitions. [2024-11-13 22:30:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 753 transitions. [2024-11-13 22:30:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 22:30:14,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 724 states and 882 transitions. [2024-11-13 22:30:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 882 transitions. [2024-11-13 22:30:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 22:30:16,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 737 states and 898 transitions. [2024-11-13 22:30:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 898 transitions. [2024-11-13 22:30:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 22:30:17,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:17,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 754 states and 917 transitions. [2024-11-13 22:30:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 917 transitions. [2024-11-13 22:30:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 22:30:18,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 760 states and 923 transitions. [2024-11-13 22:30:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 923 transitions. [2024-11-13 22:30:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 22:30:18,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 787 states and 952 transitions. [2024-11-13 22:30:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 952 transitions. [2024-11-13 22:30:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 22:30:19,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 22:30:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 809 states and 975 transitions. [2024-11-13 22:30:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 975 transitions. [2024-11-13 22:30:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 22:30:19,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 836 states and 1004 transitions. [2024-11-13 22:30:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1004 transitions. [2024-11-13 22:30:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 22:30:20,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 867 states and 1037 transitions. [2024-11-13 22:30:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1037 transitions. [2024-11-13 22:30:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 22:30:20,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:20,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 884 states and 1058 transitions. [2024-11-13 22:30:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1058 transitions. [2024-11-13 22:30:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 22:30:21,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 897 states and 1072 transitions. [2024-11-13 22:30:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1072 transitions. [2024-11-13 22:30:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 22:30:22,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:22,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 903 states and 1078 transitions. [2024-11-13 22:30:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1078 transitions. [2024-11-13 22:30:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 22:30:22,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:22,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 940 states and 1115 transitions. [2024-11-13 22:30:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1115 transitions. [2024-11-13 22:30:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 22:30:23,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:23,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 974 states and 1154 transitions. [2024-11-13 22:30:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1154 transitions. [2024-11-13 22:30:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 22:30:24,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 987 states and 1166 transitions. [2024-11-13 22:30:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1166 transitions. [2024-11-13 22:30:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 22:30:24,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 994 states and 1173 transitions. [2024-11-13 22:30:25,206 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1173 transitions. [2024-11-13 22:30:25,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 22:30:25,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:30:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1000 states and 1178 transitions. [2024-11-13 22:30:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1178 transitions. [2024-11-13 22:30:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 22:30:25,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:25,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 22:30:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1037 states and 1216 transitions. [2024-11-13 22:30:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1216 transitions. [2024-11-13 22:30:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 22:30:26,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:26,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 22:30:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1044 states and 1222 transitions. [2024-11-13 22:30:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1222 transitions. [2024-11-13 22:30:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-13 22:30:26,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:30:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1080 states and 1260 transitions. [2024-11-13 22:30:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1260 transitions. [2024-11-13 22:30:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 22:30:27,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:30:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1087 states and 1268 transitions. [2024-11-13 22:30:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1268 transitions. [2024-11-13 22:30:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 22:30:27,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:27,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 22:30:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1089 states and 1269 transitions. [2024-11-13 22:30:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1269 transitions. [2024-11-13 22:30:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 22:30:27,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:27,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 22:30:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1090 states and 1269 transitions. [2024-11-13 22:30:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1269 transitions. [2024-11-13 22:30:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 22:30:27,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 22:30:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1118 states and 1298 transitions. [2024-11-13 22:30:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1298 transitions. [2024-11-13 22:30:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 22:30:28,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 22:30:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1127 states and 1308 transitions. [2024-11-13 22:30:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1308 transitions. [2024-11-13 22:30:28,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 22:30:28,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:28,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:30:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1152 states and 1334 transitions. [2024-11-13 22:30:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1334 transitions. [2024-11-13 22:30:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 22:30:28,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 22:30:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1215 states and 1404 transitions. [2024-11-13 22:30:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1404 transitions. [2024-11-13 22:30:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 22:30:30,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 22:30:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1261 states and 1457 transitions. [2024-11-13 22:30:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1457 transitions. [2024-11-13 22:30:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 22:30:31,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:31,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 22:30:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1298 states and 1493 transitions. [2024-11-13 22:30:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1493 transitions. [2024-11-13 22:30:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 22:30:32,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 22:30:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1305 states and 1499 transitions. [2024-11-13 22:30:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1499 transitions. [2024-11-13 22:30:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:30:32,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:32,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 22:30:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1306 states and 1499 transitions. [2024-11-13 22:30:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1499 transitions. [2024-11-13 22:30:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-13 22:30:33,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:33,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 22:30:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1311 states and 1505 transitions. [2024-11-13 22:30:33,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1505 transitions. [2024-11-13 22:30:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-13 22:30:33,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:33,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 121 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 22:30:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1381 states and 1586 transitions. [2024-11-13 22:30:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1586 transitions. [2024-11-13 22:30:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-13 22:30:35,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:35,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 133 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 22:30:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1433 states and 1642 transitions. [2024-11-13 22:30:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1642 transitions. [2024-11-13 22:30:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-13 22:30:37,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 133 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 22:30:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1438 states and 1646 transitions. [2024-11-13 22:30:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1646 transitions. [2024-11-13 22:30:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-13 22:30:38,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 22:30:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1511 states and 1724 transitions. [2024-11-13 22:30:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1724 transitions. [2024-11-13 22:30:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-13 22:30:39,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 22:30:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1518 states and 1732 transitions. [2024-11-13 22:30:39,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1732 transitions. [2024-11-13 22:30:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-13 22:30:39,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:39,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 22:30:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1554 states and 1775 transitions. [2024-11-13 22:30:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1775 transitions. [2024-11-13 22:30:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-13 22:30:40,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 22:30:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1568 states and 1789 transitions. [2024-11-13 22:30:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1789 transitions. [2024-11-13 22:30:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-13 22:30:41,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:41,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 149 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 22:30:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1583 states and 1804 transitions. [2024-11-13 22:30:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1804 transitions. [2024-11-13 22:30:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:30:41,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:41,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 22:30:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1598 states and 1822 transitions. [2024-11-13 22:30:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1822 transitions. [2024-11-13 22:30:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:30:42,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 22:30:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1608 states and 1832 transitions. [2024-11-13 22:30:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1832 transitions. [2024-11-13 22:30:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-13 22:30:42,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 22:30:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1636 states and 1860 transitions. [2024-11-13 22:30:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1860 transitions. [2024-11-13 22:30:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 22:30:43,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 52 proven. 130 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 22:30:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1715 states and 1940 transitions. [2024-11-13 22:30:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1940 transitions. [2024-11-13 22:30:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-13 22:30:44,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:44,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 22:30:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1755 states and 1982 transitions. [2024-11-13 22:30:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 1982 transitions. [2024-11-13 22:30:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-13 22:30:45,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-13 22:30:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 1785 states and 2013 transitions. [2024-11-13 22:30:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2013 transitions. [2024-11-13 22:30:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-13 22:30:46,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-13 22:30:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 1888 states and 2120 transitions. [2024-11-13 22:30:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2120 transitions. [2024-11-13 22:30:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-13 22:30:48,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 281 proven. 88 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-13 22:30:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 1949 states and 2184 transitions. [2024-11-13 22:30:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2184 transitions. [2024-11-13 22:30:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-13 22:30:49,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:49,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 22:30:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2105 states and 2345 transitions. [2024-11-13 22:30:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2345 transitions. [2024-11-13 22:30:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-13 22:30:51,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 394 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 22:30:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2145 states and 2388 transitions. [2024-11-13 22:30:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2388 transitions. [2024-11-13 22:30:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-13 22:30:53,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:53,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 394 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 22:30:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2183 states and 2424 transitions. [2024-11-13 22:30:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2424 transitions. [2024-11-13 22:30:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-13 22:30:54,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-13 22:30:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2223 states and 2464 transitions. [2024-11-13 22:30:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2464 transitions. [2024-11-13 22:30:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-13 22:30:56,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:56,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 463 proven. 58 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 22:30:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:30:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2365 states and 2609 transitions. [2024-11-13 22:30:59,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2609 transitions. [2024-11-13 22:30:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-13 22:30:59,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:30:59,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:30:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:30:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-13 22:31:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2395 states and 2638 transitions. [2024-11-13 22:31:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2638 transitions. [2024-11-13 22:31:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-13 22:31:00,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:00,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-13 22:31:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2398 states and 2640 transitions. [2024-11-13 22:31:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2640 transitions. [2024-11-13 22:31:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-13 22:31:01,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:31:01,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:31:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:31:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-13 22:31:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:31:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1793 states and 1993 transitions. [2024-11-13 22:31:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 1993 transitions. [2024-11-13 22:31:01,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 22:31:01,959 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 78 iterations. [2024-11-13 22:31:01,967 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 22:31:24,403 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,404 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,404 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,404 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,404 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,404 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,405 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,405 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,405 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,405 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,405 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,406 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,406 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,406 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,406 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,406 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,406 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,407 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,407 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,408 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,408 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,408 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,408 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,409 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,409 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,409 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,409 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 22:31:24,409 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,410 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,410 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,410 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,410 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,410 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,411 INFO L77 FloydHoareUtils]: At program point L526-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (<= 9 ~a28~0) .cse0) (and (not (= 7 ~a17~0)) (<= ~a17~0 8) .cse0) (<= ~a28~0 7))) [2024-11-13 22:31:24,411 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,411 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,411 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,411 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 530) no Hoare annotation was computed. [2024-11-13 22:31:24,412 INFO L77 FloydHoareUtils]: At program point L529-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (<= 9 ~a28~0) .cse0) (and (not (= 7 ~a17~0)) (<= ~a17~0 8) .cse0) (<= ~a28~0 7))) [2024-11-13 22:31:24,412 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,412 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,412 INFO L75 FloydHoareUtils]: For program point L530(line 530) no Hoare annotation was computed. [2024-11-13 22:31:24,412 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,413 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,413 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,413 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,413 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,413 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,414 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,414 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,414 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,414 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,414 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,414 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,415 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,415 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,415 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,415 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,415 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-13 22:31:24,416 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,416 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,416 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,416 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,416 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,416 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,417 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,417 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,417 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,417 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,417 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,418 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,418 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,418 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,418 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,418 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,419 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,419 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,419 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 22:31:24,419 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,419 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,419 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,419 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,419 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,420 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,420 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse4 (= ~a28~0 9)) (.cse3 (= 7 ~a17~0)) (.cse0 (= ~a25~0 1)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (= ~a17~0 8) .cse2 .cse1 .cse4) (and (<= 9 ~a28~0) .cse5) (= ~a28~0 10) (and (not .cse3) .cse6 .cse5) (< 10 ~a28~0) (and .cse0 .cse2 .cse6 .cse1 .cse5) (<= ~a28~0 7))) [2024-11-13 22:31:24,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:31:24 ImpRootNode [2024-11-13 22:31:24,436 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:31:24,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:31:24,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:31:24,438 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:31:24,440 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:29:59" (3/4) ... [2024-11-13 22:31:24,443 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 22:31:24,467 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-11-13 22:31:24,468 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-13 22:31:24,469 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 22:31:24,470 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 22:31:24,641 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:31:24,642 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 22:31:24,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:31:24,644 INFO L158 Benchmark]: Toolchain (without parser) took 87865.21ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 117.6MB in the beginning and 630.8MB in the end (delta: -513.2MB). Peak memory consumption was 648.4MB. Max. memory is 16.1GB. [2024-11-13 22:31:24,644 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 167.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:31:24,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.30ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 91.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 22:31:24,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.54ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 86.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:31:24,646 INFO L158 Benchmark]: Boogie Preprocessor took 69.94ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 82.8MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:31:24,647 INFO L158 Benchmark]: RCFGBuilder took 1990.47ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 78.7MB in the end (delta: 4.2MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2024-11-13 22:31:24,649 INFO L158 Benchmark]: CodeCheck took 84883.89ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 78.7MB in the beginning and 643.1MB in the end (delta: -564.4MB). Peak memory consumption was 604.4MB. Max. memory is 16.1GB. [2024-11-13 22:31:24,649 INFO L158 Benchmark]: Witness Printer took 204.74ms. Allocated memory is still 1.3GB. Free memory was 643.1MB in the beginning and 630.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:31:24,651 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: 62.4s, OverallIterations: 78, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162560 SdHoareTripleChecker+Valid, 521.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161875 mSDsluCounter, 18726 SdHoareTripleChecker+Invalid, 442.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15705 mSDsCounter, 44040 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358714 IncrementalHoareTripleChecker+Invalid, 402754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44040 mSolverCounterUnsat, 3021 mSDtfsCounter, 358714 mSolverCounterSat, 5.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93974 GetRequests, 91281 SyntacticMatches, 2225 SemanticMatches, 468 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142121 ImplicationChecksByTransitivity, 31.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 13634 NumberOfCodeBlocks, 13634 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 13557 ConstructedInterpolants, 0 QuantifiedInterpolants, 41613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 77 InterpolantComputations, 63 PerfectInterpolantSequences, 12575/12997 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 530]: 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) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9)) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((9 <= a28) && (a11 != 1))) || (a28 == 10)) || (((7 != a17) && (a17 <= 8)) && (a11 != 1))) || (10 < a28)) || (((((a25 == 1) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((((((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9)) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((9 <= a28) && (a11 != 1))) || (a28 == 10)) || (((7 != a17) && (a17 <= 8)) && (a11 != 1))) || (10 < a28)) || (((((a25 == 1) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || (a28 <= 7)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 167.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.30ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 91.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.54ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 86.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.94ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 82.8MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1990.47ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 78.7MB in the end (delta: 4.2MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * CodeCheck took 84883.89ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 78.7MB in the beginning and 643.1MB in the end (delta: -564.4MB). Peak memory consumption was 604.4MB. Max. memory is 16.1GB. * Witness Printer took 204.74ms. Allocated memory is still 1.3GB. Free memory was 643.1MB in the beginning and 630.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 22:31:24,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8f8bcf-965a-4b8a-ba65-8efe998d9817/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE