./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label01.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d471a677e512dd3a7f76c682c4bf3cc875f41115224349694597713a7863b710 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:17:22,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:17:22,688 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:17:22,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:17:22,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:17:22,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:17:22,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:17:22,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:17:22,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:17:22,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:17:22,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:17:22,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:17:22,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:17:22,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:17:22,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:17:22,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:17:22,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:17:22,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:17:22,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:17:22,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:17:22,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:17:22,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:17:22,737 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:17:22,738 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:17:22,738 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:17:22,739 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:17:22,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:17:22,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:17:22,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:17:22,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:17:22,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:17:22,742 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:17:22,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:17:22,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d471a677e512dd3a7f76c682c4bf3cc875f41115224349694597713a7863b710 [2024-11-09 00:17:23,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:17:23,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:17:23,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:17:23,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:17:23,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:17:23,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem02_label01.c Unable to find full path for "g++" [2024-11-09 00:17:25,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:17:25,902 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:17:25,903 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/sv-benchmarks/c/eca-rers2012/Problem02_label01.c [2024-11-09 00:17:25,922 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/data/e9c47c2a9/14e097ed21184a568b181e95cec3082e/FLAGdc1d3b1f8 [2024-11-09 00:17:26,158 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/data/e9c47c2a9/14e097ed21184a568b181e95cec3082e [2024-11-09 00:17:26,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:17:26,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:17:26,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:17:26,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:17:26,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:17:26,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:17:26" (1/1) ... [2024-11-09 00:17:26,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e57287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:26, skipping insertion in model container [2024-11-09 00:17:26,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:17:26" (1/1) ... [2024-11-09 00:17:26,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:17:26,774 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_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/sv-benchmarks/c/eca-rers2012/Problem02_label01.c[18261,18274] [2024-11-09 00:17:26,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:17:26,841 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:17:26,960 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_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/sv-benchmarks/c/eca-rers2012/Problem02_label01.c[18261,18274] [2024-11-09 00:17:26,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:17:27,012 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:17:27,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27 WrapperNode [2024-11-09 00:17:27,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:17:27,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:17:27,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:17:27,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:17:27,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,131 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-09 00:17:27,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:17:27,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:17:27,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:17:27,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:17:27,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:17:27,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:17:27,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:17:27,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:17:27,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:27" (1/1) ... [2024-11-09 00:17:27,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:17:27,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:17:27,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:17:27,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:17:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:17:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:17:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:17:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:17:27,439 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:17:27,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:17:28,991 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-09 00:17:28,991 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:17:29,349 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:17:29,349 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:17:29,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:17:29 BoogieIcfgContainer [2024-11-09 00:17:29,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:17:29,351 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:17:29,351 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:17:29,365 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:17:29,365 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:17:29" (1/1) ... [2024-11-09 00:17:29,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:17:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-09 00:17:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-09 00:17:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 00:17:29,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:17:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-11-09 00:17:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-09 00:17:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 00:17:31,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:31,552 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-09 00:17:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-11-09 00:17:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-11-09 00:17:32,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:17:32,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:32,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:32,829 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-09 00:17:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-11-09 00:17:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-11-09 00:17:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 00:17:32,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:33,193 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-09 00:17:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-11-09 00:17:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-11-09 00:17:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:17:33,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:33,413 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-09 00:17:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-11-09 00:17:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-11-09 00:17:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 00:17:33,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:33,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:33,829 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-09 00:17:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-11-09 00:17:33,904 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-11-09 00:17:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:17:33,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:34,044 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-09 00:17:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-11-09 00:17:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-11-09 00:17:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 00:17:34,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:34,265 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-09 00:17:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-11-09 00:17:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-11-09 00:17:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 00:17:34,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:34,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:34,980 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-09 00:17:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 386 states and 495 transitions. [2024-11-09 00:17:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 495 transitions. [2024-11-09 00:17:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 00:17:36,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:37,083 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-09 00:17:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 418 states and 534 transitions. [2024-11-09 00:17:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 534 transitions. [2024-11-09 00:17:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 00:17:37,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:37,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:38,081 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-09 00:17:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 428 states and 545 transitions. [2024-11-09 00:17:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 545 transitions. [2024-11-09 00:17:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 00:17:38,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:38,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:38,567 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-09 00:17:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 460 states and 585 transitions. [2024-11-09 00:17:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 585 transitions. [2024-11-09 00:17:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 00:17:39,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:39,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:39,515 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-09 00:17:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 467 states and 592 transitions. [2024-11-09 00:17:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 592 transitions. [2024-11-09 00:17:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 00:17:39,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:39,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:39,760 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-09 00:17:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 473 states and 600 transitions. [2024-11-09 00:17:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 600 transitions. [2024-11-09 00:17:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 00:17:40,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:40,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:40,275 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-09 00:17:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 486 states and 615 transitions. [2024-11-09 00:17:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 615 transitions. [2024-11-09 00:17:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 00:17:40,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:40,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:40,896 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-09 00:17:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 507 states and 641 transitions. [2024-11-09 00:17:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 641 transitions. [2024-11-09 00:17:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 00:17:41,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:41,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:41,811 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-09 00:17:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 521 states and 658 transitions. [2024-11-09 00:17:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 658 transitions. [2024-11-09 00:17:42,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 00:17:42,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:42,234 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-09 00:17:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 536 states and 678 transitions. [2024-11-09 00:17:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 678 transitions. [2024-11-09 00:17:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 00:17:43,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:43,161 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-09 00:17:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 543 states and 685 transitions. [2024-11-09 00:17:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 685 transitions. [2024-11-09 00:17:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:17:43,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:43,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:43,494 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-09 00:17:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 574 states and 718 transitions. [2024-11-09 00:17:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 718 transitions. [2024-11-09 00:17:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 00:17:43,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:44,014 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-09 00:17:44,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 598 states and 750 transitions. [2024-11-09 00:17:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 750 transitions. [2024-11-09 00:17:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 00:17:44,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:45,044 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-09 00:17:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 601 states and 753 transitions. [2024-11-09 00:17:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 753 transitions. [2024-11-09 00:17:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 00:17:45,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:45,248 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-09 00:17:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 680 states and 838 transitions. [2024-11-09 00:17:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 838 transitions. [2024-11-09 00:17:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 00:17:46,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:46,523 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-09 00:17:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 693 states and 854 transitions. [2024-11-09 00:17:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 854 transitions. [2024-11-09 00:17:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:17:47,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:47,343 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-09 00:17:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 710 states and 873 transitions. [2024-11-09 00:17:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 873 transitions. [2024-11-09 00:17:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:17:48,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:48,496 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-09 00:17:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 716 states and 879 transitions. [2024-11-09 00:17:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 879 transitions. [2024-11-09 00:17:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:17:48,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 00:17:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 740 states and 906 transitions. [2024-11-09 00:17:49,517 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 906 transitions. [2024-11-09 00:17:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:17:49,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:49,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 00:17:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 749 states and 916 transitions. [2024-11-09 00:17:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 916 transitions. [2024-11-09 00:17:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 00:17:50,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:50,172 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-09 00:17:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 768 states and 936 transitions. [2024-11-09 00:17:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 936 transitions. [2024-11-09 00:17:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 00:17:50,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:17:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 781 states and 953 transitions. [2024-11-09 00:17:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 953 transitions. [2024-11-09 00:17:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:17:51,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:51,741 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-09 00:17:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 812 states and 986 transitions. [2024-11-09 00:17:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 986 transitions. [2024-11-09 00:17:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:17:52,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:52,373 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-09 00:17:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 829 states and 1007 transitions. [2024-11-09 00:17:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1007 transitions. [2024-11-09 00:17:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:17:53,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:53,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:53,462 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-09 00:17:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 842 states and 1021 transitions. [2024-11-09 00:17:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1021 transitions. [2024-11-09 00:17:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:17:54,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:54,199 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-09 00:17:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 848 states and 1027 transitions. [2024-11-09 00:17:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1027 transitions. [2024-11-09 00:17:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:17:54,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:54,685 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-09 00:17:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 885 states and 1064 transitions. [2024-11-09 00:17:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1064 transitions. [2024-11-09 00:17:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 00:17:55,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:55,154 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-09 00:17:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 919 states and 1101 transitions. [2024-11-09 00:17:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1101 transitions. [2024-11-09 00:17:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 00:17:55,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:55,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:56,075 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-09 00:17:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 932 states and 1113 transitions. [2024-11-09 00:17:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1113 transitions. [2024-11-09 00:17:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 00:17:56,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:56,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:56,787 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-09 00:17:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 939 states and 1120 transitions. [2024-11-09 00:17:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1120 transitions. [2024-11-09 00:17:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 00:17:57,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:57,339 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-09 00:17:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 945 states and 1125 transitions. [2024-11-09 00:17:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1125 transitions. [2024-11-09 00:17:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 00:17:57,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 00:17:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 957 states and 1138 transitions. [2024-11-09 00:17:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1138 transitions. [2024-11-09 00:17:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:17:58,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:58,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:58,272 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-09 00:17:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 994 states and 1176 transitions. [2024-11-09 00:17:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1176 transitions. [2024-11-09 00:17:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:17:58,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:58,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:58,942 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-09 00:17:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1001 states and 1182 transitions. [2024-11-09 00:17:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1182 transitions. [2024-11-09 00:17:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 00:17:59,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:59,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:59,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-09 00:17:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1003 states and 1186 transitions. [2024-11-09 00:17:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1186 transitions. [2024-11-09 00:17:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:17:59,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:59,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:59,798 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-09 00:17:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1004 states and 1186 transitions. [2024-11-09 00:18:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1186 transitions. [2024-11-09 00:18:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:18:00,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:00,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:00,175 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-09 00:18:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1005 states and 1186 transitions. [2024-11-09 00:18:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1186 transitions. [2024-11-09 00:18:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-09 00:18:00,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-09 00:18:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1006 states and 1186 transitions. [2024-11-09 00:18:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1186 transitions. [2024-11-09 00:18:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-09 00:18:00,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:00,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-09 00:18:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1043 states and 1222 transitions. [2024-11-09 00:18:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1222 transitions. [2024-11-09 00:18:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 00:18:01,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:01,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-09 00:18:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1139 states and 1323 transitions. [2024-11-09 00:18:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1323 transitions. [2024-11-09 00:18:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 00:18:03,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-09 00:18:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1146 states and 1329 transitions. [2024-11-09 00:18:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1329 transitions. [2024-11-09 00:18:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-09 00:18:04,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 00:18:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1159 states and 1342 transitions. [2024-11-09 00:18:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1342 transitions. [2024-11-09 00:18:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-09 00:18:04,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:04,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-09 00:18:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1224 states and 1412 transitions. [2024-11-09 00:18:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1412 transitions. [2024-11-09 00:18:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-09 00:18:06,221 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 00:18:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1342 states and 1537 transitions. [2024-11-09 00:18:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1537 transitions. [2024-11-09 00:18:09,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-09 00:18:09,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 00:18:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1349 states and 1543 transitions. [2024-11-09 00:18:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1543 transitions. [2024-11-09 00:18:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-09 00:18:10,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 00:18:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1272 states and 1446 transitions. [2024-11-09 00:18:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1446 transitions. [2024-11-09 00:18:13,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:18:13,331 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 55 iterations. [2024-11-09 00:18:13,340 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-09 00:18:20,767 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,767 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,768 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,768 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,768 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,769 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,769 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,769 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,770 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,770 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,770 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,770 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,771 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,771 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,771 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,772 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,772 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,772 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,772 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,773 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,773 INFO L77 FloydHoareUtils]: At program point L517-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-11-09 00:18:20,773 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,773 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,774 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,774 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,774 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,774 INFO L77 FloydHoareUtils]: At program point L520-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-11-09 00:18:20,775 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,775 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:18:20,775 INFO L75 FloydHoareUtils]: For program point L521(line 521) no Hoare annotation was computed. [2024-11-09 00:18:20,777 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,778 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,778 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,778 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,778 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,778 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,779 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,779 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,779 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,779 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2024-11-09 00:18:20,779 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,780 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,780 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,780 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,780 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,782 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,782 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,783 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,783 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,783 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,783 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,784 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,784 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,784 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,784 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,784 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,785 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,785 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,785 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-09 00:18:20,785 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,785 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,785 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,786 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,786 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,786 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,786 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,787 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,787 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,788 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,788 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,789 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,791 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,791 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,791 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,792 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,792 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,792 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,792 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:18:20,793 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,793 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,793 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,793 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,794 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,794 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,795 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-09 00:18:20,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:18:20 ImpRootNode [2024-11-09 00:18:20,826 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:18:20,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:18:20,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:18:20,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:18:20,828 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:17:29" (3/4) ... [2024-11-09 00:18:20,833 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:18:20,866 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2024-11-09 00:18:20,867 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 00:18:20,872 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:18:20,874 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:18:21,093 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:18:21,094 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:18:21,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:18:21,095 INFO L158 Benchmark]: Toolchain (without parser) took 54931.74ms. Allocated memory was 169.9MB in the beginning and 775.9MB in the end (delta: 606.1MB). Free memory was 125.6MB in the beginning and 662.8MB in the end (delta: -537.1MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2024-11-09 00:18:21,096 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 127.9MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:18:21,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 848.16ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 96.3MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 00:18:21,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.58ms. Allocated memory is still 169.9MB. Free memory was 96.3MB in the beginning and 90.9MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:18:21,097 INFO L158 Benchmark]: Boogie Preprocessor took 80.54ms. Allocated memory is still 169.9MB. Free memory was 90.9MB in the beginning and 86.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:18:21,098 INFO L158 Benchmark]: RCFGBuilder took 2135.95ms. Allocated memory is still 169.9MB. Free memory was 86.2MB in the beginning and 77.3MB in the end (delta: 8.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-09 00:18:21,098 INFO L158 Benchmark]: CodeCheck took 51475.35ms. Allocated memory was 169.9MB in the beginning and 775.9MB in the end (delta: 606.1MB). Free memory was 77.3MB in the beginning and 676.4MB in the end (delta: -599.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-09 00:18:21,099 INFO L158 Benchmark]: Witness Printer took 267.39ms. Allocated memory is still 775.9MB. Free memory was 676.4MB in the beginning and 662.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:18:21,101 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: 43.9s, OverallIterations: 55, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72958 SdHoareTripleChecker+Valid, 281.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72480 mSDsluCounter, 11063 SdHoareTripleChecker+Invalid, 238.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9255 mSDsCounter, 26474 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166545 IncrementalHoareTripleChecker+Invalid, 193019 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26474 mSolverCounterUnsat, 1808 mSDtfsCounter, 166545 mSolverCounterSat, 3.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56578 GetRequests, 55062 SyntacticMatches, 1172 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60125 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 8246 NumberOfCodeBlocks, 8246 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 8192 ConstructedInterpolants, 0 QuantifiedInterpolants, 24508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 48 PerfectInterpolantSequences, 5746/5876 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: 521]: 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: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 127.9MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 848.16ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 96.3MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.58ms. Allocated memory is still 169.9MB. Free memory was 96.3MB in the beginning and 90.9MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.54ms. Allocated memory is still 169.9MB. Free memory was 90.9MB in the beginning and 86.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2135.95ms. Allocated memory is still 169.9MB. Free memory was 86.2MB in the beginning and 77.3MB in the end (delta: 8.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * CodeCheck took 51475.35ms. Allocated memory was 169.9MB in the beginning and 775.9MB in the end (delta: 606.1MB). Free memory was 77.3MB in the beginning and 676.4MB in the end (delta: -599.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Witness Printer took 267.39ms. Allocated memory is still 775.9MB. Free memory was 676.4MB in the beginning and 662.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-09 00:18:21,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_584c427c-7f38-4b83-80eb-dbb9fa3d47bb/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE