./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label35.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_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/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_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label35.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/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_9d98441e-39c2-4c93-a119-b578324c81e0/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 d3e3930727d0c60d79f1b553922b6ffa9dda0949b70cfe091b5b493dd5b1378e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:43:17,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:43:17,826 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 16:43:17,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:43:17,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 16:43:17,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:43:17,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:43:17,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 16:43:17,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:43:17,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:43:17,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:43:17,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:43:17,856 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:43:17,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:43:17,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:43:17,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:43:17,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:43:17,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:43:17,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:43:17,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:43:17,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:43:17,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:43:17,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:43:17,857 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 16:43:17,857 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 16:43:17,858 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 16:43:17,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:43:17,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 16:43:17,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:43:17,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:43:17,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:43:17,859 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 16:43:17,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:43:17,859 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_9d98441e-39c2-4c93-a119-b578324c81e0/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 -> d3e3930727d0c60d79f1b553922b6ffa9dda0949b70cfe091b5b493dd5b1378e [2024-11-13 16:43:18,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:43:18,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:43:18,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:43:18,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:43:18,180 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:43:18,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem02_label35.c Unable to find full path for "g++" [2024-11-13 16:43:20,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:43:20,670 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:43:20,671 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/sv-benchmarks/c/eca-rers2012/Problem02_label35.c [2024-11-13 16:43:20,698 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/data/4732112a7/7e4a21fa610a4416b33c7bd3c43313c0/FLAGd76af0b7d [2024-11-13 16:43:20,731 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/data/4732112a7/7e4a21fa610a4416b33c7bd3c43313c0 [2024-11-13 16:43:20,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:43:20,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:43:20,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:43:20,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:43:20,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:43:20,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:43:20" (1/1) ... [2024-11-13 16:43:20,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199a0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:20, skipping insertion in model container [2024-11-13 16:43:20,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:43:20" (1/1) ... [2024-11-13 16:43:20,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:43:21,319 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_9d98441e-39c2-4c93-a119-b578324c81e0/sv-benchmarks/c/eca-rers2012/Problem02_label35.c[16104,16117] [2024-11-13 16:43:21,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:43:21,396 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:43:21,547 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_9d98441e-39c2-4c93-a119-b578324c81e0/sv-benchmarks/c/eca-rers2012/Problem02_label35.c[16104,16117] [2024-11-13 16:43:21,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:43:21,613 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:43:21,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21 WrapperNode [2024-11-13 16:43:21,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:43:21,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:43:21,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:43:21,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:43:21,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,696 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-13 16:43:21,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:43:21,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:43:21,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:43:21,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:43:21,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:43:21,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:43:21,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:43:21,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:43:21,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:43:21" (1/1) ... [2024-11-13 16:43:21,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 16:43:21,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 16:43:21,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 16:43:21,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 16:43:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:43:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 16:43:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:43:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:43:21,969 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:43:21,972 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:43:23,468 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-13 16:43:23,468 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:43:23,944 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:43:23,944 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:43:23,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:43:23 BoogieIcfgContainer [2024-11-13 16:43:23,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:43:23,946 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 16:43:23,946 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 16:43:23,964 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 16:43:23,964 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:43:23" (1/1) ... [2024-11-13 16:43:23,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:43:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-13 16:43:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-13 16:43:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 16:43:24,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:24,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:24,692 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 16:43:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 163 states and 240 transitions. [2024-11-13 16:43:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2024-11-13 16:43:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 16:43:25,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:25,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 166 states and 245 transitions. [2024-11-13 16:43:26,171 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-11-13 16:43:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 16:43:26,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 16:43:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 167 states and 248 transitions. [2024-11-13 16:43:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2024-11-13 16:43:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 16:43:26,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 181 states and 269 transitions. [2024-11-13 16:43:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 269 transitions. [2024-11-13 16:43:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 16:43:27,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:27,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 199 states and 291 transitions. [2024-11-13 16:43:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2024-11-13 16:43:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 16:43:27,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 221 states and 321 transitions. [2024-11-13 16:43:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 321 transitions. [2024-11-13 16:43:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 16:43:29,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 16:43:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 231 states and 331 transitions. [2024-11-13 16:43:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 331 transitions. [2024-11-13 16:43:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 16:43:30,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 251 states and 355 transitions. [2024-11-13 16:43:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 355 transitions. [2024-11-13 16:43:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 16:43:31,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 355 states and 475 transitions. [2024-11-13 16:43:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 475 transitions. [2024-11-13 16:43:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 16:43:33,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:33,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:43:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 356 states and 477 transitions. [2024-11-13 16:43:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 477 transitions. [2024-11-13 16:43:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 16:43:34,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:34,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:43:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 363 states and 485 transitions. [2024-11-13 16:43:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 485 transitions. [2024-11-13 16:43:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 16:43:35,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:35,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:43:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 373 states and 494 transitions. [2024-11-13 16:43:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 494 transitions. [2024-11-13 16:43:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:43:35,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:35,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 379 states and 502 transitions. [2024-11-13 16:43:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 502 transitions. [2024-11-13 16:43:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:43:36,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 393 states and 516 transitions. [2024-11-13 16:43:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 516 transitions. [2024-11-13 16:43:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:43:37,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 413 states and 543 transitions. [2024-11-13 16:43:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 543 transitions. [2024-11-13 16:43:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 16:43:38,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 427 states and 563 transitions. [2024-11-13 16:43:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 563 transitions. [2024-11-13 16:43:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:43:39,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 451 states and 603 transitions. [2024-11-13 16:43:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 603 transitions. [2024-11-13 16:43:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:43:42,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:42,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 454 states and 607 transitions. [2024-11-13 16:43:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 607 transitions. [2024-11-13 16:43:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:43:42,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 468 states and 623 transitions. [2024-11-13 16:43:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 623 transitions. [2024-11-13 16:43:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:43:43,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:43,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 469 states and 623 transitions. [2024-11-13 16:43:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 623 transitions. [2024-11-13 16:43:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 16:43:43,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 490 states and 653 transitions. [2024-11-13 16:43:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 653 transitions. [2024-11-13 16:43:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 16:43:45,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 500 states and 662 transitions. [2024-11-13 16:43:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 662 transitions. [2024-11-13 16:43:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 16:43:45,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:45,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 506 states and 671 transitions. [2024-11-13 16:43:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 671 transitions. [2024-11-13 16:43:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:43:46,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 524 states and 697 transitions. [2024-11-13 16:43:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 697 transitions. [2024-11-13 16:43:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:43:48,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 544 states and 722 transitions. [2024-11-13 16:43:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 722 transitions. [2024-11-13 16:43:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:43:49,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 549 states and 727 transitions. [2024-11-13 16:43:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 727 transitions. [2024-11-13 16:43:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:43:50,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:50,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 555 states and 734 transitions. [2024-11-13 16:43:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 734 transitions. [2024-11-13 16:43:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:43:51,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:51,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 573 states and 753 transitions. [2024-11-13 16:43:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 753 transitions. [2024-11-13 16:43:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:43:52,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:52,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 582 states and 762 transitions. [2024-11-13 16:43:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 762 transitions. [2024-11-13 16:43:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:43:53,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 618 states and 809 transitions. [2024-11-13 16:43:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 809 transitions. [2024-11-13 16:43:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:43:56,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:56,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 632 states and 823 transitions. [2024-11-13 16:43:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 823 transitions. [2024-11-13 16:43:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:43:57,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:43:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:43:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 643 states and 834 transitions. [2024-11-13 16:43:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 834 transitions. [2024-11-13 16:43:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:43:59,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:43:59,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:43:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:43:59,323 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 16:44:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 676 states and 874 transitions. [2024-11-13 16:44:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 874 transitions. [2024-11-13 16:44:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 16:44:00,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 16:44:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 689 states and 891 transitions. [2024-11-13 16:44:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 891 transitions. [2024-11-13 16:44:01,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 16:44:01,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:01,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 16:44:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 699 states and 901 transitions. [2024-11-13 16:44:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 901 transitions. [2024-11-13 16:44:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 16:44:02,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 16:44:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 704 states and 905 transitions. [2024-11-13 16:44:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 905 transitions. [2024-11-13 16:44:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 16:44:02,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:02,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 16:44:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 715 states and 921 transitions. [2024-11-13 16:44:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 921 transitions. [2024-11-13 16:44:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 16:44:03,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:03,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 16:44:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 716 states and 922 transitions. [2024-11-13 16:44:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 922 transitions. [2024-11-13 16:44:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 16:44:03,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:44:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 729 states and 938 transitions. [2024-11-13 16:44:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 938 transitions. [2024-11-13 16:44:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 16:44:04,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:44:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 739 states and 949 transitions. [2024-11-13 16:44:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 949 transitions. [2024-11-13 16:44:05,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 16:44:05,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:44:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 744 states and 953 transitions. [2024-11-13 16:44:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 953 transitions. [2024-11-13 16:44:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 16:44:05,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 16:44:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 749 states and 957 transitions. [2024-11-13 16:44:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 957 transitions. [2024-11-13 16:44:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 16:44:05,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:05,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 758 states and 966 transitions. [2024-11-13 16:44:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 966 transitions. [2024-11-13 16:44:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 16:44:06,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:06,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 790 states and 1008 transitions. [2024-11-13 16:44:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1008 transitions. [2024-11-13 16:44:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 16:44:09,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:09,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 795 states and 1012 transitions. [2024-11-13 16:44:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1012 transitions. [2024-11-13 16:44:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 16:44:09,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:09,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:44:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 821 states and 1051 transitions. [2024-11-13 16:44:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1051 transitions. [2024-11-13 16:44:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 16:44:12,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:12,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:44:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 841 states and 1072 transitions. [2024-11-13 16:44:14,244 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1072 transitions. [2024-11-13 16:44:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 16:44:14,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 16:44:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 868 states and 1110 transitions. [2024-11-13 16:44:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1110 transitions. [2024-11-13 16:44:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 16:44:16,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:16,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 16:44:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 883 states and 1126 transitions. [2024-11-13 16:44:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1126 transitions. [2024-11-13 16:44:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 16:44:17,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:17,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 16:44:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 891 states and 1135 transitions. [2024-11-13 16:44:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1135 transitions. [2024-11-13 16:44:18,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 16:44:18,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:44:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 914 states and 1167 transitions. [2024-11-13 16:44:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1167 transitions. [2024-11-13 16:44:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 16:44:21,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:21,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 16:44:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 915 states and 1168 transitions. [2024-11-13 16:44:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1168 transitions. [2024-11-13 16:44:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 16:44:21,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:21,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:44:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 922 states and 1177 transitions. [2024-11-13 16:44:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1177 transitions. [2024-11-13 16:44:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 16:44:22,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:22,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:44:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 932 states and 1187 transitions. [2024-11-13 16:44:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1187 transitions. [2024-11-13 16:44:23,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 16:44:23,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:23,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:44:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 937 states and 1192 transitions. [2024-11-13 16:44:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1192 transitions. [2024-11-13 16:44:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 16:44:23,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 975 states and 1252 transitions. [2024-11-13 16:44:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1252 transitions. [2024-11-13 16:44:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 16:44:24,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 16:44:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 978 states and 1255 transitions. [2024-11-13 16:44:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1255 transitions. [2024-11-13 16:44:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 16:44:25,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1045 states and 1329 transitions. [2024-11-13 16:44:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1329 transitions. [2024-11-13 16:44:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 16:44:31,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 16:44:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1046 states and 1331 transitions. [2024-11-13 16:44:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1331 transitions. [2024-11-13 16:44:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 16:44:31,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1070 states and 1366 transitions. [2024-11-13 16:44:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1366 transitions. [2024-11-13 16:44:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 16:44:35,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:35,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1084 states and 1381 transitions. [2024-11-13 16:44:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1381 transitions. [2024-11-13 16:44:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 16:44:36,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:36,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1085 states and 1381 transitions. [2024-11-13 16:44:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1381 transitions. [2024-11-13 16:44:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 16:44:37,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:37,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1123 states and 1427 transitions. [2024-11-13 16:44:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1427 transitions. [2024-11-13 16:44:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 16:44:40,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:40,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1126 states and 1430 transitions. [2024-11-13 16:44:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1430 transitions. [2024-11-13 16:44:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 16:44:41,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:41,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1171 states and 1484 transitions. [2024-11-13 16:44:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1484 transitions. [2024-11-13 16:44:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 16:44:47,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:47,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1220 states and 1534 transitions. [2024-11-13 16:44:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1534 transitions. [2024-11-13 16:44:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 16:44:52,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1225 states and 1539 transitions. [2024-11-13 16:44:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1539 transitions. [2024-11-13 16:44:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 16:44:53,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:44:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1245 states and 1564 transitions. [2024-11-13 16:44:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1564 transitions. [2024-11-13 16:44:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 16:44:55,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 16:44:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:44:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1261 states and 1587 transitions. [2024-11-13 16:44:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1587 transitions. [2024-11-13 16:44:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 16:44:58,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:44:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:44:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:44:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 16:45:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1268 states and 1595 transitions. [2024-11-13 16:45:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1595 transitions. [2024-11-13 16:45:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 16:45:00,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 16:45:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1274 states and 1600 transitions. [2024-11-13 16:45:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1600 transitions. [2024-11-13 16:45:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 16:45:01,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:45:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1277 states and 1602 transitions. [2024-11-13 16:45:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1602 transitions. [2024-11-13 16:45:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 16:45:02,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:02,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:02,198 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:45:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1287 states and 1616 transitions. [2024-11-13 16:45:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1616 transitions. [2024-11-13 16:45:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 16:45:04,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:45:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1291 states and 1620 transitions. [2024-11-13 16:45:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1620 transitions. [2024-11-13 16:45:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 16:45:05,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:45:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1301 states and 1629 transitions. [2024-11-13 16:45:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1629 transitions. [2024-11-13 16:45:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 16:45:06,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:06,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:45:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1337 states and 1672 transitions. [2024-11-13 16:45:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1672 transitions. [2024-11-13 16:45:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 16:45:10,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:45:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1368 states and 1704 transitions. [2024-11-13 16:45:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1704 transitions. [2024-11-13 16:45:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 16:45:13,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:13,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:14,063 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 16:45:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1399 states and 1740 transitions. [2024-11-13 16:45:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1740 transitions. [2024-11-13 16:45:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 16:45:18,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:18,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:18,903 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 16:45:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1424 states and 1766 transitions. [2024-11-13 16:45:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1766 transitions. [2024-11-13 16:45:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 16:45:20,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 16:45:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1425 states and 1766 transitions. [2024-11-13 16:45:20,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1766 transitions. [2024-11-13 16:45:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 16:45:20,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:20,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:45:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1438 states and 1781 transitions. [2024-11-13 16:45:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1781 transitions. [2024-11-13 16:45:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 16:45:22,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:45:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1443 states and 1785 transitions. [2024-11-13 16:45:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1785 transitions. [2024-11-13 16:45:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:45:23,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-13 16:45:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1554 states and 1910 transitions. [2024-11-13 16:45:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1910 transitions. [2024-11-13 16:45:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 16:45:30,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 16:45:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1564 states and 1922 transitions. [2024-11-13 16:45:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1922 transitions. [2024-11-13 16:45:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 16:45:31,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 16:45:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1569 states and 1926 transitions. [2024-11-13 16:45:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1926 transitions. [2024-11-13 16:45:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 16:45:32,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:45:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 1697 states and 2079 transitions. [2024-11-13 16:45:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2079 transitions. [2024-11-13 16:45:40,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 16:45:40,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:40,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:45:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 1702 states and 2083 transitions. [2024-11-13 16:45:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2083 transitions. [2024-11-13 16:45:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-13 16:45:41,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:41,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-13 16:45:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 1715 states and 2098 transitions. [2024-11-13 16:45:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2098 transitions. [2024-11-13 16:45:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-13 16:45:43,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:43,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-13 16:45:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 1725 states and 2108 transitions. [2024-11-13 16:45:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2108 transitions. [2024-11-13 16:45:44,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-13 16:45:44,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-13 16:45:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 1730 states and 2112 transitions. [2024-11-13 16:45:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2112 transitions. [2024-11-13 16:45:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 16:45:45,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:45,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-13 16:45:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 1759 states and 2150 transitions. [2024-11-13 16:45:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2150 transitions. [2024-11-13 16:45:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 16:45:49,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-13 16:45:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1776 states and 2166 transitions. [2024-11-13 16:45:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2166 transitions. [2024-11-13 16:45:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 16:45:51,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:51,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 16:45:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 1797 states and 2190 transitions. [2024-11-13 16:45:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2190 transitions. [2024-11-13 16:45:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 16:45:55,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:55,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 16:45:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 1818 states and 2215 transitions. [2024-11-13 16:45:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2215 transitions. [2024-11-13 16:45:58,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-13 16:45:58,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 16:45:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 1820 states and 2217 transitions. [2024-11-13 16:45:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2217 transitions. [2024-11-13 16:45:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-13 16:45:58,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 16:45:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:45:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 1822 states and 2219 transitions. [2024-11-13 16:45:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2219 transitions. [2024-11-13 16:45:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-13 16:45:58,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:45:58,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:45:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:45:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 16:46:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 1853 states and 2256 transitions. [2024-11-13 16:46:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2256 transitions. [2024-11-13 16:46:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-13 16:46:02,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 16:46:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1880 states and 2287 transitions. [2024-11-13 16:46:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2287 transitions. [2024-11-13 16:46:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:46:04,221 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 16:46:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 1889 states and 2297 transitions. [2024-11-13 16:46:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2297 transitions. [2024-11-13 16:46:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:46:05,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:05,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 16:46:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 1903 states and 2313 transitions. [2024-11-13 16:46:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2313 transitions. [2024-11-13 16:46:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:46:07,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:07,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 16:46:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 1908 states and 2317 transitions. [2024-11-13 16:46:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2317 transitions. [2024-11-13 16:46:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:46:07,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:07,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-13 16:46:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 1933 states and 2347 transitions. [2024-11-13 16:46:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2347 transitions. [2024-11-13 16:46:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:46:11,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:11,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-13 16:46:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 1941 states and 2355 transitions. [2024-11-13 16:46:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2355 transitions. [2024-11-13 16:46:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:46:12,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:12,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-13 16:46:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 1945 states and 2359 transitions. [2024-11-13 16:46:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2359 transitions. [2024-11-13 16:46:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:46:13,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-13 16:46:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 1955 states and 2368 transitions. [2024-11-13 16:46:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2368 transitions. [2024-11-13 16:46:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-13 16:46:14,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 16:46:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 1967 states and 2384 transitions. [2024-11-13 16:46:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2384 transitions. [2024-11-13 16:46:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-13 16:46:17,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:17,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 16:46:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 1973 states and 2389 transitions. [2024-11-13 16:46:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2389 transitions. [2024-11-13 16:46:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 16:46:18,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:18,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 16:46:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 1980 states and 2396 transitions. [2024-11-13 16:46:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2396 transitions. [2024-11-13 16:46:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 16:46:20,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:20,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 16:46:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 1986 states and 2401 transitions. [2024-11-13 16:46:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2401 transitions. [2024-11-13 16:46:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 16:46:21,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:21,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-13 16:46:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 1988 states and 2402 transitions. [2024-11-13 16:46:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2402 transitions. [2024-11-13 16:46:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 16:46:21,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-13 16:46:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2000 states and 2417 transitions. [2024-11-13 16:46:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2417 transitions. [2024-11-13 16:46:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 16:46:23,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-13 16:46:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2006 states and 2422 transitions. [2024-11-13 16:46:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2422 transitions. [2024-11-13 16:46:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 16:46:24,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-13 16:46:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2012 states and 2427 transitions. [2024-11-13 16:46:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2427 transitions. [2024-11-13 16:46:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 16:46:25,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-13 16:46:26,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2019 states and 2435 transitions. [2024-11-13 16:46:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2435 transitions. [2024-11-13 16:46:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 16:46:26,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:26,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-13 16:46:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2020 states and 2436 transitions. [2024-11-13 16:46:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2436 transitions. [2024-11-13 16:46:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 16:46:27,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-13 16:46:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2026 states and 2441 transitions. [2024-11-13 16:46:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2441 transitions. [2024-11-13 16:46:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 16:46:28,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-13 16:46:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2032 states and 2446 transitions. [2024-11-13 16:46:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2446 transitions. [2024-11-13 16:46:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 16:46:29,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-13 16:46:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1665 states and 1990 transitions. [2024-11-13 16:46:30,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1990 transitions. [2024-11-13 16:46:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 16:46:30,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:46:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:46:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:46:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 31 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:46:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:46:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 1763 states and 2105 transitions. [2024-11-13 16:46:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2105 transitions. [2024-11-13 16:46:37,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 16:46:37,628 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 120 iterations. [2024-11-13 16:46:37,638 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 16:46:53,689 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,690 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,690 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,690 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,691 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,691 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,691 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,691 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,692 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,692 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,692 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,692 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,693 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,693 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,693 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,693 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,694 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,694 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,694 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,694 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,694 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,695 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,695 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,695 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,696 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,696 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,696 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 16:46:53,696 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,696 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,697 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,697 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,697 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,697 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,698 INFO L77 FloydHoareUtils]: At program point L460-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (or (and (not (= 7 ~a17~0)) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse0)) (and (<= ~a17~0 8) .cse0))) [2024-11-13 16:46:53,698 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,698 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,698 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,698 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 464) no Hoare annotation was computed. [2024-11-13 16:46:53,699 INFO L77 FloydHoareUtils]: At program point L463-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (or (and (not (= 7 ~a17~0)) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse0)) (and (<= ~a17~0 8) .cse0))) [2024-11-13 16:46:53,699 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,699 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,699 INFO L75 FloydHoareUtils]: For program point L464(line 464) no Hoare annotation was computed. [2024-11-13 16:46:53,699 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,700 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,700 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,700 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,700 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse5 (= ~a11~0 1)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a21~0 1)) (.cse3 (= 7 ~a17~0)) (.cse6 (= ~a25~0 1))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) (< ~a17~0 8)) (and .cse4 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and (<= 8 ~a17~0) (not .cse2)) (and .cse5 .cse1 .cse2) (and .cse6 .cse5 .cse0 .cse3 (= ~a28~0 9)) (and .cse1 .cse2 (not (and .cse4 .cse7))) (and .cse5 .cse7 .cse0 .cse3 (not .cse6)))) [2024-11-13 16:46:53,701 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,701 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,701 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,701 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,702 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,702 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse5 (= ~a11~0 1)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a21~0 1)) (.cse3 (= 7 ~a17~0)) (.cse6 (= ~a25~0 1))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) (< ~a17~0 8)) (and .cse4 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and (<= 8 ~a17~0) (not .cse2)) (and .cse5 .cse1 .cse2) (and .cse6 .cse5 .cse0 .cse3 (= ~a28~0 9)) (and .cse1 .cse2 (not (and .cse4 .cse7))) (and .cse5 .cse7 .cse0 .cse3 (not .cse6)))) [2024-11-13 16:46:53,702 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,702 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,702 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,702 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,703 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse5 (= ~a11~0 1)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a21~0 1)) (.cse3 (= 7 ~a17~0)) (.cse6 (= ~a25~0 1))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) (< ~a17~0 8)) (and .cse4 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and (<= 8 ~a17~0) (not .cse2)) (and .cse5 .cse1 .cse2) (and .cse6 .cse5 .cse0 .cse3 (= ~a28~0 9)) (and .cse1 .cse2 (not (and .cse4 .cse7))) (and .cse5 .cse7 .cse0 .cse3 (not .cse6)))) [2024-11-13 16:46:53,703 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-13 16:46:53,703 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,703 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,703 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,703 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,703 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,703 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,704 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,704 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,704 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,704 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,705 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse5 (= ~a11~0 1)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a21~0 1)) (.cse3 (= 7 ~a17~0)) (.cse6 (= ~a25~0 1))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) (< ~a17~0 8)) (and .cse4 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and (<= 8 ~a17~0) (not .cse2)) (and .cse5 .cse1 .cse2) (and .cse6 .cse5 .cse0 .cse3 (= ~a28~0 9)) (and .cse1 .cse2 (not (and .cse4 .cse7))) (and .cse5 .cse7 .cse0 .cse3 (not .cse6)))) [2024-11-13 16:46:53,705 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,705 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,705 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,706 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,706 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse5 (= ~a11~0 1)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a21~0 1)) (.cse3 (= 7 ~a17~0)) (.cse6 (= ~a25~0 1))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) (< ~a17~0 8)) (and .cse4 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and (<= 8 ~a17~0) (not .cse2)) (and .cse5 .cse1 .cse2) (and .cse6 .cse5 .cse0 .cse3 (= ~a28~0 9)) (and .cse1 .cse2 (not (and .cse4 .cse7))) (and .cse5 .cse7 .cse0 .cse3 (not .cse6)))) [2024-11-13 16:46:53,706 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,706 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,706 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 16:46:53,707 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,707 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,707 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,707 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,707 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,708 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,708 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1)) (.cse3 (= ~a11~0 1)) (.cse4 (= ~a21~0 1)) (.cse0 (= 7 ~a17~0)) (.cse2 (= ~a25~0 1))) (or (and (not .cse0) (< ~a17~0 8)) (and (<= 8 ~a17~0) (not .cse1)) (and (<= ~a17~0 8) .cse1) (and .cse2 .cse3 .cse4 .cse0 (= ~a28~0 9)) (and .cse3 (= ~a28~0 10) .cse4 .cse0 (not .cse2)))) [2024-11-13 16:46:53,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 04:46:53 ImpRootNode [2024-11-13 16:46:53,723 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 16:46:53,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:46:53,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:46:53,725 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:46:53,725 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:43:23" (3/4) ... [2024-11-13 16:46:53,728 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 16:46:53,751 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-11-13 16:46:53,754 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-13 16:46:53,756 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 16:46:53,757 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 16:46:53,937 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 16:46:53,938 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 16:46:53,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:46:53,939 INFO L158 Benchmark]: Toolchain (without parser) took 213200.39ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 91.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 291.2MB. Max. memory is 16.1GB. [2024-11-13 16:46:53,939 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:46:53,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.91ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 65.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:46:53,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.21ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 60.5MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:46:53,940 INFO L158 Benchmark]: Boogie Preprocessor took 57.61ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 56.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:46:53,940 INFO L158 Benchmark]: RCFGBuilder took 2189.84ms. Allocated memory is still 117.4MB. Free memory was 56.4MB in the beginning and 78.2MB in the end (delta: -21.8MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2024-11-13 16:46:53,941 INFO L158 Benchmark]: CodeCheck took 209777.87ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 78.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. [2024-11-13 16:46:53,941 INFO L158 Benchmark]: Witness Printer took 213.66ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:46:53,943 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 193.6s, OverallIterations: 120, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288512 SdHoareTripleChecker+Valid, 855.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278360 mSDsluCounter, 30787 SdHoareTripleChecker+Invalid, 726.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26050 mSDsCounter, 68096 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 612928 IncrementalHoareTripleChecker+Invalid, 681024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68096 mSolverCounterUnsat, 4737 mSDtfsCounter, 612928 mSolverCounterSat, 8.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128809 GetRequests, 122444 SyntacticMatches, 5189 SemanticMatches, 1176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795925 ImplicationChecksByTransitivity, 154.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 18686 NumberOfCodeBlocks, 18686 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 18567 ConstructedInterpolants, 0 QuantifiedInterpolants, 46743 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 119 InterpolantComputations, 103 PerfectInterpolantSequences, 12365/12834 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: 464]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((((7 != a17) && (a17 < 8)) || ((8 <= a17) && (a19 != 1))) || ((a17 <= 8) && (a19 == 1))) || (((((a25 == 1) && (a11 == 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || (((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17)) && (a25 != 1))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((7 != a17) && (a17 < 8)) || ((8 <= a17) && (a19 != 1))) || ((a17 <= 8) && (a19 == 1))) || (((((a25 == 1) && (a11 == 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || (((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17)) && (a25 != 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 873.91ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 65.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.21ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 60.5MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.61ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 56.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2189.84ms. Allocated memory is still 117.4MB. Free memory was 56.4MB in the beginning and 78.2MB in the end (delta: -21.8MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * CodeCheck took 209777.87ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 78.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. * Witness Printer took 213.66ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 16:46:53,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d98441e-39c2-4c93-a119-b578324c81e0/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE