./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label24.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_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/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_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/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_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/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 3b098f62dc80370f0e14e7fa6b354d0aae7e8d94738f84002290c368f38c01b4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:54:20,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:54:20,805 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 16:54:20,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:54:20,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 16:54:20,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:54:20,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:54:20,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 16:54:20,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:54:20,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:54:20,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:54:20,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:54:20,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:54:20,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:54:20,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:54:20,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:54:20,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:54:20,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:54:20,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:54:20,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:54:20,840 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:54:20,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:54:20,840 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:54:20,840 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 16:54:20,841 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 16:54:20,841 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 16:54:20,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:54:20,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 16:54:20,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:54:20,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:54:20,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:54:20,842 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 16:54:20,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:54:20,842 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_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/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 -> 3b098f62dc80370f0e14e7fa6b354d0aae7e8d94738f84002290c368f38c01b4 [2024-11-13 16:54:21,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:54:21,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:54:21,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:54:21,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:54:21,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:54:21,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c Unable to find full path for "g++" [2024-11-13 16:54:23,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:54:23,669 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:54:23,670 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2024-11-13 16:54:23,682 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/data/531c33147/cafc884e0adb4da4a108412f9f9d64ad/FLAG387415135 [2024-11-13 16:54:23,915 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/data/531c33147/cafc884e0adb4da4a108412f9f9d64ad [2024-11-13 16:54:23,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:54:23,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:54:23,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:54:23,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:54:23,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:54:23,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:54:23" (1/1) ... [2024-11-13 16:54:23,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e59f434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:23, skipping insertion in model container [2024-11-13 16:54:23,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:54:23" (1/1) ... [2024-11-13 16:54:23,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:54:24,390 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_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/sv-benchmarks/c/eca-rers2012/Problem01_label24.c[17735,17748] [2024-11-13 16:54:24,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:54:24,487 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:54:24,627 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_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/sv-benchmarks/c/eca-rers2012/Problem01_label24.c[17735,17748] [2024-11-13 16:54:24,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:54:24,679 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:54:24,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24 WrapperNode [2024-11-13 16:54:24,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:54:24,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:54:24,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:54:24,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:54:24,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,763 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 16:54:24,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:54:24,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:54:24,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:54:24,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:54:24,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:54:24,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:54:24,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:54:24,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:54:24,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:54:24" (1/1) ... [2024-11-13 16:54:24,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 16:54:24,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 16:54:24,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 16:54:24,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 16:54:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:54:24,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 16:54:24,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:54:24,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:54:25,010 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:54:25,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:54:26,615 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 16:54:26,617 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:54:27,002 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:54:27,005 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:54:27,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:54:27 BoogieIcfgContainer [2024-11-13 16:54:27,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:54:27,006 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 16:54:27,007 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 16:54:27,019 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 16:54:27,020 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:54:27" (1/1) ... [2024-11-13 16:54:27,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:54:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 16:54:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 16:54:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 16:54:27,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2024-11-13 16:54:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2024-11-13 16:54:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 16:54:28,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2024-11-13 16:54:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2024-11-13 16:54:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 16:54:30,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2024-11-13 16:54:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2024-11-13 16:54:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 16:54:30,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 295 states and 424 transitions. [2024-11-13 16:54:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 424 transitions. [2024-11-13 16:54:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 16:54:32,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:32,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 299 states and 429 transitions. [2024-11-13 16:54:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 429 transitions. [2024-11-13 16:54:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 16:54:32,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 310 states and 443 transitions. [2024-11-13 16:54:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 443 transitions. [2024-11-13 16:54:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 16:54:33,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:33,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 320 states and 455 transitions. [2024-11-13 16:54:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2024-11-13 16:54:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 16:54:34,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:34,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 328 states and 469 transitions. [2024-11-13 16:54:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 469 transitions. [2024-11-13 16:54:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 16:54:35,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 337 states and 481 transitions. [2024-11-13 16:54:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 481 transitions. [2024-11-13 16:54:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 16:54:35,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:35,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 343 states and 488 transitions. [2024-11-13 16:54:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 488 transitions. [2024-11-13 16:54:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 16:54:35,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 345 states and 490 transitions. [2024-11-13 16:54:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 490 transitions. [2024-11-13 16:54:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 16:54:36,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 353 states and 500 transitions. [2024-11-13 16:54:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 500 transitions. [2024-11-13 16:54:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 16:54:36,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 355 states and 502 transitions. [2024-11-13 16:54:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 502 transitions. [2024-11-13 16:54:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 16:54:37,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:37,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 357 states and 504 transitions. [2024-11-13 16:54:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 504 transitions. [2024-11-13 16:54:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 16:54:37,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:37,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 368 states and 518 transitions. [2024-11-13 16:54:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 518 transitions. [2024-11-13 16:54:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 16:54:38,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:38,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 378 states and 529 transitions. [2024-11-13 16:54:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 529 transitions. [2024-11-13 16:54:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 16:54:39,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:39,589 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 16:54:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 395 states and 548 transitions. [2024-11-13 16:54:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 548 transitions. [2024-11-13 16:54:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 16:54:40,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:54:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 425 states and 585 transitions. [2024-11-13 16:54:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 585 transitions. [2024-11-13 16:54:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 16:54:41,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:54:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 448 states and 609 transitions. [2024-11-13 16:54:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 609 transitions. [2024-11-13 16:54:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 16:54:42,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 462 states and 623 transitions. [2024-11-13 16:54:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 623 transitions. [2024-11-13 16:54:42,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:54:42,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 468 states and 632 transitions. [2024-11-13 16:54:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 632 transitions. [2024-11-13 16:54:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:54:44,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 497 states and 664 transitions. [2024-11-13 16:54:45,986 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 664 transitions. [2024-11-13 16:54:45,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:54:45,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:45,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 507 states and 675 transitions. [2024-11-13 16:54:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 675 transitions. [2024-11-13 16:54:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:54:46,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:46,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 535 states and 705 transitions. [2024-11-13 16:54:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 705 transitions. [2024-11-13 16:54:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:54:47,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:54:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 551 states and 724 transitions. [2024-11-13 16:54:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 724 transitions. [2024-11-13 16:54:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:54:48,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:48,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 599 states and 776 transitions. [2024-11-13 16:54:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 776 transitions. [2024-11-13 16:54:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:54:49,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:49,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 646 states and 831 transitions. [2024-11-13 16:54:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 831 transitions. [2024-11-13 16:54:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 16:54:51,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:51,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 16:54:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 649 states and 835 transitions. [2024-11-13 16:54:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 835 transitions. [2024-11-13 16:54:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 16:54:51,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:51,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 16:54:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 652 states and 839 transitions. [2024-11-13 16:54:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 839 transitions. [2024-11-13 16:54:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 16:54:52,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:52,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 16:54:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 671 states and 859 transitions. [2024-11-13 16:54:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 859 transitions. [2024-11-13 16:54:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 16:54:53,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:53,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 690 states and 877 transitions. [2024-11-13 16:54:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 877 transitions. [2024-11-13 16:54:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 16:54:54,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:54,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 709 states and 897 transitions. [2024-11-13 16:54:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 897 transitions. [2024-11-13 16:54:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 16:54:55,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:54:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 724 states and 914 transitions. [2024-11-13 16:54:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 914 transitions. [2024-11-13 16:54:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 16:54:55,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 763 states and 956 transitions. [2024-11-13 16:54:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 956 transitions. [2024-11-13 16:54:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 16:54:56,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:56,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 16:54:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 779 states and 973 transitions. [2024-11-13 16:54:56,799 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 973 transitions. [2024-11-13 16:54:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 16:54:56,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:56,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 16:54:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 796 states and 994 transitions. [2024-11-13 16:54:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 994 transitions. [2024-11-13 16:54:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 16:54:57,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:54:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:54:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:54:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 866 states and 1069 transitions. [2024-11-13 16:54:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1069 transitions. [2024-11-13 16:54:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 16:54:59,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:54:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:54:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 935 states and 1162 transitions. [2024-11-13 16:55:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1162 transitions. [2024-11-13 16:55:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 16:55:02,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1003 states and 1237 transitions. [2024-11-13 16:55:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1237 transitions. [2024-11-13 16:55:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 16:55:04,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:04,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1022 states and 1256 transitions. [2024-11-13 16:55:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1256 transitions. [2024-11-13 16:55:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 16:55:06,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:06,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1039 states and 1274 transitions. [2024-11-13 16:55:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1274 transitions. [2024-11-13 16:55:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 16:55:07,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1041 states and 1275 transitions. [2024-11-13 16:55:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1275 transitions. [2024-11-13 16:55:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 16:55:07,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:07,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1048 states and 1284 transitions. [2024-11-13 16:55:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1284 transitions. [2024-11-13 16:55:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 16:55:09,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1058 states and 1295 transitions. [2024-11-13 16:55:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1295 transitions. [2024-11-13 16:55:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 16:55:09,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:55:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1096 states and 1337 transitions. [2024-11-13 16:55:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1337 transitions. [2024-11-13 16:55:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 16:55:11,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:11,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:55:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1120 states and 1362 transitions. [2024-11-13 16:55:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1362 transitions. [2024-11-13 16:55:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 16:55:12,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:12,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 16:55:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1121 states and 1367 transitions. [2024-11-13 16:55:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1367 transitions. [2024-11-13 16:55:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 16:55:12,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 16:55:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1122 states and 1369 transitions. [2024-11-13 16:55:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1369 transitions. [2024-11-13 16:55:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 16:55:13,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:13,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 16:55:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1128 states and 1376 transitions. [2024-11-13 16:55:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1376 transitions. [2024-11-13 16:55:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 16:55:13,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 16:55:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1152 states and 1400 transitions. [2024-11-13 16:55:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1400 transitions. [2024-11-13 16:55:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 16:55:14,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 16:55:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1176 states and 1424 transitions. [2024-11-13 16:55:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1424 transitions. [2024-11-13 16:55:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 16:55:14,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1194 states and 1446 transitions. [2024-11-13 16:55:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1446 transitions. [2024-11-13 16:55:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 16:55:16,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1224 states and 1482 transitions. [2024-11-13 16:55:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1482 transitions. [2024-11-13 16:55:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 16:55:18,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1236 states and 1498 transitions. [2024-11-13 16:55:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1498 transitions. [2024-11-13 16:55:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 16:55:19,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:19,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:55:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1283 states and 1557 transitions. [2024-11-13 16:55:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1557 transitions. [2024-11-13 16:55:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 16:55:21,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:21,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:55:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1313 states and 1591 transitions. [2024-11-13 16:55:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1591 transitions. [2024-11-13 16:55:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 16:55:21,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:55:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1328 states and 1605 transitions. [2024-11-13 16:55:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1605 transitions. [2024-11-13 16:55:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 16:55:22,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1399 states and 1685 transitions. [2024-11-13 16:55:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1685 transitions. [2024-11-13 16:55:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 16:55:26,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:26,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1469 states and 1762 transitions. [2024-11-13 16:55:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1762 transitions. [2024-11-13 16:55:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 16:55:29,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:29,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1521 states and 1826 transitions. [2024-11-13 16:55:32,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1826 transitions. [2024-11-13 16:55:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 16:55:32,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:32,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1567 states and 1877 transitions. [2024-11-13 16:55:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1877 transitions. [2024-11-13 16:55:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 16:55:33,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:55:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1618 states and 1939 transitions. [2024-11-13 16:55:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1939 transitions. [2024-11-13 16:55:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 16:55:36,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:36,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:55:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 1679 states and 2010 transitions. [2024-11-13 16:55:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2010 transitions. [2024-11-13 16:55:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 16:55:38,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:38,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 1727 states and 2067 transitions. [2024-11-13 16:55:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2067 transitions. [2024-11-13 16:55:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 16:55:41,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 1787 states and 2135 transitions. [2024-11-13 16:55:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2135 transitions. [2024-11-13 16:55:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 16:55:44,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:44,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 1789 states and 2141 transitions. [2024-11-13 16:55:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2141 transitions. [2024-11-13 16:55:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 16:55:45,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:45,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 1791 states and 2145 transitions. [2024-11-13 16:55:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2145 transitions. [2024-11-13 16:55:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 16:55:46,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:55:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 1815 states and 2173 transitions. [2024-11-13 16:55:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2173 transitions. [2024-11-13 16:55:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 16:55:47,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 16:55:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 1838 states and 2197 transitions. [2024-11-13 16:55:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2197 transitions. [2024-11-13 16:55:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 16:55:48,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 16:55:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 1839 states and 2198 transitions. [2024-11-13 16:55:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2198 transitions. [2024-11-13 16:55:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 16:55:49,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:49,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 16:55:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 1909 states and 2270 transitions. [2024-11-13 16:55:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2270 transitions. [2024-11-13 16:55:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 16:55:50,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:50,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 1941 states and 2312 transitions. [2024-11-13 16:55:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2312 transitions. [2024-11-13 16:55:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 16:55:52,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 1983 states and 2357 transitions. [2024-11-13 16:55:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2357 transitions. [2024-11-13 16:55:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 16:55:54,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 1998 states and 2371 transitions. [2024-11-13 16:55:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2371 transitions. [2024-11-13 16:55:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 16:55:55,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:55,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:55:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2014 states and 2389 transitions. [2024-11-13 16:55:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2389 transitions. [2024-11-13 16:55:56,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:55:56,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 16:55:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:55:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2046 states and 2428 transitions. [2024-11-13 16:55:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2428 transitions. [2024-11-13 16:55:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:55:58,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:55:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:55:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:55:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 16:56:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2091 states and 2478 transitions. [2024-11-13 16:56:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2478 transitions. [2024-11-13 16:56:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:56:00,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 16:56:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2095 states and 2482 transitions. [2024-11-13 16:56:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2482 transitions. [2024-11-13 16:56:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 16:56:01,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:01,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:56:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2129 states and 2520 transitions. [2024-11-13 16:56:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2520 transitions. [2024-11-13 16:56:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 16:56:04,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:04,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:56:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2155 states and 2550 transitions. [2024-11-13 16:56:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2550 transitions. [2024-11-13 16:56:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 16:56:05,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 16:56:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2161 states and 2559 transitions. [2024-11-13 16:56:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2559 transitions. [2024-11-13 16:56:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 16:56:07,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:07,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 16:56:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2207 states and 2607 transitions. [2024-11-13 16:56:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2607 transitions. [2024-11-13 16:56:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 16:56:10,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 16:56:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2238 states and 2641 transitions. [2024-11-13 16:56:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 2641 transitions. [2024-11-13 16:56:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 16:56:12,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 16:56:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2253 states and 2656 transitions. [2024-11-13 16:56:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 2656 transitions. [2024-11-13 16:56:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 16:56:13,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:56:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2281 states and 2687 transitions. [2024-11-13 16:56:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 2687 transitions. [2024-11-13 16:56:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 16:56:15,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:15,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:56:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2303 states and 2713 transitions. [2024-11-13 16:56:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2713 transitions. [2024-11-13 16:56:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 16:56:17,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:17,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:56:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2337 states and 2750 transitions. [2024-11-13 16:56:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 2750 transitions. [2024-11-13 16:56:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 16:56:19,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:19,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:56:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2354 states and 2768 transitions. [2024-11-13 16:56:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 2768 transitions. [2024-11-13 16:56:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:56:21,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:21,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 16:56:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2401 states and 2825 transitions. [2024-11-13 16:56:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2825 transitions. [2024-11-13 16:56:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:56:25,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 16:56:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2447 states and 2878 transitions. [2024-11-13 16:56:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2878 transitions. [2024-11-13 16:56:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:56:29,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:29,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 16:56:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2464 states and 2896 transitions. [2024-11-13 16:56:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 2896 transitions. [2024-11-13 16:56:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:56:31,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:31,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 16:56:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2481 states and 2912 transitions. [2024-11-13 16:56:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 2912 transitions. [2024-11-13 16:56:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 16:56:33,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:56:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 2604 states and 3058 transitions. [2024-11-13 16:56:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 3058 transitions. [2024-11-13 16:56:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 16:56:40,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:40,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 16:56:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 2629 states and 3084 transitions. [2024-11-13 16:56:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3084 transitions. [2024-11-13 16:56:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 16:56:42,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:56:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 2631 states and 3085 transitions. [2024-11-13 16:56:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3085 transitions. [2024-11-13 16:56:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 16:56:42,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 16:56:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 2766 states and 3234 transitions. [2024-11-13 16:56:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3234 transitions. [2024-11-13 16:56:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 16:56:47,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:47,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:56:50,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 2840 states and 3310 transitions. [2024-11-13 16:56:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3310 transitions. [2024-11-13 16:56:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 16:56:50,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 16:56:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 2860 states and 3330 transitions. [2024-11-13 16:56:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3330 transitions. [2024-11-13 16:56:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 16:56:52,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 16:56:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 2880 states and 3350 transitions. [2024-11-13 16:56:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3350 transitions. [2024-11-13 16:56:54,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-13 16:56:54,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 16:56:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 2882 states and 3352 transitions. [2024-11-13 16:56:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 3352 transitions. [2024-11-13 16:56:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-13 16:56:55,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-13 16:56:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 2884 states and 3354 transitions. [2024-11-13 16:56:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 3354 transitions. [2024-11-13 16:56:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 16:56:56,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:56,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 16:56:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 2885 states and 3355 transitions. [2024-11-13 16:56:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 3355 transitions. [2024-11-13 16:56:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-13 16:56:57,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 171 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 16:56:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:56:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 2910 states and 3384 transitions. [2024-11-13 16:56:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3384 transitions. [2024-11-13 16:56:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 16:56:59,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:56:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:56:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:56:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 16:57:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 2912 states and 3386 transitions. [2024-11-13 16:57:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 3386 transitions. [2024-11-13 16:57:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 16:57:00,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:00,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 16:57:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 2915 states and 3395 transitions. [2024-11-13 16:57:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 3395 transitions. [2024-11-13 16:57:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 16:57:02,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:02,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 16:57:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 2917 states and 3399 transitions. [2024-11-13 16:57:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3399 transitions. [2024-11-13 16:57:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 16:57:02,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 16:57:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 2918 states and 3400 transitions. [2024-11-13 16:57:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 3400 transitions. [2024-11-13 16:57:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-13 16:57:03,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 190 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 16:57:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 2920 states and 3401 transitions. [2024-11-13 16:57:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 3401 transitions. [2024-11-13 16:57:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 16:57:04,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 223 proven. 59 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 16:57:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 2922 states and 3402 transitions. [2024-11-13 16:57:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3402 transitions. [2024-11-13 16:57:05,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 16:57:05,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:05,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 16:57:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 2963 states and 3450 transitions. [2024-11-13 16:57:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 3450 transitions. [2024-11-13 16:57:07,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 16:57:07,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:07,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 16:57:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3002 states and 3503 transitions. [2024-11-13 16:57:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3503 transitions. [2024-11-13 16:57:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 16:57:10,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:10,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3079 states and 3600 transitions. [2024-11-13 16:57:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 3600 transitions. [2024-11-13 16:57:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 16:57:19,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3147 states and 3680 transitions. [2024-11-13 16:57:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 3680 transitions. [2024-11-13 16:57:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 16:57:24,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:24,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3184 states and 3721 transitions. [2024-11-13 16:57:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 3721 transitions. [2024-11-13 16:57:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 16:57:27,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:27,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3730 states to 3191 states and 3730 transitions. [2024-11-13 16:57:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 3730 transitions. [2024-11-13 16:57:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 16:57:29,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3227 states and 3774 transitions. [2024-11-13 16:57:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 3774 transitions. [2024-11-13 16:57:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 16:57:32,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3273 states and 3825 transitions. [2024-11-13 16:57:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 3825 transitions. [2024-11-13 16:57:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 16:57:35,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3331 states and 3889 transitions. [2024-11-13 16:57:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 3889 transitions. [2024-11-13 16:57:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 16:57:40,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3346 states and 3903 transitions. [2024-11-13 16:57:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 3903 transitions. [2024-11-13 16:57:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 16:57:41,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:41,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3348 states and 3906 transitions. [2024-11-13 16:57:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 3906 transitions. [2024-11-13 16:57:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 16:57:43,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:43,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-13 16:57:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3349 states and 3907 transitions. [2024-11-13 16:57:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 3907 transitions. [2024-11-13 16:57:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 16:57:43,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:43,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3357 states and 3919 transitions. [2024-11-13 16:57:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 3919 transitions. [2024-11-13 16:57:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 16:57:45,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3419 states and 3991 transitions. [2024-11-13 16:57:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 3991 transitions. [2024-11-13 16:57:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 16:57:51,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 3458 states and 4033 transitions. [2024-11-13 16:57:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4033 transitions. [2024-11-13 16:57:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 16:57:53,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:53,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:57:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 3459 states and 4035 transitions. [2024-11-13 16:57:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4035 transitions. [2024-11-13 16:57:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 16:57:54,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 16:57:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:57:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 3470 states and 4048 transitions. [2024-11-13 16:57:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4048 transitions. [2024-11-13 16:57:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 16:57:56,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:57:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:57:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:57:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:58:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 3540 states and 4126 transitions. [2024-11-13 16:58:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 4126 transitions. [2024-11-13 16:58:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 16:58:06,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:58:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 3576 states and 4166 transitions. [2024-11-13 16:58:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 4166 transitions. [2024-11-13 16:58:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 16:58:10,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:58:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 3577 states and 4167 transitions. [2024-11-13 16:58:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4167 transitions. [2024-11-13 16:58:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 16:58:12,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:58:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4217 states to 3624 states and 4217 transitions. [2024-11-13 16:58:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 4217 transitions. [2024-11-13 16:58:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 16:58:16,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:16,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:58:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4233 states to 3641 states and 4233 transitions. [2024-11-13 16:58:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 4233 transitions. [2024-11-13 16:58:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 16:58:19,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:19,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:58:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 3687 states and 4280 transitions. [2024-11-13 16:58:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 4280 transitions. [2024-11-13 16:58:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 16:58:24,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-13 16:58:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 3688 states and 4280 transitions. [2024-11-13 16:58:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4280 transitions. [2024-11-13 16:58:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 16:58:25,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-13 16:58:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 3689 states and 4280 transitions. [2024-11-13 16:58:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 4280 transitions. [2024-11-13 16:58:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 16:58:26,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:26,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 16:58:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 3720 states and 4313 transitions. [2024-11-13 16:58:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 4313 transitions. [2024-11-13 16:58:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 16:58:31,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 16:58:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 3731 states and 4329 transitions. [2024-11-13 16:58:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4329 transitions. [2024-11-13 16:58:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 16:58:33,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 16:58:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 3732 states and 4329 transitions. [2024-11-13 16:58:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 4329 transitions. [2024-11-13 16:58:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 16:58:34,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 16:58:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 3733 states and 4331 transitions. [2024-11-13 16:58:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 4331 transitions. [2024-11-13 16:58:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 16:58:35,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 16:58:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 3734 states and 4333 transitions. [2024-11-13 16:58:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4333 transitions. [2024-11-13 16:58:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 16:58:37,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 16:58:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4482 states to 3859 states and 4482 transitions. [2024-11-13 16:58:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 4482 transitions. [2024-11-13 16:58:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 16:58:46,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:46,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:58:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4551 states to 3920 states and 4551 transitions. [2024-11-13 16:58:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4551 transitions. [2024-11-13 16:58:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 16:58:50,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:50,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:58:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4557 states to 3925 states and 4557 transitions. [2024-11-13 16:58:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 4557 transitions. [2024-11-13 16:58:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 16:58:51,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-13 16:58:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4557 states to 3926 states and 4557 transitions. [2024-11-13 16:58:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 4557 transitions. [2024-11-13 16:58:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 16:58:52,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:58:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:58:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:58:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 16:58:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:58:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 3978 states and 4607 transitions. [2024-11-13 16:58:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 4607 transitions. [2024-11-13 16:58:56,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 16:58:56,781 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 145 iterations. [2024-11-13 16:58:56,791 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 16:59:44,970 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,972 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,973 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,974 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,975 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,975 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,975 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,976 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,976 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,976 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,976 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,977 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,977 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,977 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,977 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,978 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,978 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,978 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,978 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,979 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,979 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,979 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,979 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,979 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,980 INFO L77 FloydHoareUtils]: At program point L476-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-13 16:59:44,980 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,980 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,981 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,981 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,981 INFO L77 FloydHoareUtils]: At program point L479-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-13 16:59:44,981 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,982 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,983 INFO L75 FloydHoareUtils]: For program point L480(line 480) no Hoare annotation was computed. [2024-11-13 16:59:44,984 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,984 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,984 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,984 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,985 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,985 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,985 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,985 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,985 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,986 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,986 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,986 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,986 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,987 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,987 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,987 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,987 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 16:59:44,987 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,987 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 16:59:44,987 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,987 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,988 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,988 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,988 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,988 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,988 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,988 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 16:59:44,988 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,989 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,989 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,989 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,991 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,991 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,991 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,991 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,992 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,992 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 480) no Hoare annotation was computed. [2024-11-13 16:59:44,992 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,992 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse8 (= 14 ~a8~0)) (.cse2 (not (= ~a20~0 1))) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not (= ~a17~0 1))) (.cse5 (= ~a21~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a7~0 0))) (or (and (not .cse0) (not .cse1)) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (<= ~a8~0 13) (and .cse1 (not .cse7)) (and .cse2 .cse3 .cse8 .cse4 .cse5 .cse7) (and .cse3 .cse8 .cse9 .cse4 .cse5) (and (not (and .cse3 .cse5 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse1) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse1))) [2024-11-13 16:59:44,993 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,993 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,993 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:44,993 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-13 16:59:45,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 04:59:45 ImpRootNode [2024-11-13 16:59:45,017 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 16:59:45,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:59:45,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:59:45,018 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:59:45,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:54:27" (3/4) ... [2024-11-13 16:59:45,022 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 16:59:45,043 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-13 16:59:45,047 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 16:59:45,048 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 16:59:45,049 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 16:59:45,214 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 16:59:45,215 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 16:59:45,215 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:59:45,216 INFO L158 Benchmark]: Toolchain (without parser) took 321296.72ms. Allocated memory was 117.4MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 90.6MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 744.2MB. Max. memory is 16.1GB. [2024-11-13 16:59:45,216 INFO L158 Benchmark]: CDTParser took 1.52ms. Allocated memory is still 83.9MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:59:45,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 760.23ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 63.8MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:59:45,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.93ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:59:45,218 INFO L158 Benchmark]: Boogie Preprocessor took 57.49ms. Allocated memory is still 117.4MB. Free memory was 58.5MB in the beginning and 54.6MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:59:45,218 INFO L158 Benchmark]: RCFGBuilder took 2183.54ms. Allocated memory is still 117.4MB. Free memory was 54.4MB in the beginning and 70.6MB in the end (delta: -16.2MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-11-13 16:59:45,218 INFO L158 Benchmark]: CodeCheck took 318010.30ms. Allocated memory was 117.4MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 70.6MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 716.6MB. Max. memory is 16.1GB. [2024-11-13 16:59:45,219 INFO L158 Benchmark]: Witness Printer took 197.56ms. Allocated memory is still 3.4GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:59:45,220 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 269.7s, OverallIterations: 145, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582733 SdHoareTripleChecker+Valid, 1742.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 580592 mSDsluCounter, 76445 SdHoareTripleChecker+Invalid, 1491.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65379 mSDsCounter, 120956 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252227 IncrementalHoareTripleChecker+Invalid, 1373183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120956 mSolverCounterUnsat, 11066 mSDtfsCounter, 1252227 mSolverCounterSat, 15.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183674 GetRequests, 173444 SyntacticMatches, 8830 SemanticMatches, 1400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448867 ImplicationChecksByTransitivity, 193.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 41.3s InterpolantComputationTime, 26825 NumberOfCodeBlocks, 26825 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 26681 ConstructedInterpolants, 0 QuantifiedInterpolants, 195776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 144 InterpolantComputations, 39 PerfectInterpolantSequences, 22883/28574 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: 480]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !(((((!((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((!((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.52ms. Allocated memory is still 83.9MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 760.23ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 63.8MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.93ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.49ms. Allocated memory is still 117.4MB. Free memory was 58.5MB in the beginning and 54.6MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2183.54ms. Allocated memory is still 117.4MB. Free memory was 54.4MB in the beginning and 70.6MB in the end (delta: -16.2MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * CodeCheck took 318010.30ms. Allocated memory was 117.4MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 70.6MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 716.6MB. Max. memory is 16.1GB. * Witness Printer took 197.56ms. Allocated memory is still 3.4GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 16:59:45,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_673c0835-0b4e-4aa9-9d27-4e9956c7bc0e/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