./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label53.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7127a319cf1cd9799cd1fae45aa7d7ff5ae81a2fc57d6618c5b4c58ba3671893 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:37:46,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:37:46,135 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:37:46,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:37:46,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:37:46,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:37:46,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:37:46,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:37:46,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:37:46,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:37:46,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:37:46,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:37:46,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:37:46,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:37:46,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:37:46,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:37:46,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:37:46,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:37:46,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:37:46,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:37:46,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:37:46,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:37:46,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:37:46,196 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:37:46,196 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:37:46,196 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:37:46,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:37:46,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:37:46,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:37:46,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:37:46,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:37:46,197 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:37:46,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:37:46,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7127a319cf1cd9799cd1fae45aa7d7ff5ae81a2fc57d6618c5b4c58ba3671893 [2024-11-13 20:37:46,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:37:46,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:37:46,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:37:46,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:37:46,622 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:37:46,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label53.c Unable to find full path for "g++" [2024-11-13 20:37:48,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:37:49,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:37:49,204 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/sv-benchmarks/c/eca-rers2012/Problem01_label53.c [2024-11-13 20:37:49,226 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/data/bcc522717/dcb19a93932e489a89c18d50798cb5bd/FLAG301eb09ca [2024-11-13 20:37:49,386 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/data/bcc522717/dcb19a93932e489a89c18d50798cb5bd [2024-11-13 20:37:49,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:37:49,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:37:49,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:37:49,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:37:49,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:37:49,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:49,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b577f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49, skipping insertion in model container [2024-11-13 20:37:49,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:49,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:37:49,810 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_6c937617-c08d-4ca0-bf48-077bb906aa3f/sv-benchmarks/c/eca-rers2012/Problem01_label53.c[19724,19737] [2024-11-13 20:37:49,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:37:49,855 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:37:49,942 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_6c937617-c08d-4ca0-bf48-077bb906aa3f/sv-benchmarks/c/eca-rers2012/Problem01_label53.c[19724,19737] [2024-11-13 20:37:49,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:37:49,972 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:37:49,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49 WrapperNode [2024-11-13 20:37:49,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:37:49,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:37:49,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:37:49,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:37:49,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:49,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:50,055 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 20:37:50,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:37:50,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:37:50,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:37:50,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:37:50,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:50,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:50,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:50,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:50,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:50,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:50,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:50,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:50,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:37:50,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:37:50,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:37:50,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:37:50,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:37:49" (1/1) ... [2024-11-13 20:37:50,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:37:50,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:37:50,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:37:50,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:37:50,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:37:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:37:50,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:37:50,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:37:50,361 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:37:50,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:37:52,059 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 20:37:52,059 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:37:52,499 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:37:52,500 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:37:52,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:37:52 BoogieIcfgContainer [2024-11-13 20:37:52,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:37:52,501 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:37:52,502 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:37:52,515 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:37:52,515 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:37:52" (1/1) ... [2024-11-13 20:37:52,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:37:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 20:37:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 20:37:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 20:37:52,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-11-13 20:37:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-13 20:37:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:37:54,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:37:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-11-13 20:37:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-11-13 20:37:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 20:37:55,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-11-13 20:37:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-11-13 20:37:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 20:37:55,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:55,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 226 states and 305 transitions. [2024-11-13 20:37:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-11-13 20:37:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-13 20:37:57,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:57,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 227 states and 307 transitions. [2024-11-13 20:37:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2024-11-13 20:37:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 20:37:57,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 230 states and 310 transitions. [2024-11-13 20:37:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2024-11-13 20:37:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 20:37:57,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:37:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 238 states and 323 transitions. [2024-11-13 20:37:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-11-13 20:37:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 20:37:58,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:58,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:37:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 243 states and 328 transitions. [2024-11-13 20:37:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 328 transitions. [2024-11-13 20:37:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 20:37:59,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:37:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:37:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-11-13 20:37:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-11-13 20:37:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:37:59,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:37:59,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:37:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:37:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 257 states and 346 transitions. [2024-11-13 20:38:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2024-11-13 20:38:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 20:38:00,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:00,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 259 states and 348 transitions. [2024-11-13 20:38:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-11-13 20:38:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 20:38:01,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:38:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 268 states and 360 transitions. [2024-11-13 20:38:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 360 transitions. [2024-11-13 20:38:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:38:01,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:01,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:38:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 272 states and 365 transitions. [2024-11-13 20:38:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-11-13 20:38:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 20:38:02,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:02,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:38:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 275 states and 371 transitions. [2024-11-13 20:38:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2024-11-13 20:38:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 20:38:03,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:38:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 287 states and 387 transitions. [2024-11-13 20:38:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-11-13 20:38:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 20:38:04,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:04,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:38:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 288 states and 387 transitions. [2024-11-13 20:38:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 387 transitions. [2024-11-13 20:38:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 20:38:04,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 305 states and 406 transitions. [2024-11-13 20:38:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 406 transitions. [2024-11-13 20:38:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:38:04,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:04,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:38:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 320 states and 423 transitions. [2024-11-13 20:38:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2024-11-13 20:38:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 20:38:05,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:38:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 335 states and 439 transitions. [2024-11-13 20:38:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2024-11-13 20:38:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 20:38:06,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:38:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 349 states and 453 transitions. [2024-11-13 20:38:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 453 transitions. [2024-11-13 20:38:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 20:38:07,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:07,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:38:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 352 states and 457 transitions. [2024-11-13 20:38:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 457 transitions. [2024-11-13 20:38:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 20:38:07,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:07,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:38:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 360 states and 468 transitions. [2024-11-13 20:38:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 468 transitions. [2024-11-13 20:38:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 20:38:08,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:38:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 363 states and 472 transitions. [2024-11-13 20:38:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 472 transitions. [2024-11-13 20:38:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 20:38:08,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:08,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 367 states and 477 transitions. [2024-11-13 20:38:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 477 transitions. [2024-11-13 20:38:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:38:09,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:38:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 381 states and 491 transitions. [2024-11-13 20:38:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 491 transitions. [2024-11-13 20:38:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 20:38:10,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:10,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 383 states and 495 transitions. [2024-11-13 20:38:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 495 transitions. [2024-11-13 20:38:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 20:38:10,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:10,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 402 states and 516 transitions. [2024-11-13 20:38:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 516 transitions. [2024-11-13 20:38:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 20:38:11,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:38:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 404 states and 518 transitions. [2024-11-13 20:38:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 518 transitions. [2024-11-13 20:38:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 20:38:11,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:11,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:38:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 418 states and 532 transitions. [2024-11-13 20:38:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 532 transitions. [2024-11-13 20:38:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 20:38:11,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:11,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 426 states and 543 transitions. [2024-11-13 20:38:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 543 transitions. [2024-11-13 20:38:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 20:38:12,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:12,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:38:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 466 states and 585 transitions. [2024-11-13 20:38:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 585 transitions. [2024-11-13 20:38:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 20:38:13,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:13,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:38:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 471 states and 590 transitions. [2024-11-13 20:38:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 590 transitions. [2024-11-13 20:38:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 20:38:13,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:13,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:38:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 476 states and 596 transitions. [2024-11-13 20:38:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 596 transitions. [2024-11-13 20:38:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 20:38:13,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:13,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:38:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 479 states and 600 transitions. [2024-11-13 20:38:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2024-11-13 20:38:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 20:38:14,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:38:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 481 states and 603 transitions. [2024-11-13 20:38:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 603 transitions. [2024-11-13 20:38:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 20:38:15,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 20:38:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 484 states and 606 transitions. [2024-11-13 20:38:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 606 transitions. [2024-11-13 20:38:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:38:15,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:15,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 534 states and 661 transitions. [2024-11-13 20:38:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 661 transitions. [2024-11-13 20:38:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:38:17,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:17,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 536 states and 662 transitions. [2024-11-13 20:38:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 662 transitions. [2024-11-13 20:38:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 20:38:17,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:17,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 20:38:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 539 states and 665 transitions. [2024-11-13 20:38:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 665 transitions. [2024-11-13 20:38:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 20:38:17,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:17,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 559 states and 686 transitions. [2024-11-13 20:38:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 686 transitions. [2024-11-13 20:38:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 20:38:18,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 699 states and 841 transitions. [2024-11-13 20:38:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 841 transitions. [2024-11-13 20:38:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 20:38:20,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:20,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 768 states and 926 transitions. [2024-11-13 20:38:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 926 transitions. [2024-11-13 20:38:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 20:38:22,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:22,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 822 states and 987 transitions. [2024-11-13 20:38:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 987 transitions. [2024-11-13 20:38:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 20:38:25,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 839 states and 1006 transitions. [2024-11-13 20:38:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1006 transitions. [2024-11-13 20:38:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 20:38:27,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 841 states and 1007 transitions. [2024-11-13 20:38:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1007 transitions. [2024-11-13 20:38:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 20:38:27,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 854 states and 1022 transitions. [2024-11-13 20:38:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1022 transitions. [2024-11-13 20:38:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 20:38:28,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 20:38:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 868 states and 1039 transitions. [2024-11-13 20:38:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1039 transitions. [2024-11-13 20:38:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 20:38:28,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:28,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 20:38:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 889 states and 1058 transitions. [2024-11-13 20:38:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1058 transitions. [2024-11-13 20:38:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 20:38:29,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:29,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:38:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 919 states and 1091 transitions. [2024-11-13 20:38:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1091 transitions. [2024-11-13 20:38:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 20:38:30,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:30,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 20:38:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 933 states and 1104 transitions. [2024-11-13 20:38:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1104 transitions. [2024-11-13 20:38:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:38:31,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:31,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 963 states and 1138 transitions. [2024-11-13 20:38:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1138 transitions. [2024-11-13 20:38:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:38:32,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:32,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 20:38:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1009 states and 1191 transitions. [2024-11-13 20:38:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1191 transitions. [2024-11-13 20:38:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:38:33,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 20:38:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1010 states and 1191 transitions. [2024-11-13 20:38:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1191 transitions. [2024-11-13 20:38:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 20:38:33,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1081 states and 1278 transitions. [2024-11-13 20:38:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1278 transitions. [2024-11-13 20:38:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-13 20:38:36,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:36,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 20:38:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1082 states and 1278 transitions. [2024-11-13 20:38:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1278 transitions. [2024-11-13 20:38:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 20:38:36,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:38:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1175 states and 1393 transitions. [2024-11-13 20:38:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1393 transitions. [2024-11-13 20:38:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 20:38:40,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:40,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:38:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1177 states and 1396 transitions. [2024-11-13 20:38:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1396 transitions. [2024-11-13 20:38:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-13 20:38:41,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:41,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 20:38:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1202 states and 1423 transitions. [2024-11-13 20:38:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1423 transitions. [2024-11-13 20:38:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-13 20:38:41,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:41,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:38:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1229 states and 1453 transitions. [2024-11-13 20:38:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1453 transitions. [2024-11-13 20:38:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 20:38:43,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 20:38:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1256 states and 1483 transitions. [2024-11-13 20:38:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1483 transitions. [2024-11-13 20:38:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 20:38:44,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:44,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:38:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1285 states and 1514 transitions. [2024-11-13 20:38:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1514 transitions. [2024-11-13 20:38:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:38:45,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1301 states and 1531 transitions. [2024-11-13 20:38:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1531 transitions. [2024-11-13 20:38:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:38:46,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1306 states and 1535 transitions. [2024-11-13 20:38:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1535 transitions. [2024-11-13 20:38:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 20:38:47,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 20:38:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1338 states and 1568 transitions. [2024-11-13 20:38:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1568 transitions. [2024-11-13 20:38:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 20:38:50,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1352 states and 1586 transitions. [2024-11-13 20:38:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1586 transitions. [2024-11-13 20:38:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:38:51,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:51,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:38:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1380 states and 1617 transitions. [2024-11-13 20:38:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1617 transitions. [2024-11-13 20:38:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:38:53,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:53,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:38:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1393 states and 1628 transitions. [2024-11-13 20:38:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1628 transitions. [2024-11-13 20:38:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:38:54,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:54,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 20:38:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1553 states and 1810 transitions. [2024-11-13 20:38:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1810 transitions. [2024-11-13 20:38:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 20:38:59,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:59,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:39:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1583 states and 1855 transitions. [2024-11-13 20:39:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1855 transitions. [2024-11-13 20:39:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 20:39:01,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:39:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1584 states and 1855 transitions. [2024-11-13 20:39:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1855 transitions. [2024-11-13 20:39:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 20:39:02,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 20:39:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1649 states and 1938 transitions. [2024-11-13 20:39:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1938 transitions. [2024-11-13 20:39:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 20:39:04,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:04,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:39:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1650 states and 1938 transitions. [2024-11-13 20:39:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1938 transitions. [2024-11-13 20:39:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:39:04,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 20:39:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1663 states and 1953 transitions. [2024-11-13 20:39:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1953 transitions. [2024-11-13 20:39:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:39:05,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:39:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 1715 states and 2020 transitions. [2024-11-13 20:39:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2020 transitions. [2024-11-13 20:39:07,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:39:07,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:39:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1789 states and 2101 transitions. [2024-11-13 20:39:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2101 transitions. [2024-11-13 20:39:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:39:11,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 20:39:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 1795 states and 2108 transitions. [2024-11-13 20:39:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2108 transitions. [2024-11-13 20:39:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-13 20:39:12,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 227 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 20:39:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 1804 states and 2121 transitions. [2024-11-13 20:39:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2121 transitions. [2024-11-13 20:39:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 20:39:12,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 20:39:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 1848 states and 2172 transitions. [2024-11-13 20:39:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2172 transitions. [2024-11-13 20:39:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 20:39:14,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 20:39:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1849 states and 2174 transitions. [2024-11-13 20:39:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2174 transitions. [2024-11-13 20:39:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 20:39:15,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:39:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 1862 states and 2188 transitions. [2024-11-13 20:39:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2188 transitions. [2024-11-13 20:39:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:39:16,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 20:39:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 1905 states and 2232 transitions. [2024-11-13 20:39:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2232 transitions. [2024-11-13 20:39:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:39:19,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 20:39:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2003 states and 2338 transitions. [2024-11-13 20:39:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2338 transitions. [2024-11-13 20:39:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 20:39:22,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 145 proven. 72 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 20:39:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2020 states and 2355 transitions. [2024-11-13 20:39:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2355 transitions. [2024-11-13 20:39:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 20:39:23,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:23,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:39:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2033 states and 2370 transitions. [2024-11-13 20:39:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2370 transitions. [2024-11-13 20:39:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 20:39:23,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:23,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:39:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2050 states and 2387 transitions. [2024-11-13 20:39:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2387 transitions. [2024-11-13 20:39:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-13 20:39:24,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-13 20:39:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2063 states and 2401 transitions. [2024-11-13 20:39:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2401 transitions. [2024-11-13 20:39:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 20:39:24,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:24,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 20:39:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2090 states and 2430 transitions. [2024-11-13 20:39:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2430 transitions. [2024-11-13 20:39:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 20:39:26,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:26,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 20:39:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2119 states and 2465 transitions. [2024-11-13 20:39:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2465 transitions. [2024-11-13 20:39:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 20:39:28,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 20:39:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2121 states and 2474 transitions. [2024-11-13 20:39:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2474 transitions. [2024-11-13 20:39:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 20:39:30,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 20:39:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2149 states and 2503 transitions. [2024-11-13 20:39:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2503 transitions. [2024-11-13 20:39:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 20:39:31,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:31,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 20:39:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2151 states and 2519 transitions. [2024-11-13 20:39:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2519 transitions. [2024-11-13 20:39:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 20:39:32,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:32,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 20:39:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2179 states and 2547 transitions. [2024-11-13 20:39:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2547 transitions. [2024-11-13 20:39:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 20:39:34,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:34,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 20:39:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2181 states and 2554 transitions. [2024-11-13 20:39:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2554 transitions. [2024-11-13 20:39:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 20:39:35,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:35,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 20:39:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2209 states and 2581 transitions. [2024-11-13 20:39:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2581 transitions. [2024-11-13 20:39:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 20:39:36,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:36,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 178 proven. 155 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:39:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2295 states and 2683 transitions. [2024-11-13 20:39:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2683 transitions. [2024-11-13 20:39:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 20:39:41,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:41,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 20:39:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2323 states and 2714 transitions. [2024-11-13 20:39:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2714 transitions. [2024-11-13 20:39:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 20:39:43,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:43,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 20:39:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:44,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2349 states and 2741 transitions. [2024-11-13 20:39:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 2741 transitions. [2024-11-13 20:39:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-13 20:39:44,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 20:39:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2358 states and 2749 transitions. [2024-11-13 20:39:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2749 transitions. [2024-11-13 20:39:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-13 20:39:45,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 160 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 20:39:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2466 states and 2875 transitions. [2024-11-13 20:39:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 2875 transitions. [2024-11-13 20:39:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:39:48,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:39:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2503 states and 2923 transitions. [2024-11-13 20:39:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2923 transitions. [2024-11-13 20:39:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:39:52,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:52,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:39:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2518 states and 2940 transitions. [2024-11-13 20:39:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 2940 transitions. [2024-11-13 20:39:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:39:53,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:39:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2543 states and 2972 transitions. [2024-11-13 20:39:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 2972 transitions. [2024-11-13 20:39:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:39:55,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:55,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:39:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2552 states and 2983 transitions. [2024-11-13 20:39:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 2983 transitions. [2024-11-13 20:39:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:39:56,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:56,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:39:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2561 states and 2995 transitions. [2024-11-13 20:39:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 2995 transitions. [2024-11-13 20:39:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:39:56,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:56,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 20:39:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:58,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 2563 states and 3001 transitions. [2024-11-13 20:39:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3001 transitions. [2024-11-13 20:39:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:39:58,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:58,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 20:39:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 2568 states and 3007 transitions. [2024-11-13 20:39:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3007 transitions. [2024-11-13 20:39:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:39:59,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:59,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 20:40:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 2584 states and 3026 transitions. [2024-11-13 20:40:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3026 transitions. [2024-11-13 20:40:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:40:01,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:01,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 20:40:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 2585 states and 3028 transitions. [2024-11-13 20:40:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3028 transitions. [2024-11-13 20:40:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:40:02,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 20:40:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 2636 states and 3087 transitions. [2024-11-13 20:40:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3087 transitions. [2024-11-13 20:40:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:40:04,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:04,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 20:40:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 2672 states and 3125 transitions. [2024-11-13 20:40:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3125 transitions. [2024-11-13 20:40:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:40:06,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:06,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:40:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 2725 states and 3199 transitions. [2024-11-13 20:40:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 3199 transitions. [2024-11-13 20:40:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:40:11,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:11,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:40:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 2726 states and 3200 transitions. [2024-11-13 20:40:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3200 transitions. [2024-11-13 20:40:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:40:12,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:40:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 2752 states and 3229 transitions. [2024-11-13 20:40:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3229 transitions. [2024-11-13 20:40:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:40:13,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:40:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 2761 states and 3238 transitions. [2024-11-13 20:40:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3238 transitions. [2024-11-13 20:40:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:40:14,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:40:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 2777 states and 3254 transitions. [2024-11-13 20:40:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3254 transitions. [2024-11-13 20:40:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:40:15,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:40:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 2793 states and 3270 transitions. [2024-11-13 20:40:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 3270 transitions. [2024-11-13 20:40:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:40:16,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:16,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:40:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 2794 states and 3270 transitions. [2024-11-13 20:40:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3270 transitions. [2024-11-13 20:40:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:40:16,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:16,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 20:40:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 2812 states and 3292 transitions. [2024-11-13 20:40:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3292 transitions. [2024-11-13 20:40:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:40:18,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 20:40:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 2826 states and 3305 transitions. [2024-11-13 20:40:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3305 transitions. [2024-11-13 20:40:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:40:19,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 20:40:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 2836 states and 3317 transitions. [2024-11-13 20:40:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3317 transitions. [2024-11-13 20:40:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 20:40:21,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:40:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 2866 states and 3353 transitions. [2024-11-13 20:40:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 3353 transitions. [2024-11-13 20:40:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 20:40:23,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:40:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 2893 states and 3381 transitions. [2024-11-13 20:40:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 3381 transitions. [2024-11-13 20:40:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 20:40:25,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 20:40:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 2904 states and 3393 transitions. [2024-11-13 20:40:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3393 transitions. [2024-11-13 20:40:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 20:40:26,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:40:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 2936 states and 3433 transitions. [2024-11-13 20:40:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 3433 transitions. [2024-11-13 20:40:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 20:40:30,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:40:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 2994 states and 3499 transitions. [2024-11-13 20:40:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 3499 transitions. [2024-11-13 20:40:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 20:40:33,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-13 20:40:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3000 states and 3506 transitions. [2024-11-13 20:40:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 3506 transitions. [2024-11-13 20:40:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 20:40:34,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:40:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3039 states and 3546 transitions. [2024-11-13 20:40:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 3546 transitions. [2024-11-13 20:40:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 20:40:38,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-13 20:40:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3075 states and 3586 transitions. [2024-11-13 20:40:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 3586 transitions. [2024-11-13 20:40:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 20:40:40,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-13 20:40:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3602 states to 3091 states and 3602 transitions. [2024-11-13 20:40:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 3602 transitions. [2024-11-13 20:40:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-13 20:40:41,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:41,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-13 20:40:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3107 states and 3618 transitions. [2024-11-13 20:40:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 3618 transitions. [2024-11-13 20:40:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-13 20:40:42,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-13 20:40:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3125 states and 3637 transitions. [2024-11-13 20:40:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 3637 transitions. [2024-11-13 20:40:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-13 20:40:43,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:43,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-13 20:40:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3136 states and 3648 transitions. [2024-11-13 20:40:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 3648 transitions. [2024-11-13 20:40:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 20:40:44,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:44,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:40:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3166 states and 3678 transitions. [2024-11-13 20:40:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 3678 transitions. [2024-11-13 20:40:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-13 20:40:46,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:46,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 20:40:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3178 states and 3690 transitions. [2024-11-13 20:40:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 3690 transitions. [2024-11-13 20:40:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 20:40:47,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-13 20:40:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3192 states and 3706 transitions. [2024-11-13 20:40:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 3706 transitions. [2024-11-13 20:40:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 20:40:49,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:40:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3729 states to 3213 states and 3729 transitions. [2024-11-13 20:40:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 3729 transitions. [2024-11-13 20:40:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:40:50,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-13 20:40:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3748 states to 3233 states and 3748 transitions. [2024-11-13 20:40:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 3748 transitions. [2024-11-13 20:40:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:40:52,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:52,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:40:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3236 states and 3752 transitions. [2024-11-13 20:40:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 3752 transitions. [2024-11-13 20:40:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:40:53,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 20:41:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3366 states and 3901 transitions. [2024-11-13 20:41:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 3901 transitions. [2024-11-13 20:41:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-13 20:41:01,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:01,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 20:41:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3432 states and 3976 transitions. [2024-11-13 20:41:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 3976 transitions. [2024-11-13 20:41:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-13 20:41:04,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:04,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-13 20:41:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 3550 states and 4107 transitions. [2024-11-13 20:41:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4107 transitions. [2024-11-13 20:41:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 20:41:10,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:10,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:41:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 3600 states and 4171 transitions. [2024-11-13 20:41:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4171 transitions. [2024-11-13 20:41:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 20:41:17,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:17,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:41:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4181 states to 3609 states and 4181 transitions. [2024-11-13 20:41:18,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 4181 transitions. [2024-11-13 20:41:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 20:41:18,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:41:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 3618 states and 4191 transitions. [2024-11-13 20:41:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4191 transitions. [2024-11-13 20:41:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 20:41:19,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 200 proven. 180 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:41:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4308 states to 3728 states and 4308 transitions. [2024-11-13 20:41:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3728 states and 4308 transitions. [2024-11-13 20:41:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-13 20:41:26,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 369 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-13 20:41:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 3746 states and 4330 transitions. [2024-11-13 20:41:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 4330 transitions. [2024-11-13 20:41:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-13 20:41:30,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:30,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:41:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 3780 states and 4382 transitions. [2024-11-13 20:41:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 4382 transitions. [2024-11-13 20:41:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-13 20:41:36,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 368 proven. 105 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 20:41:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 3785 states and 4391 transitions. [2024-11-13 20:41:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 4391 transitions. [2024-11-13 20:41:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 20:41:38,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:38,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 20:41:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 3794 states and 4404 transitions. [2024-11-13 20:41:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 4404 transitions. [2024-11-13 20:41:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 20:41:41,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:41,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:41:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 3850 states and 4473 transitions. [2024-11-13 20:41:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 4473 transitions. [2024-11-13 20:41:52,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 20:41:52,862 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 151 iterations. [2024-11-13 20:41:52,870 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 20:42:41,538 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,539 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,540 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,540 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,541 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,541 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,541 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,542 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,542 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,542 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,542 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,543 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,543 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,543 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,543 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,543 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,544 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,544 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,544 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,544 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,544 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,545 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,545 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,545 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,545 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,546 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,546 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,546 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,546 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,547 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,547 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,547 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,547 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,548 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,548 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,548 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,548 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,549 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,549 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,549 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,550 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,550 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,550 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,550 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,550 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,551 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,551 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 20:42:41,551 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,551 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 20:42:41,551 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,552 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,552 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,552 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,552 INFO L77 FloydHoareUtils]: At program point L524-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-11-13 20:42:41,552 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,553 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,553 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,553 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 20:42:41,553 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,553 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,554 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,554 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,554 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,554 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,555 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,555 INFO L77 FloydHoareUtils]: At program point L527-1(lines 40 585) the Hoare annotation is: (not (let ((.cse1 (= 5 ~a16~0)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a20~0 ~a7~0))) (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= 14 ~a8~0) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse5 (= ~a17~0 ~a7~0)))))) [2024-11-13 20:42:41,555 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,555 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,555 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 528) no Hoare annotation was computed. [2024-11-13 20:42:41,556 INFO L75 FloydHoareUtils]: For program point L528(line 528) no Hoare annotation was computed. [2024-11-13 20:42:41,556 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,556 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,556 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,556 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,557 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-13 20:42:41,557 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (< 5 ~a16~0) .cse5) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5) (and .cse8 .cse5)))) [2024-11-13 20:42:41,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:42:41 ImpRootNode [2024-11-13 20:42:41,573 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:42:41,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:42:41,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:42:41,574 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:42:41,575 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:37:52" (3/4) ... [2024-11-13 20:42:41,577 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 20:42:41,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-13 20:42:41,597 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 20:42:41,598 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 20:42:41,599 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 20:42:41,729 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:42:41,729 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 20:42:41,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:42:41,730 INFO L158 Benchmark]: Toolchain (without parser) took 292339.98ms. Allocated memory was 142.6MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 117.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-13 20:42:41,730 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:42:41,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.97ms. Allocated memory is still 142.6MB. Free memory was 117.1MB in the beginning and 90.3MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 20:42:41,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.99ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 85.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:42:41,731 INFO L158 Benchmark]: Boogie Preprocessor took 86.12ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 80.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:42:41,732 INFO L158 Benchmark]: RCFGBuilder took 2357.33ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 80.9MB in the beginning and 350.3MB in the end (delta: -269.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-13 20:42:41,732 INFO L158 Benchmark]: CodeCheck took 289072.24ms. Allocated memory was 427.8MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 349.5MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-13 20:42:41,732 INFO L158 Benchmark]: Witness Printer took 155.07ms. Allocated memory is still 3.3GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:42:41,734 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 240.3s, OverallIterations: 151, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543123 SdHoareTripleChecker+Valid, 1520.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 540719 mSDsluCounter, 71433 SdHoareTripleChecker+Invalid, 1301.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60871 mSDsCounter, 94504 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1140298 IncrementalHoareTripleChecker+Invalid, 1234802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94504 mSolverCounterUnsat, 10562 mSDtfsCounter, 1140298 mSolverCounterSat, 13.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193250 GetRequests, 184524 SyntacticMatches, 7360 SemanticMatches, 1366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222595 ImplicationChecksByTransitivity, 168.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 38.4s InterpolantComputationTime, 28844 NumberOfCodeBlocks, 28844 NumberOfCodeBlocksAsserted, 150 NumberOfCheckSat, 28694 ConstructedInterpolants, 0 QuantifiedInterpolants, 151329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 150 InterpolantComputations, 75 PerfectInterpolantSequences, 28118/33795 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: 528]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.97ms. Allocated memory is still 142.6MB. Free memory was 117.1MB in the beginning and 90.3MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.99ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 85.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.12ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 80.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2357.33ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 80.9MB in the beginning and 350.3MB in the end (delta: -269.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * CodeCheck took 289072.24ms. Allocated memory was 427.8MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 349.5MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 155.07ms. Allocated memory is still 3.3GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 20:42:41,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c937617-c08d-4ca0-bf48-077bb906aa3f/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE