./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label19.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_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/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_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label19.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/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_3b31a0b7-ede4-4736-a854-b12df853f02f/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 e9fc1c4ac9b5c9b782fe33ece5b0fcbdb6337af474d3fecce508816632ae710b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:17:22,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:17:22,620 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:17:22,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:17:22,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:17:22,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:17:22,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:17:22,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:17:22,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:17:22,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:17:22,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:17:22,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:17:22,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:17:22,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:17:22,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:17:22,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:17:22,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:17:22,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:17:22,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:17:22,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:17:22,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:17:22,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:17:22,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:17:22,673 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:17:22,673 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:17:22,674 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:17:22,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:17:22,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:17:22,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:17:22,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:17:22,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:17:22,674 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:17:22,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:17:22,674 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_3b31a0b7-ede4-4736-a854-b12df853f02f/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 -> e9fc1c4ac9b5c9b782fe33ece5b0fcbdb6337af474d3fecce508816632ae710b [2024-11-13 20:17:23,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:17:23,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:17:23,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:17:23,076 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:17:23,076 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:17:23,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label19.c Unable to find full path for "g++" [2024-11-13 20:17:25,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:17:25,403 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:17:25,403 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/sv-benchmarks/c/eca-rers2012/Problem01_label19.c [2024-11-13 20:17:25,426 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/data/3d6262057/733b4405a50d4d9a944ef969c287ced3/FLAG55f5ce57f [2024-11-13 20:17:25,457 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/data/3d6262057/733b4405a50d4d9a944ef969c287ced3 [2024-11-13 20:17:25,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:17:25,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:17:25,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:17:25,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:17:25,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:17:25,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:17:25" (1/1) ... [2024-11-13 20:17:25,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@444c6d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:25, skipping insertion in model container [2024-11-13 20:17:25,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:17:25" (1/1) ... [2024-11-13 20:17:25,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:17:25,920 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_3b31a0b7-ede4-4736-a854-b12df853f02f/sv-benchmarks/c/eca-rers2012/Problem01_label19.c[16251,16264] [2024-11-13 20:17:25,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:17:25,988 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:17:26,110 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_3b31a0b7-ede4-4736-a854-b12df853f02f/sv-benchmarks/c/eca-rers2012/Problem01_label19.c[16251,16264] [2024-11-13 20:17:26,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:17:26,161 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:17:26,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:26 WrapperNode [2024-11-13 20:17:26,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:17:26,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:17:26,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:17:26,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:17:26,170 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:17:26" (1/1) ... [2024-11-13 20:17:26,191 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:17:26" (1/1) ... [2024-11-13 20:17:26,243 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 20:17:26,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:17:26,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:17:26,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:17:26,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:17:26,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:26" (1/1) ... [2024-11-13 20:17:26,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:26" (1/1) ... [2024-11-13 20:17:26,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:26" (1/1) ... [2024-11-13 20:17:26,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:26" (1/1) ... [2024-11-13 20:17:26,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:26" (1/1) ... [2024-11-13 20:17:26,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:26" (1/1) ... [2024-11-13 20:17:26,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:26" (1/1) ... [2024-11-13 20:17:26,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:26" (1/1) ... [2024-11-13 20:17:26,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:17:26,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:17:26,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:17:26,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:17:26,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:26" (1/1) ... [2024-11-13 20:17:26,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:17:26,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:17:26,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/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:17:26,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/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:17:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:17:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:17:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:17:26,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:17:26,488 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:17:26,491 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:17:27,858 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 20:17:27,860 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:17:28,167 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:17:28,167 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:17:28,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:17:28 BoogieIcfgContainer [2024-11-13 20:17:28,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:17:28,169 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:17:28,169 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:17:28,182 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:17:28,182 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:17:28" (1/1) ... [2024-11-13 20:17:28,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:17:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 20:17:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 20:17:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 20:17:28,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:28,916 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:17:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-11-13 20:17:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-13 20:17:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:17:29,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:29,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:30,074 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:17:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-11-13 20:17:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-11-13 20:17:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 20:17:30,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:30,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:30,658 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:17:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-11-13 20:17:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-11-13 20:17:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 20:17:30,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:31,052 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:17:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 221 states and 299 transitions. [2024-11-13 20:17:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2024-11-13 20:17:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 20:17:31,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:32,048 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:17:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 233 states and 314 transitions. [2024-11-13 20:17:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 314 transitions. [2024-11-13 20:17:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 20:17:32,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:32,771 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:17:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-11-13 20:17:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-11-13 20:17:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 20:17:33,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:33,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:17:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 262 states and 350 transitions. [2024-11-13 20:17:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 350 transitions. [2024-11-13 20:17:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:17:34,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:34,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:17:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-11-13 20:17:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-11-13 20:17:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 20:17:34,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:17:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 276 states and 372 transitions. [2024-11-13 20:17:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 372 transitions. [2024-11-13 20:17:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:17:35,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:17:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 285 states and 383 transitions. [2024-11-13 20:17:35,759 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 383 transitions. [2024-11-13 20:17:35,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 20:17:35,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:35,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:35,976 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:17:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 302 states and 402 transitions. [2024-11-13 20:17:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 402 transitions. [2024-11-13 20:17:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:17:36,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:36,821 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:17:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 317 states and 421 transitions. [2024-11-13 20:17:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 421 transitions. [2024-11-13 20:17:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:17:37,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:37,833 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:17:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 324 states and 427 transitions. [2024-11-13 20:17:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 427 transitions. [2024-11-13 20:17:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 20:17:38,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:38,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:38,386 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:17:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 347 states and 452 transitions. [2024-11-13 20:17:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 452 transitions. [2024-11-13 20:17:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 20:17:39,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:17:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 348 states and 454 transitions. [2024-11-13 20:17:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 454 transitions. [2024-11-13 20:17:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:17:39,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:39,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:17:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 364 states and 474 transitions. [2024-11-13 20:17:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 474 transitions. [2024-11-13 20:17:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 20:17:40,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:17:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 394 states and 508 transitions. [2024-11-13 20:17:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 508 transitions. [2024-11-13 20:17:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 20:17:41,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:17:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 408 states and 522 transitions. [2024-11-13 20:17:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 522 transitions. [2024-11-13 20:17:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 20:17:41,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:41,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:17:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 411 states and 526 transitions. [2024-11-13 20:17:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 526 transitions. [2024-11-13 20:17:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:17:41,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 424 states and 541 transitions. [2024-11-13 20:17:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 541 transitions. [2024-11-13 20:17:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:17:43,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:43,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 447 states and 565 transitions. [2024-11-13 20:17:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 565 transitions. [2024-11-13 20:17:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 20:17:43,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:17:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 457 states and 577 transitions. [2024-11-13 20:17:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 577 transitions. [2024-11-13 20:17:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 20:17:43,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:17:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 458 states and 578 transitions. [2024-11-13 20:17:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 578 transitions. [2024-11-13 20:17:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 20:17:43,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:44,180 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:17:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 466 states and 588 transitions. [2024-11-13 20:17:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 588 transitions. [2024-11-13 20:17:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 20:17:44,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:45,175 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:17:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 471 states and 593 transitions. [2024-11-13 20:17:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 593 transitions. [2024-11-13 20:17:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 20:17:45,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:45,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:17:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 485 states and 609 transitions. [2024-11-13 20:17:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 609 transitions. [2024-11-13 20:17:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 20:17:45,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:45,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:17:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 504 states and 629 transitions. [2024-11-13 20:17:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2024-11-13 20:17:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 20:17:46,022 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:46,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:46,298 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:17:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 554 states and 684 transitions. [2024-11-13 20:17:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 684 transitions. [2024-11-13 20:17:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 20:17:48,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:48,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:17:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 616 states and 778 transitions. [2024-11-13 20:17:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 778 transitions. [2024-11-13 20:17:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 20:17:51,116 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:17:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 622 states and 785 transitions. [2024-11-13 20:17:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 785 transitions. [2024-11-13 20:17:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 20:17:51,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:51,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:17:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 638 states and 800 transitions. [2024-11-13 20:17:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 800 transitions. [2024-11-13 20:17:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 20:17:51,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:52,025 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:17:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 655 states and 818 transitions. [2024-11-13 20:17:52,477 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 818 transitions. [2024-11-13 20:17:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:17:52,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:52,802 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:17:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 705 states and 872 transitions. [2024-11-13 20:17:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 872 transitions. [2024-11-13 20:17:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:17:53,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:17:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 713 states and 883 transitions. [2024-11-13 20:17:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 883 transitions. [2024-11-13 20:17:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 20:17:54,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:54,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:17:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 748 states and 920 transitions. [2024-11-13 20:17:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 920 transitions. [2024-11-13 20:17:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 20:17:55,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 20:17:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 751 states and 923 transitions. [2024-11-13 20:17:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 923 transitions. [2024-11-13 20:17:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 20:17:55,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:55,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:17:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 759 states and 933 transitions. [2024-11-13 20:17:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 933 transitions. [2024-11-13 20:17:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 20:17:55,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:55,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:56,097 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:17:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 779 states and 954 transitions. [2024-11-13 20:17:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 954 transitions. [2024-11-13 20:17:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 20:17:56,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:17:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 784 states and 960 transitions. [2024-11-13 20:17:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 960 transitions. [2024-11-13 20:17:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 20:17:56,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:56,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:56,891 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:17:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 854 states and 1037 transitions. [2024-11-13 20:17:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1037 transitions. [2024-11-13 20:17:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 20:17:58,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:59,375 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:18:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 911 states and 1110 transitions. [2024-11-13 20:18:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1110 transitions. [2024-11-13 20:18:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 20:18:01,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:01,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 932 states and 1135 transitions. [2024-11-13 20:18:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1135 transitions. [2024-11-13 20:18:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 20:18:02,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:02,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:02,599 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:18:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 986 states and 1199 transitions. [2024-11-13 20:18:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1199 transitions. [2024-11-13 20:18:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 20:18:06,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1055 states and 1273 transitions. [2024-11-13 20:18:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1273 transitions. [2024-11-13 20:18:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 20:18:07,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:09,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1126 states and 1344 transitions. [2024-11-13 20:18:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1344 transitions. [2024-11-13 20:18:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 20:18:09,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:10,130 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:18:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1143 states and 1361 transitions. [2024-11-13 20:18:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1361 transitions. [2024-11-13 20:18:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 20:18:11,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:11,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:11,523 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:18:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1151 states and 1372 transitions. [2024-11-13 20:18:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1372 transitions. [2024-11-13 20:18:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 20:18:12,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:12,636 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:18:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1156 states and 1377 transitions. [2024-11-13 20:18:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1377 transitions. [2024-11-13 20:18:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 20:18:12,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:12,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 20:18:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1178 states and 1406 transitions. [2024-11-13 20:18:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1406 transitions. [2024-11-13 20:18:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-13 20:18:14,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 20:18:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1179 states and 1409 transitions. [2024-11-13 20:18:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1409 transitions. [2024-11-13 20:18:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-13 20:18:14,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:14,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 20:18:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1182 states and 1414 transitions. [2024-11-13 20:18:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1414 transitions. [2024-11-13 20:18:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 20:18:15,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:15,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:15,321 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:18:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1216 states and 1450 transitions. [2024-11-13 20:18:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1450 transitions. [2024-11-13 20:18:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 20:18:16,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:18:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1252 states and 1489 transitions. [2024-11-13 20:18:19,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1489 transitions. [2024-11-13 20:18:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 20:18:19,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:19,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:19,946 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:18:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1254 states and 1490 transitions. [2024-11-13 20:18:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1490 transitions. [2024-11-13 20:18:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 20:18:20,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:20,625 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:18:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1255 states and 1491 transitions. [2024-11-13 20:18:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1491 transitions. [2024-11-13 20:18:21,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 20:18:21,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:21,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:21,357 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:18:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1285 states and 1526 transitions. [2024-11-13 20:18:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1526 transitions. [2024-11-13 20:18:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:18:23,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:23,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:23,885 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:18:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1315 states and 1563 transitions. [2024-11-13 20:18:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1563 transitions. [2024-11-13 20:18:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:18:25,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:25,367 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:18:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1349 states and 1601 transitions. [2024-11-13 20:18:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1601 transitions. [2024-11-13 20:18:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 20:18:25,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:25,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:26,423 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:18:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1420 states and 1690 transitions. [2024-11-13 20:18:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1690 transitions. [2024-11-13 20:18:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 20:18:29,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:29,916 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:18:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1422 states and 1691 transitions. [2024-11-13 20:18:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1691 transitions. [2024-11-13 20:18:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 20:18:30,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:30,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:31,084 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:18:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1488 states and 1773 transitions. [2024-11-13 20:18:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1773 transitions. [2024-11-13 20:18:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 20:18:34,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:34,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:34,425 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:18:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1518 states and 1803 transitions. [2024-11-13 20:18:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1803 transitions. [2024-11-13 20:18:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-13 20:18:36,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:36,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:36,758 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:18:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1543 states and 1834 transitions. [2024-11-13 20:18:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1834 transitions. [2024-11-13 20:18:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-13 20:18:37,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:37,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:37,929 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:18:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1557 states and 1849 transitions. [2024-11-13 20:18:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1849 transitions. [2024-11-13 20:18:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-13 20:18:38,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:38,579 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:18:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1597 states and 1899 transitions. [2024-11-13 20:18:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 1899 transitions. [2024-11-13 20:18:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-13 20:18:40,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:40,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:40,569 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:18:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1606 states and 1909 transitions. [2024-11-13 20:18:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1909 transitions. [2024-11-13 20:18:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 20:18:41,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:41,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:41,084 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:18:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1622 states and 1926 transitions. [2024-11-13 20:18:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1926 transitions. [2024-11-13 20:18:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 20:18:41,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:41,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:41,747 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:18:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1631 states and 1935 transitions. [2024-11-13 20:18:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1935 transitions. [2024-11-13 20:18:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 20:18:42,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:42,635 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:18:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1647 states and 1953 transitions. [2024-11-13 20:18:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 1953 transitions. [2024-11-13 20:18:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:18:43,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:43,795 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:18:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1663 states and 1971 transitions. [2024-11-13 20:18:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1971 transitions. [2024-11-13 20:18:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:18:45,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:46,198 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:18:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1668 states and 1975 transitions. [2024-11-13 20:18:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1975 transitions. [2024-11-13 20:18:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 20:18:46,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:47,498 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:18:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 1700 states and 2008 transitions. [2024-11-13 20:18:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2008 transitions. [2024-11-13 20:18:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 20:18:50,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:50,959 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:18:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 1713 states and 2025 transitions. [2024-11-13 20:18:51,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2025 transitions. [2024-11-13 20:18:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 20:18:51,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:51,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 20:18:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 1726 states and 2039 transitions. [2024-11-13 20:18:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2039 transitions. [2024-11-13 20:18:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 20:18:52,005 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:52,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 20:18:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 1728 states and 2042 transitions. [2024-11-13 20:18:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2042 transitions. [2024-11-13 20:18:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:18:52,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:52,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:18:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 1766 states and 2089 transitions. [2024-11-13 20:18:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2089 transitions. [2024-11-13 20:18:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:18:54,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:18:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 1772 states and 2095 transitions. [2024-11-13 20:18:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2095 transitions. [2024-11-13 20:18:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:18:55,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:55,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 152 proven. 65 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:18:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1813 states and 2149 transitions. [2024-11-13 20:18:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2149 transitions. [2024-11-13 20:18:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:18:59,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:59,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 152 proven. 65 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:19:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 1840 states and 2178 transitions. [2024-11-13 20:19:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2178 transitions. [2024-11-13 20:19:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:19:01,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:01,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 152 proven. 65 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:19:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 1843 states and 2180 transitions. [2024-11-13 20:19:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2180 transitions. [2024-11-13 20:19:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:19:02,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:02,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:03,556 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:19:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2003 states and 2361 transitions. [2024-11-13 20:19:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2361 transitions. [2024-11-13 20:19:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 20:19:08,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:08,719 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:19:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2033 states and 2400 transitions. [2024-11-13 20:19:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2400 transitions. [2024-11-13 20:19:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 20:19:11,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:11,288 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:19:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2034 states and 2400 transitions. [2024-11-13 20:19:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2400 transitions. [2024-11-13 20:19:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 20:19:11,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:11,946 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:19:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2046 states and 2414 transitions. [2024-11-13 20:19:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2414 transitions. [2024-11-13 20:19:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 20:19:13,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2090 states and 2468 transitions. [2024-11-13 20:19:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2468 transitions. [2024-11-13 20:19:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:19:17,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:17,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:17,376 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:19:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2120 states and 2509 transitions. [2024-11-13 20:19:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2509 transitions. [2024-11-13 20:19:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:19:19,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:20,097 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:19:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2121 states and 2509 transitions. [2024-11-13 20:19:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2509 transitions. [2024-11-13 20:19:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:19:20,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:21,397 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:19:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2173 states and 2574 transitions. [2024-11-13 20:19:25,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 2574 transitions. [2024-11-13 20:19:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:19:25,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:25,763 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:19:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2177 states and 2580 transitions. [2024-11-13 20:19:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 2580 transitions. [2024-11-13 20:19:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:19:27,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:27,381 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:19:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2191 states and 2594 transitions. [2024-11-13 20:19:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2594 transitions. [2024-11-13 20:19:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:19:28,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:29,287 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:19:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2256 states and 2675 transitions. [2024-11-13 20:19:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2675 transitions. [2024-11-13 20:19:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:19:33,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:33,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:33,363 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:19:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2262 states and 2682 transitions. [2024-11-13 20:19:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2682 transitions. [2024-11-13 20:19:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 20:19:33,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:33,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:33,687 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:19:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2297 states and 2726 transitions. [2024-11-13 20:19:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 2726 transitions. [2024-11-13 20:19:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 20:19:35,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:35,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:35,973 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:19:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2298 states and 2726 transitions. [2024-11-13 20:19:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2726 transitions. [2024-11-13 20:19:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 20:19:36,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:36,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:36,824 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:19:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2311 states and 2739 transitions. [2024-11-13 20:19:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2739 transitions. [2024-11-13 20:19:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:19:37,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:37,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:37,560 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:19:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2345 states and 2775 transitions. [2024-11-13 20:19:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2775 transitions. [2024-11-13 20:19:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:19:39,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:39,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:40,007 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:19:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2436 states and 2874 transitions. [2024-11-13 20:19:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 2874 transitions. [2024-11-13 20:19:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 20:19:42,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:42,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:43,081 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:19:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2459 states and 2899 transitions. [2024-11-13 20:19:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 2899 transitions. [2024-11-13 20:19:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 20:19:43,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:43,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:43,623 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:19:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2472 states and 2916 transitions. [2024-11-13 20:19:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 2916 transitions. [2024-11-13 20:19:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 20:19:44,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:44,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:44,453 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:19:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2498 states and 2946 transitions. [2024-11-13 20:19:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 2946 transitions. [2024-11-13 20:19:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 20:19:46,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:46,183 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:19:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2512 states and 2959 transitions. [2024-11-13 20:19:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 2959 transitions. [2024-11-13 20:19:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 20:19:46,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:46,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:46,414 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:19:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2513 states and 2960 transitions. [2024-11-13 20:19:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 2960 transitions. [2024-11-13 20:19:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-13 20:19:46,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:46,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:46,583 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:19:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2526 states and 2974 transitions. [2024-11-13 20:19:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 2974 transitions. [2024-11-13 20:19:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-13 20:19:47,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:47,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:47,270 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:19:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2537 states and 2983 transitions. [2024-11-13 20:19:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 2983 transitions. [2024-11-13 20:19:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 20:19:47,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 174 proven. 35 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 20:19:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2549 states and 2996 transitions. [2024-11-13 20:19:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 2996 transitions. [2024-11-13 20:19:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 20:19:49,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:49,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:50,327 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:19:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 2565 states and 3014 transitions. [2024-11-13 20:19:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3014 transitions. [2024-11-13 20:19:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 20:19:51,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:51,748 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:19:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 2584 states and 3043 transitions. [2024-11-13 20:19:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3043 transitions. [2024-11-13 20:19:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 20:19:55,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:55,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:56,170 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:19:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 2613 states and 3072 transitions. [2024-11-13 20:19:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3072 transitions. [2024-11-13 20:19:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 20:19:58,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:58,768 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:19:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 2626 states and 3086 transitions. [2024-11-13 20:19:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 3086 transitions. [2024-11-13 20:19:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 20:19:59,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:59,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:59,635 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:20:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 2643 states and 3118 transitions. [2024-11-13 20:20:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3118 transitions. [2024-11-13 20:20:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 20:20:02,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:02,364 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:20:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 2673 states and 3150 transitions. [2024-11-13 20:20:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 3150 transitions. [2024-11-13 20:20:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 20:20:03,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:03,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:03,765 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:20:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 2674 states and 3150 transitions. [2024-11-13 20:20:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3150 transitions. [2024-11-13 20:20:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 20:20:04,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:04,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:04,502 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:20:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 2687 states and 3164 transitions. [2024-11-13 20:20:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3164 transitions. [2024-11-13 20:20:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 20:20:05,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:05,314 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:20:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 2717 states and 3200 transitions. [2024-11-13 20:20:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3200 transitions. [2024-11-13 20:20:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 20:20:08,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:08,493 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:20:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 2746 states and 3228 transitions. [2024-11-13 20:20:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 3228 transitions. [2024-11-13 20:20:08,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 20:20:08,713 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:08,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 186 proven. 41 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 20:20:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 2752 states and 3235 transitions. [2024-11-13 20:20:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3235 transitions. [2024-11-13 20:20:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 20:20:10,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:10,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:11,398 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:20:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 2787 states and 3278 transitions. [2024-11-13 20:20:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3278 transitions. [2024-11-13 20:20:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 20:20:13,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:13,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:13,893 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:20:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 2803 states and 3296 transitions. [2024-11-13 20:20:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3296 transitions. [2024-11-13 20:20:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-13 20:20:15,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:15,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:15,932 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:20:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 2911 states and 3420 transitions. [2024-11-13 20:20:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 3420 transitions. [2024-11-13 20:20:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:20:20,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:20,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:20,920 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:20:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 2949 states and 3471 transitions. [2024-11-13 20:20:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3471 transitions. [2024-11-13 20:20:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:20:24,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:24,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:24,493 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:20:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 2974 states and 3508 transitions. [2024-11-13 20:20:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 3508 transitions. [2024-11-13 20:20:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:20:26,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:26,809 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:20:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 2983 states and 3518 transitions. [2024-11-13 20:20:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3518 transitions. [2024-11-13 20:20:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:20:27,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:27,930 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:20:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3530 states to 2992 states and 3530 transitions. [2024-11-13 20:20:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 3530 transitions. [2024-11-13 20:20:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:20:28,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:28,966 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:20:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3021 states and 3563 transitions. [2024-11-13 20:20:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3563 transitions. [2024-11-13 20:20:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:20:33,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:33,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:34,033 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:20:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3039 states and 3581 transitions. [2024-11-13 20:20:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 3581 transitions. [2024-11-13 20:20:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:20:35,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:35,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:35,749 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:20:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3064 states and 3613 transitions. [2024-11-13 20:20:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3613 transitions. [2024-11-13 20:20:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:20:38,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:38,310 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:20:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3074 states and 3622 transitions. [2024-11-13 20:20:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 3622 transitions. [2024-11-13 20:20:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:20:39,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:40,055 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:20:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3109 states and 3662 transitions. [2024-11-13 20:20:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 3662 transitions. [2024-11-13 20:20:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:20:43,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:43,289 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:20:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3146 states and 3708 transitions. [2024-11-13 20:20:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 3708 transitions. [2024-11-13 20:20:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:20:47,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:47,375 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:20:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3728 states to 3164 states and 3728 transitions. [2024-11-13 20:20:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 3728 transitions. [2024-11-13 20:20:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:20:49,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:49,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:50,056 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:20:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3729 states to 3166 states and 3729 transitions. [2024-11-13 20:20:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 3729 transitions. [2024-11-13 20:20:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:20:50,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:51,043 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:20:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3730 states to 3167 states and 3730 transitions. [2024-11-13 20:20:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 3730 transitions. [2024-11-13 20:20:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:20:51,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-13 20:21:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3235 states and 3828 transitions. [2024-11-13 20:21:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 3828 transitions. [2024-11-13 20:21:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:21:00,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:00,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-13 20:21:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3280 states and 3882 transitions. [2024-11-13 20:21:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 3882 transitions. [2024-11-13 20:21:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:21:03,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-13 20:21:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3310 states and 3919 transitions. [2024-11-13 20:21:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 3919 transitions. [2024-11-13 20:21:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:21:07,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-13 20:21:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3349 states and 3964 transitions. [2024-11-13 20:21:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 3964 transitions. [2024-11-13 20:21:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:21:10,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-13 20:21:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3365 states and 3983 transitions. [2024-11-13 20:21:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 3983 transitions. [2024-11-13 20:21:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:21:12,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:12,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-13 20:21:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3379 states and 3997 transitions. [2024-11-13 20:21:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 3997 transitions. [2024-11-13 20:21:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:21:13,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:13,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-13 20:21:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 3392 states and 4010 transitions. [2024-11-13 20:21:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4010 transitions. [2024-11-13 20:21:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:21:14,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:14,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-13 20:21:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4023 states to 3405 states and 4023 transitions. [2024-11-13 20:21:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 4023 transitions. [2024-11-13 20:21:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 20:21:15,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:15,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:15,486 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:21:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 3439 states and 4060 transitions. [2024-11-13 20:21:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 4060 transitions. [2024-11-13 20:21:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:21:18,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 20:21:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 3463 states and 4089 transitions. [2024-11-13 20:21:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4089 transitions. [2024-11-13 20:21:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:21:23,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 20:21:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 3477 states and 4108 transitions. [2024-11-13 20:21:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3477 states and 4108 transitions. [2024-11-13 20:21:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:21:24,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:24,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 20:21:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 3491 states and 4123 transitions. [2024-11-13 20:21:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4123 transitions. [2024-11-13 20:21:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:21:25,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:25,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 20:21:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 3493 states and 4124 transitions. [2024-11-13 20:21:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 4124 transitions. [2024-11-13 20:21:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:21:26,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 20:21:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4134 states to 3502 states and 4134 transitions. [2024-11-13 20:21:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 4134 transitions. [2024-11-13 20:21:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:21:27,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 20:21:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4135 states to 3504 states and 4135 transitions. [2024-11-13 20:21:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3504 states and 4135 transitions. [2024-11-13 20:21:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 20:21:28,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:28,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:28,345 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:21:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 3543 states and 4184 transitions. [2024-11-13 20:21:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 4184 transitions. [2024-11-13 20:21:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 20:21:33,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:33,903 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:21:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4204 states to 3562 states and 4204 transitions. [2024-11-13 20:21:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 4204 transitions. [2024-11-13 20:21:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 20:21:35,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:36,520 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:21:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4222 states to 3579 states and 4222 transitions. [2024-11-13 20:21:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 4222 transitions. [2024-11-13 20:21:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 20:21:37,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:37,965 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:21:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 3607 states and 4254 transitions. [2024-11-13 20:21:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 4254 transitions. [2024-11-13 20:21:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 20:21:41,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 172 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:21:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4291 states to 3643 states and 4291 transitions. [2024-11-13 20:21:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4291 transitions. [2024-11-13 20:21:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 20:21:47,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:47,617 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:21:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 3678 states and 4333 transitions. [2024-11-13 20:21:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4333 transitions. [2024-11-13 20:21:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 20:21:51,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:51,766 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:21:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 3704 states and 4360 transitions. [2024-11-13 20:21:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 4360 transitions. [2024-11-13 20:21:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 20:21:53,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:54,255 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:21:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 3718 states and 4375 transitions. [2024-11-13 20:21:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 4375 transitions. [2024-11-13 20:21:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 20:21:55,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:56,148 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:21:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 3724 states and 4381 transitions. [2024-11-13 20:21:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 4381 transitions. [2024-11-13 20:21:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 20:21:57,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:57,165 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:21:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 3740 states and 4398 transitions. [2024-11-13 20:21:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 4398 transitions. [2024-11-13 20:21:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-13 20:21:59,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:59,695 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:22:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:22:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 3756 states and 4415 transitions. [2024-11-13 20:22:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3756 states and 4415 transitions. [2024-11-13 20:22:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 20:22:01,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:22:01,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:22:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:22:02,063 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:22:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:22:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 3766 states and 4425 transitions. [2024-11-13 20:22:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 4425 transitions. [2024-11-13 20:22:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-13 20:22:03,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:22:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:22:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:22:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 109 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 20:22:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:22:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 3778 states and 4437 transitions. [2024-11-13 20:22:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3778 states and 4437 transitions. [2024-11-13 20:22:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 20:22:05,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:22:05,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:22:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:22:05,561 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:22:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:22:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 3820 states and 4488 transitions. [2024-11-13 20:22:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 4488 transitions. [2024-11-13 20:22:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:22:12,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:22:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:22:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:22:12,828 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:22:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:22:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4494 states to 3825 states and 4494 transitions. [2024-11-13 20:22:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 4494 transitions. [2024-11-13 20:22:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:22:14,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:22:14,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:22:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:22:15,030 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:22:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:22:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 3959 states and 4649 transitions. [2024-11-13 20:22:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 4649 transitions. [2024-11-13 20:22:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-13 20:22:24,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:22:24,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:22:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:22:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 188 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:22:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:22:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4014 states and 4715 transitions. [2024-11-13 20:22:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 4715 transitions. [2024-11-13 20:22:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-13 20:22:31,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:22:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:22:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:22:32,438 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:22:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:22:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4132 states and 4850 transitions. [2024-11-13 20:22:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 4850 transitions. [2024-11-13 20:22:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 20:22:39,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:22:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:22:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:22:40,541 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:22:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:22:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4903 states to 4173 states and 4903 transitions. [2024-11-13 20:22:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 4903 transitions. [2024-11-13 20:22:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 20:22:46,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:22:46,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:22:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:22:46,998 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:22:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:22:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4200 states and 4935 transitions. [2024-11-13 20:22:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 4935 transitions. [2024-11-13 20:22:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 20:22:51,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:22:51,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:22:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:22:52,710 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:23:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:23:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5053 states to 4306 states and 5053 transitions. [2024-11-13 20:23:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4306 states and 5053 transitions. [2024-11-13 20:23:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 20:23:02,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:23:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:23:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:23:03,658 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:23:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:23:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 4362 states and 5126 transitions. [2024-11-13 20:23:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 4362 states and 5126 transitions. [2024-11-13 20:23:16,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 20:23:16,039 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 170 iterations. [2024-11-13 20:23:16,046 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 20:24:20,643 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1)) (.cse13 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse11 (= ~a20~0 1))) (let ((.cse4 (= ~a20~0 ~a7~0)) (.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse11)) (.cse6 (not .cse13)) (.cse3 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse15 (= 14 ~a8~0)) (.cse8 (not (= ~a17~0 1))) (.cse10 (not .cse9)) (.cse2 (= ~a21~0 1)) (.cse12 (= ~a16~0 4)) (.cse7 (<= 15 ~a8~0))) (or (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9) (<= ~a8~0 13) (and .cse0 .cse10 .cse2 .cse11 .cse12) (and (not (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12)) .cse13 .cse7) (and .cse14 .cse0 .cse15 .cse1 .cse8 .cse2) (and .cse14 .cse0 .cse8 .cse2 .cse9 .cse12) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse6 .cse3) (and .cse0 .cse15 .cse8 .cse10 .cse2 .cse12) (and .cse11 .cse7)))) [2024-11-13 20:24:20,643 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,643 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,644 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,644 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,644 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse9 (<= 15 ~a8~0)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not (and .cse5 (<= ~a16~0 5))) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 20:24:20,644 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,645 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,645 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,645 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,646 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1)) (.cse13 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse11 (= ~a20~0 1))) (let ((.cse4 (= ~a20~0 ~a7~0)) (.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse11)) (.cse6 (not .cse13)) (.cse3 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse15 (= 14 ~a8~0)) (.cse8 (not (= ~a17~0 1))) (.cse10 (not .cse9)) (.cse2 (= ~a21~0 1)) (.cse12 (= ~a16~0 4)) (.cse7 (<= 15 ~a8~0))) (or (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9) (<= ~a8~0 13) (and .cse0 .cse10 .cse2 .cse11 .cse12) (and (not (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12)) .cse13 .cse7) (and .cse14 .cse0 .cse15 .cse1 .cse8 .cse2) (and .cse14 .cse0 .cse8 .cse2 .cse9 .cse12) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse6 .cse3) (and .cse0 .cse15 .cse8 .cse10 .cse2 .cse12) (and .cse11 .cse7)))) [2024-11-13 20:24:20,647 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,647 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,647 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,647 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,648 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,648 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,648 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,648 INFO L77 FloydHoareUtils]: At program point L440-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (< ~a8~0 15))) [2024-11-13 20:24:20,649 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,649 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,649 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,649 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,649 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,650 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1)) (.cse13 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse11 (= ~a20~0 1))) (let ((.cse4 (= ~a20~0 ~a7~0)) (.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse11)) (.cse6 (not .cse13)) (.cse3 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse15 (= 14 ~a8~0)) (.cse8 (not (= ~a17~0 1))) (.cse10 (not .cse9)) (.cse2 (= ~a21~0 1)) (.cse12 (= ~a16~0 4)) (.cse7 (<= 15 ~a8~0))) (or (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9) (<= ~a8~0 13) (and .cse0 .cse10 .cse2 .cse11 .cse12) (and (not (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12)) .cse13 .cse7) (and .cse14 .cse0 .cse15 .cse1 .cse8 .cse2) (and .cse14 .cse0 .cse8 .cse2 .cse9 .cse12) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse6 .cse3) (and .cse0 .cse15 .cse8 .cse10 .cse2 .cse12) (and .cse11 .cse7)))) [2024-11-13 20:24:20,650 INFO L77 FloydHoareUtils]: At program point L443-1(lines 40 585) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (not (= ~a7~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (= 5 ~a16~0) .cse1 .cse2 (= ~a17~0 1) (= ~a20~0 ~a7~0))) (not (and .cse0 (= ~a16~0 6) .cse1 .cse2 (= ~a20~0 1) (= ~a17~0 ~a7~0))) (< 13 ~a8~0) (< ~a8~0 15)))) [2024-11-13 20:24:20,650 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,650 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,651 INFO L75 FloydHoareUtils]: For program point L444(line 444) no Hoare annotation was computed. [2024-11-13 20:24:20,651 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,651 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse9 (<= 15 ~a8~0)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not (and .cse5 (<= ~a16~0 5))) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 20:24:20,651 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,651 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,652 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,652 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,652 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,652 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,652 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,653 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1)) (.cse13 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse11 (= ~a20~0 1))) (let ((.cse4 (= ~a20~0 ~a7~0)) (.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse11)) (.cse6 (not .cse13)) (.cse3 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse15 (= 14 ~a8~0)) (.cse8 (not (= ~a17~0 1))) (.cse10 (not .cse9)) (.cse2 (= ~a21~0 1)) (.cse12 (= ~a16~0 4)) (.cse7 (<= 15 ~a8~0))) (or (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9) (<= ~a8~0 13) (and .cse0 .cse10 .cse2 .cse11 .cse12) (and (not (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12)) .cse13 .cse7) (and .cse14 .cse0 .cse15 .cse1 .cse8 .cse2) (and .cse14 .cse0 .cse8 .cse2 .cse9 .cse12) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse6 .cse3) (and .cse0 .cse15 .cse8 .cse10 .cse2 .cse12) (and .cse11 .cse7)))) [2024-11-13 20:24:20,653 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,653 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,653 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,653 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1)) (.cse13 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse11 (= ~a20~0 1))) (let ((.cse4 (= ~a20~0 ~a7~0)) (.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse11)) (.cse6 (not .cse13)) (.cse3 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse15 (= 14 ~a8~0)) (.cse8 (not (= ~a17~0 1))) (.cse10 (not .cse9)) (.cse2 (= ~a21~0 1)) (.cse12 (= ~a16~0 4)) (.cse7 (<= 15 ~a8~0))) (or (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9) (<= ~a8~0 13) (and .cse0 .cse10 .cse2 .cse11 .cse12) (and (not (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12)) .cse13 .cse7) (and .cse14 .cse0 .cse15 .cse1 .cse8 .cse2) (and .cse14 .cse0 .cse8 .cse2 .cse9 .cse12) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse6 .cse3) (and .cse0 .cse15 .cse8 .cse10 .cse2 .cse12) (and .cse11 .cse7)))) [2024-11-13 20:24:20,653 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,653 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,654 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,654 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse9 (<= 15 ~a8~0)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not (and .cse5 (<= ~a16~0 5))) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 20:24:20,654 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,654 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,654 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 20:24:20,654 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,654 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 20:24:20,654 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,655 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,655 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,655 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1)) (.cse13 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse11 (= ~a20~0 1))) (let ((.cse4 (= ~a20~0 ~a7~0)) (.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse11)) (.cse6 (not .cse13)) (.cse3 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse15 (= 14 ~a8~0)) (.cse8 (not (= ~a17~0 1))) (.cse10 (not .cse9)) (.cse2 (= ~a21~0 1)) (.cse12 (= ~a16~0 4)) (.cse7 (<= 15 ~a8~0))) (or (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9) (<= ~a8~0 13) (and .cse0 .cse10 .cse2 .cse11 .cse12) (and (not (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12)) .cse13 .cse7) (and .cse14 .cse0 .cse15 .cse1 .cse8 .cse2) (and .cse14 .cse0 .cse8 .cse2 .cse9 .cse12) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse6 .cse3) (and .cse0 .cse15 .cse8 .cse10 .cse2 .cse12) (and .cse11 .cse7)))) [2024-11-13 20:24:20,655 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,655 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,656 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,656 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 20:24:20,656 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,656 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,656 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,656 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,656 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse9 (<= 15 ~a8~0)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not (and .cse5 (<= ~a16~0 5))) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 20:24:20,657 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,657 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,657 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,657 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,657 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 444) no Hoare annotation was computed. [2024-11-13 20:24:20,657 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,657 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse9 (<= 15 ~a8~0)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and (not (and .cse5 (<= ~a16~0 5))) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-13 20:24:20,658 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,658 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,658 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)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-11-13 20:24:20,658 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse13 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse5 (= ~a17~0 ~a7~0)) (.cse1 (= 5 ~a16~0)) (.cse14 (not .cse10)) (.cse12 (= |ULTIMATE.start_calculate_output_~input#1| 5)) (.cse7 (= |ULTIMATE.start_calculate_output_~input#1| 4)) (.cse15 (= 14 ~a8~0)) (.cse2 (not .cse13)) (.cse9 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse0 (= ~a12~0 8)) (.cse11 (= ~a8~0 15)) (.cse8 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (and .cse5 .cse6)) .cse7 .cse8) (<= ~a8~0 13) (and .cse0 .cse9 .cse3 .cse10 .cse6) (and (< ~a16~0 5) .cse11 .cse12) (and (not (and .cse0 .cse3 .cse11 (= ~a20~0 ~a7~0) .cse5)) (not (and .cse3 .cse13)) .cse8) (and (< 5 ~a16~0) .cse8) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse6) (and (not .cse12) (not .cse7) .cse11) (and .cse0 .cse15 .cse2 .cse9 .cse3 .cse6) (and (not (and .cse0 (= ~a7~0 0) .cse11)) .cse13 .cse8) (and .cse10 .cse8)))) [2024-11-13 20:24:20,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:24:20 ImpRootNode [2024-11-13 20:24:20,675 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:24:20,675 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:24:20,675 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:24:20,676 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:24:20,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:17:28" (3/4) ... [2024-11-13 20:24:20,679 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 20:24:20,698 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 118 nodes and edges [2024-11-13 20:24:20,699 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-13 20:24:20,700 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 20:24:20,701 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 20:24:20,844 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:24:20,844 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 20:24:20,845 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:24:20,846 INFO L158 Benchmark]: Toolchain (without parser) took 415384.48ms. Allocated memory was 117.4MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 90.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-13 20:24:20,846 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:24:20,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.47ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 63.9MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 20:24:20,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.13ms. Allocated memory is still 117.4MB. Free memory was 63.7MB in the beginning and 58.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:24:20,848 INFO L158 Benchmark]: Boogie Preprocessor took 64.27ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 54.4MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:24:20,848 INFO L158 Benchmark]: RCFGBuilder took 1854.74ms. Allocated memory is still 117.4MB. Free memory was 54.2MB in the beginning and 72.9MB in the end (delta: -18.8MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-11-13 20:24:20,850 INFO L158 Benchmark]: CodeCheck took 412506.06ms. Allocated memory was 117.4MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 72.9MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-11-13 20:24:20,851 INFO L158 Benchmark]: Witness Printer took 169.24ms. Allocated memory is still 4.0GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:24:20,852 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: 347.8s, OverallIterations: 170, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 738462 SdHoareTripleChecker+Valid, 2011.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 736107 mSDsluCounter, 105883 SdHoareTripleChecker+Invalid, 1726.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90432 mSDsCounter, 126729 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1538798 IncrementalHoareTripleChecker+Invalid, 1665527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126729 mSolverCounterUnsat, 15451 mSDtfsCounter, 1538798 mSolverCounterSat, 18.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 218297 GetRequests, 207177 SyntacticMatches, 9404 SemanticMatches, 1716 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1920108 ImplicationChecksByTransitivity, 269.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 42.7s InterpolantComputationTime, 32526 NumberOfCodeBlocks, 32526 NumberOfCodeBlocksAsserted, 169 NumberOfCheckSat, 32357 ConstructedInterpolants, 0 QuantifiedInterpolants, 182081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 169 InterpolantComputations, 82 PerfectInterpolantSequences, 30310/36293 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: 444]: 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)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && (13 < a8)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (a8 < 15)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && (13 < a8)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (a8 < 15)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.47ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 63.9MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.13ms. Allocated memory is still 117.4MB. Free memory was 63.7MB in the beginning and 58.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.27ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 54.4MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1854.74ms. Allocated memory is still 117.4MB. Free memory was 54.2MB in the beginning and 72.9MB in the end (delta: -18.8MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * CodeCheck took 412506.06ms. Allocated memory was 117.4MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 72.9MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 169.24ms. Allocated memory is still 4.0GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 20:24:20,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b31a0b7-ede4-4736-a854-b12df853f02f/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE