./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label42.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_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/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_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label42.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/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_5256eea9-db80-4bee-8fe1-8297c0008c81/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 6a1d98a51bcc97ee19e0458934f0b894e85cf8f8042e38117bf0e9bc0c63c9ce --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:21:30,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:21:31,030 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:21:31,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:21:31,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:21:31,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:21:31,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:21:31,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:21:31,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:21:31,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:21:31,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:21:31,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:21:31,067 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:21:31,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:21:31,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:21:31,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:21:31,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:21:31,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:21:31,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:21:31,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:21:31,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:21:31,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:21:31,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:21:31,069 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:21:31,069 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:21:31,069 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:21:31,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:21:31,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:21:31,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:21:31,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:21:31,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:21:31,070 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:21:31,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:21:31,070 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_5256eea9-db80-4bee-8fe1-8297c0008c81/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 -> 6a1d98a51bcc97ee19e0458934f0b894e85cf8f8042e38117bf0e9bc0c63c9ce [2024-11-13 21:21:31,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:21:31,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:21:31,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:21:31,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:21:31,504 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:21:31,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem02_label42.c Unable to find full path for "g++" [2024-11-13 21:21:33,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:21:34,119 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:21:34,127 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/sv-benchmarks/c/eca-rers2012/Problem02_label42.c [2024-11-13 21:21:34,151 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/data/d2362736f/d7d8455685834bf2898e8fb28eed8d4c/FLAGce6ca93f2 [2024-11-13 21:21:34,242 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/data/d2362736f/d7d8455685834bf2898e8fb28eed8d4c [2024-11-13 21:21:34,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:21:34,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:21:34,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:21:34,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:21:34,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:21:34,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:34,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b898c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34, skipping insertion in model container [2024-11-13 21:21:34,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:34,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:21:34,740 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_5256eea9-db80-4bee-8fe1-8297c0008c81/sv-benchmarks/c/eca-rers2012/Problem02_label42.c[16787,16800] [2024-11-13 21:21:34,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:21:34,795 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:21:34,890 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_5256eea9-db80-4bee-8fe1-8297c0008c81/sv-benchmarks/c/eca-rers2012/Problem02_label42.c[16787,16800] [2024-11-13 21:21:34,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:21:34,945 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:21:34,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34 WrapperNode [2024-11-13 21:21:34,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:21:34,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:21:34,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:21:34,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:21:34,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:34,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:35,020 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-13 21:21:35,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:21:35,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:21:35,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:21:35,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:21:35,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:35,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:35,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:35,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:35,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:35,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:35,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:35,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:35,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:21:35,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:21:35,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:21:35,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:21:35,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:21:34" (1/1) ... [2024-11-13 21:21:35,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:21:35,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:21:35,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:21:35,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:21:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:21:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:21:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:21:35,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:21:35,303 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:21:35,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:21:36,989 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-13 21:21:36,990 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:21:37,452 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:21:37,453 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:21:37,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:21:37 BoogieIcfgContainer [2024-11-13 21:21:37,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:21:37,457 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:21:37,457 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:21:37,470 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:21:37,470 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:21:37" (1/1) ... [2024-11-13 21:21:37,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:21:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-13 21:21:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-13 21:21:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 21:21:37,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:37,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:38,459 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 21:21:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-11-13 21:21:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-13 21:21:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 21:21:39,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:39,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-11-13 21:21:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-11-13 21:21:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 21:21:40,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:40,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-11-13 21:21:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-11-13 21:21:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 21:21:41,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:41,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-11-13 21:21:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-11-13 21:21:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 21:21:41,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:21:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-11-13 21:21:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-11-13 21:21:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 21:21:41,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:41,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-11-13 21:21:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-11-13 21:21:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 21:21:42,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:42,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-11-13 21:21:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-11-13 21:21:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 21:21:42,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:42,765 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 21:21:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 311 states and 411 transitions. [2024-11-13 21:21:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 411 transitions. [2024-11-13 21:21:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 21:21:43,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 390 states and 502 transitions. [2024-11-13 21:21:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 502 transitions. [2024-11-13 21:21:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 21:21:45,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:45,371 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 21:21:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 414 states and 530 transitions. [2024-11-13 21:21:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 530 transitions. [2024-11-13 21:21:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 21:21:46,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:46,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 21:21:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 428 states and 545 transitions. [2024-11-13 21:21:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 545 transitions. [2024-11-13 21:21:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 21:21:46,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:46,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:46,645 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 21:21:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 460 states and 585 transitions. [2024-11-13 21:21:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 585 transitions. [2024-11-13 21:21:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 21:21:47,445 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:47,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 483 states and 613 transitions. [2024-11-13 21:21:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 613 transitions. [2024-11-13 21:21:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 21:21:48,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:48,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:48,351 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 21:21:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 489 states and 621 transitions. [2024-11-13 21:21:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 621 transitions. [2024-11-13 21:21:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 21:21:48,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 496 states and 629 transitions. [2024-11-13 21:21:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 629 transitions. [2024-11-13 21:21:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 21:21:48,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:48,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 512 states and 645 transitions. [2024-11-13 21:21:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 645 transitions. [2024-11-13 21:21:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 21:21:49,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:49,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 21:21:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 533 states and 671 transitions. [2024-11-13 21:21:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 671 transitions. [2024-11-13 21:21:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 21:21:50,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:50,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 555 states and 700 transitions. [2024-11-13 21:21:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 700 transitions. [2024-11-13 21:21:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 21:21:51,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 21:21:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 570 states and 720 transitions. [2024-11-13 21:21:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 720 transitions. [2024-11-13 21:21:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 21:21:52,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:21:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 577 states and 727 transitions. [2024-11-13 21:21:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 727 transitions. [2024-11-13 21:21:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 21:21:52,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:52,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:21:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 608 states and 762 transitions. [2024-11-13 21:21:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 762 transitions. [2024-11-13 21:21:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 21:21:53,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:53,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 68 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 618 states and 772 transitions. [2024-11-13 21:21:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 772 transitions. [2024-11-13 21:21:53,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 21:21:53,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:21:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 621 states and 775 transitions. [2024-11-13 21:21:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 775 transitions. [2024-11-13 21:21:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 21:21:53,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:53,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 700 states and 860 transitions. [2024-11-13 21:21:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 860 transitions. [2024-11-13 21:21:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 21:21:54,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:54,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:21:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 717 states and 877 transitions. [2024-11-13 21:21:55,406 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 877 transitions. [2024-11-13 21:21:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 21:21:55,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:55,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:21:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 727 states and 886 transitions. [2024-11-13 21:21:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 886 transitions. [2024-11-13 21:21:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 21:21:55,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 744 states and 902 transitions. [2024-11-13 21:21:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 902 transitions. [2024-11-13 21:21:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 21:21:56,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 21:21:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 777 states and 939 transitions. [2024-11-13 21:21:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 939 transitions. [2024-11-13 21:21:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 21:21:57,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 21:21:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 799 states and 962 transitions. [2024-11-13 21:21:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 962 transitions. [2024-11-13 21:21:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 21:21:57,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:21:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 812 states and 981 transitions. [2024-11-13 21:21:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 981 transitions. [2024-11-13 21:21:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 21:21:58,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:21:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:21:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:21:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 857 states and 1035 transitions. [2024-11-13 21:21:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1035 transitions. [2024-11-13 21:21:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 21:21:59,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:21:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:21:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:22:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 874 states and 1052 transitions. [2024-11-13 21:22:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1052 transitions. [2024-11-13 21:22:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 21:22:00,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:22:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 884 states and 1061 transitions. [2024-11-13 21:22:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1061 transitions. [2024-11-13 21:22:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 21:22:01,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:01,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 921 states and 1098 transitions. [2024-11-13 21:22:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1098 transitions. [2024-11-13 21:22:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 21:22:01,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:22:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 969 states and 1156 transitions. [2024-11-13 21:22:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1156 transitions. [2024-11-13 21:22:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 21:22:03,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:03,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:22:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 986 states and 1173 transitions. [2024-11-13 21:22:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1173 transitions. [2024-11-13 21:22:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 21:22:03,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:03,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:22:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 996 states and 1182 transitions. [2024-11-13 21:22:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1182 transitions. [2024-11-13 21:22:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 21:22:04,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:04,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:22:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1008 states and 1195 transitions. [2024-11-13 21:22:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1195 transitions. [2024-11-13 21:22:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 21:22:04,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:04,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:22:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1045 states and 1233 transitions. [2024-11-13 21:22:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1233 transitions. [2024-11-13 21:22:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 21:22:05,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:05,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:22:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1052 states and 1239 transitions. [2024-11-13 21:22:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1239 transitions. [2024-11-13 21:22:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 21:22:05,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:05,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:05,950 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 21:22:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1054 states and 1243 transitions. [2024-11-13 21:22:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1243 transitions. [2024-11-13 21:22:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 21:22:06,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 21:22:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1055 states and 1243 transitions. [2024-11-13 21:22:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1243 transitions. [2024-11-13 21:22:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 21:22:06,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:06,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 21:22:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1056 states and 1243 transitions. [2024-11-13 21:22:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1243 transitions. [2024-11-13 21:22:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 21:22:06,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:06,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 21:22:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1057 states and 1243 transitions. [2024-11-13 21:22:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1243 transitions. [2024-11-13 21:22:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-13 21:22:07,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-13 21:22:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1094 states and 1279 transitions. [2024-11-13 21:22:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1279 transitions. [2024-11-13 21:22:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 21:22:07,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:07,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 21:22:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1194 states and 1384 transitions. [2024-11-13 21:22:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1384 transitions. [2024-11-13 21:22:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 21:22:09,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 21:22:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1201 states and 1390 transitions. [2024-11-13 21:22:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1390 transitions. [2024-11-13 21:22:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-13 21:22:10,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-13 21:22:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1214 states and 1403 transitions. [2024-11-13 21:22:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1403 transitions. [2024-11-13 21:22:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-13 21:22:10,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:10,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-13 21:22:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1271 states and 1465 transitions. [2024-11-13 21:22:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1465 transitions. [2024-11-13 21:22:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-13 21:22:11,836 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:11,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 21:22:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1407 states and 1611 transitions. [2024-11-13 21:22:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1611 transitions. [2024-11-13 21:22:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-13 21:22:15,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:15,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 21:22:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1430 states and 1633 transitions. [2024-11-13 21:22:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1633 transitions. [2024-11-13 21:22:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-13 21:22:15,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 21:22:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1353 states and 1536 transitions. [2024-11-13 21:22:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1536 transitions. [2024-11-13 21:22:18,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:22:18,515 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 53 iterations. [2024-11-13 21:22:18,524 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 21:22:25,804 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,804 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,805 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,805 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,805 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,805 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,805 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,806 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,806 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,806 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,806 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,806 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,807 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,807 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,807 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,807 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,807 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,808 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,808 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,808 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,808 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,808 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,808 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,809 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,809 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,809 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,809 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:22:25,809 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,809 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,809 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,810 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,810 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,810 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,810 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,810 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,810 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,810 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 482) no Hoare annotation was computed. [2024-11-13 21:22:25,810 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,810 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,811 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,811 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,811 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,811 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,811 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,812 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,812 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,812 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,812 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,812 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,812 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,813 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,813 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,813 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,813 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,813 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,813 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-13 21:22:25,814 INFO L77 FloydHoareUtils]: At program point L478-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-11-13 21:22:25,814 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,814 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,814 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,814 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,814 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,815 INFO L77 FloydHoareUtils]: At program point L481-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-11-13 21:22:25,815 INFO L75 FloydHoareUtils]: For program point L482(line 482) no Hoare annotation was computed. [2024-11-13 21:22:25,815 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,815 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,815 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,815 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,815 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,816 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,816 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,816 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,816 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,816 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,816 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,817 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,817 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,817 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:22:25,817 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,817 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,817 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,817 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,818 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,818 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,818 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-13 21:22:25,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:22:25 ImpRootNode [2024-11-13 21:22:25,837 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:22:25,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:22:25,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:22:25,838 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:22:25,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:21:37" (3/4) ... [2024-11-13 21:22:25,844 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:22:25,865 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-11-13 21:22:25,866 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 21:22:25,867 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 21:22:25,868 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:22:26,039 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:22:26,040 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:22:26,040 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:22:26,041 INFO L158 Benchmark]: Toolchain (without parser) took 51793.64ms. Allocated memory was 117.4MB in the beginning and 880.8MB in the end (delta: 763.4MB). Free memory was 93.7MB in the beginning and 419.2MB in the end (delta: -325.5MB). Peak memory consumption was 437.1MB. Max. memory is 16.1GB. [2024-11-13 21:22:26,041 INFO L158 Benchmark]: CDTParser took 1.26ms. Allocated memory is still 142.6MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:22:26,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 696.34ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 67.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:22:26,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.76ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 62.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:22:26,042 INFO L158 Benchmark]: Boogie Preprocessor took 78.11ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 58.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:22:26,042 INFO L158 Benchmark]: RCFGBuilder took 2353.11ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 58.2MB in the beginning and 248.8MB in the end (delta: -190.7MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-11-13 21:22:26,042 INFO L158 Benchmark]: CodeCheck took 48380.01ms. Allocated memory was 343.9MB in the beginning and 880.8MB in the end (delta: 536.9MB). Free memory was 248.2MB in the beginning and 431.8MB in the end (delta: -183.6MB). Peak memory consumption was 351.6MB. Max. memory is 16.1GB. [2024-11-13 21:22:26,046 INFO L158 Benchmark]: Witness Printer took 202.23ms. Allocated memory is still 880.8MB. Free memory was 431.8MB in the beginning and 419.2MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:22:26,048 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: 41.0s, OverallIterations: 53, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72398 SdHoareTripleChecker+Valid, 264.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71938 mSDsluCounter, 11163 SdHoareTripleChecker+Invalid, 222.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9359 mSDsCounter, 25710 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164473 IncrementalHoareTripleChecker+Invalid, 190183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25710 mSolverCounterUnsat, 1804 mSDtfsCounter, 164473 mSolverCounterSat, 3.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55226 GetRequests, 53757 SyntacticMatches, 1097 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74641 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 7912 NumberOfCodeBlocks, 7912 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 7860 ConstructedInterpolants, 0 QuantifiedInterpolants, 23751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 46 PerfectInterpolantSequences, 5471/5609 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: 482]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.26ms. Allocated memory is still 142.6MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 696.34ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 67.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.76ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 62.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.11ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 58.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2353.11ms. Allocated memory was 117.4MB in the beginning and 343.9MB in the end (delta: 226.5MB). Free memory was 58.2MB in the beginning and 248.8MB in the end (delta: -190.7MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * CodeCheck took 48380.01ms. Allocated memory was 343.9MB in the beginning and 880.8MB in the end (delta: 536.9MB). Free memory was 248.2MB in the beginning and 431.8MB in the end (delta: -183.6MB). Peak memory consumption was 351.6MB. Max. memory is 16.1GB. * Witness Printer took 202.23ms. Allocated memory is still 880.8MB. Free memory was 431.8MB in the beginning and 419.2MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 21:22:26,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256eea9-db80-4bee-8fe1-8297c0008c81/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