./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label34.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_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/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_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label34.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/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_0cb67d2f-2f08-4980-b0b1-e003423a1b16/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 734ea858638864cf111875fb6688bf68ceb15644fd98461d3cd9d71a49a35f2c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:17:20,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:17:20,809 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:17:20,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:17:20,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:17:20,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:17:20,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:17:20,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:17:20,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:17:20,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:17:20,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:17:20,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:17:20,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:17:20,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:17:20,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:17:20,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:17:20,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:17:20,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:17:20,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:17:20,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:17:20,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:17:20,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:17:20,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:17:20,852 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:17:20,852 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:17:20,852 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:17:20,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:17:20,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:17:20,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:17:20,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:17:20,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:17:20,855 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:17:20,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:17:20,855 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_0cb67d2f-2f08-4980-b0b1-e003423a1b16/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 -> 734ea858638864cf111875fb6688bf68ceb15644fd98461d3cd9d71a49a35f2c [2024-11-13 20:17:21,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:17:21,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:17:21,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:17:21,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:17:21,217 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:17:21,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label34.c Unable to find full path for "g++" [2024-11-13 20:17:23,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:17:23,669 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:17:23,676 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/sv-benchmarks/c/eca-rers2012/Problem01_label34.c [2024-11-13 20:17:23,695 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/data/d4d26df69/19fdcdccd37e4f9cb5be50553d530df9/FLAG3020c94b8 [2024-11-13 20:17:23,708 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/data/d4d26df69/19fdcdccd37e4f9cb5be50553d530df9 [2024-11-13 20:17:23,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:17:23,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:17:23,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:17:23,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:17:23,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:17:23,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:17:23" (1/1) ... [2024-11-13 20:17:23,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4dc344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:23, skipping insertion in model container [2024-11-13 20:17:23,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:17:23" (1/1) ... [2024-11-13 20:17:23,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:17:24,176 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_0cb67d2f-2f08-4980-b0b1-e003423a1b16/sv-benchmarks/c/eca-rers2012/Problem01_label34.c[18605,18618] [2024-11-13 20:17:24,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:17:24,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:17:24,336 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_0cb67d2f-2f08-4980-b0b1-e003423a1b16/sv-benchmarks/c/eca-rers2012/Problem01_label34.c[18605,18618] [2024-11-13 20:17:24,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:17:24,379 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:17:24,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24 WrapperNode [2024-11-13 20:17:24,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:17:24,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:17:24,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:17:24,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:17:24,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,479 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 20:17:24,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:17:24,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:17:24,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:17:24,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:17:24,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:17:24,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:17:24,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:17:24,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:17:24,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:17:24" (1/1) ... [2024-11-13 20:17:24,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:17:24,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:17:24,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:17:24,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:17:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:17:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:17:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:17:24,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:17:24,745 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:17:24,751 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:17:26,258 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 20:17:26,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:17:26,580 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:17:26,581 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:17:26,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:17:26 BoogieIcfgContainer [2024-11-13 20:17:26,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:17:26,582 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:17:26,583 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:17:26,594 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:17:26,595 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:17:26" (1/1) ... [2024-11-13 20:17:26,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:17:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 20:17:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 20:17:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 20:17:26,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:26,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2024-11-13 20:17:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2024-11-13 20:17:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:17:27,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:17:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 218 states and 308 transitions. [2024-11-13 20:17:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 308 transitions. [2024-11-13 20:17:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 20:17:29,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 222 states and 315 transitions. [2024-11-13 20:17:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 315 transitions. [2024-11-13 20:17:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 20:17:29,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:29,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:17:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 223 states and 317 transitions. [2024-11-13 20:17:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 317 transitions. [2024-11-13 20:17:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 20:17:30,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 232 states and 330 transitions. [2024-11-13 20:17:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 330 transitions. [2024-11-13 20:17:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 20:17:30,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:30,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 241 states and 339 transitions. [2024-11-13 20:17:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 339 transitions. [2024-11-13 20:17:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:17:31,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 243 states and 342 transitions. [2024-11-13 20:17:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 342 transitions. [2024-11-13 20:17:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 20:17:31,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:31,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 258 states and 362 transitions. [2024-11-13 20:17:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 362 transitions. [2024-11-13 20:17:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 20:17:32,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:32,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 273 states and 382 transitions. [2024-11-13 20:17:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 382 transitions. [2024-11-13 20:17:33,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 20:17:33,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:33,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 277 states and 387 transitions. [2024-11-13 20:17:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 387 transitions. [2024-11-13 20:17:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 20:17:33,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 281 states and 396 transitions. [2024-11-13 20:17:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 396 transitions. [2024-11-13 20:17:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 20:17:34,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 286 states and 402 transitions. [2024-11-13 20:17:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 402 transitions. [2024-11-13 20:17:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:17:34,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:34,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 301 states and 422 transitions. [2024-11-13 20:17:34,998 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2024-11-13 20:17:34,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:17:35,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:35,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:17:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:35,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 320 states and 447 transitions. [2024-11-13 20:17:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 447 transitions. [2024-11-13 20:17:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:17:35,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 335 states and 466 transitions. [2024-11-13 20:17:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 466 transitions. [2024-11-13 20:17:36,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 20:17:36,713 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:36,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 339 states and 470 transitions. [2024-11-13 20:17:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 470 transitions. [2024-11-13 20:17:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 20:17:36,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:36,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:17:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 352 states and 484 transitions. [2024-11-13 20:17:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 484 transitions. [2024-11-13 20:17:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 20:17:37,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:37,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:17:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 354 states and 485 transitions. [2024-11-13 20:17:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 485 transitions. [2024-11-13 20:17:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:17:37,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:37,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:17:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 362 states and 495 transitions. [2024-11-13 20:17:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 495 transitions. [2024-11-13 20:17:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:17:38,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 377 states and 512 transitions. [2024-11-13 20:17:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 512 transitions. [2024-11-13 20:17:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 20:17:38,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:38,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 387 states and 524 transitions. [2024-11-13 20:17:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 524 transitions. [2024-11-13 20:17:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 20:17:38,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 389 states and 527 transitions. [2024-11-13 20:17:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2024-11-13 20:17:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:17:39,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:39,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:17:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 416 states and 559 transitions. [2024-11-13 20:17:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 559 transitions. [2024-11-13 20:17:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:17:39,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:17:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 420 states and 562 transitions. [2024-11-13 20:17:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 562 transitions. [2024-11-13 20:17:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:17:40,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:40,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 423 states and 566 transitions. [2024-11-13 20:17:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 566 transitions. [2024-11-13 20:17:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 20:17:40,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:40,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 437 states and 582 transitions. [2024-11-13 20:17:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 582 transitions. [2024-11-13 20:17:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:17:40,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:40,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 440 states and 585 transitions. [2024-11-13 20:17:41,404 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 585 transitions. [2024-11-13 20:17:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:17:41,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:41,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:17:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 446 states and 590 transitions. [2024-11-13 20:17:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 590 transitions. [2024-11-13 20:17:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 20:17:41,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:17:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 447 states and 591 transitions. [2024-11-13 20:17:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 591 transitions. [2024-11-13 20:17:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 20:17:41,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:41,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 461 states and 607 transitions. [2024-11-13 20:17:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 607 transitions. [2024-11-13 20:17:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 20:17:42,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 472 states and 620 transitions. [2024-11-13 20:17:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 620 transitions. [2024-11-13 20:17:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 20:17:42,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:17:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 476 states and 625 transitions. [2024-11-13 20:17:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 625 transitions. [2024-11-13 20:17:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 20:17:42,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:17:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 489 states and 639 transitions. [2024-11-13 20:17:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 639 transitions. [2024-11-13 20:17:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:17:42,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:42,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 512 states and 665 transitions. [2024-11-13 20:17:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 665 transitions. [2024-11-13 20:17:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 20:17:43,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:17:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 521 states and 674 transitions. [2024-11-13 20:17:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 674 transitions. [2024-11-13 20:17:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 20:17:43,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:17:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 637 states and 798 transitions. [2024-11-13 20:17:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 798 transitions. [2024-11-13 20:17:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 20:17:45,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:45,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 52 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 679 states and 844 transitions. [2024-11-13 20:17:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 844 transitions. [2024-11-13 20:17:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 20:17:46,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 20:17:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 697 states and 863 transitions. [2024-11-13 20:17:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 863 transitions. [2024-11-13 20:17:46,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 20:17:46,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:46,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:17:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 703 states and 870 transitions. [2024-11-13 20:17:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 870 transitions. [2024-11-13 20:17:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 20:17:46,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:17:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 718 states and 888 transitions. [2024-11-13 20:17:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 888 transitions. [2024-11-13 20:17:46,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 20:17:46,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:46,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:17:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 719 states and 889 transitions. [2024-11-13 20:17:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 889 transitions. [2024-11-13 20:17:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 20:17:47,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:47,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:17:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 770 states and 957 transitions. [2024-11-13 20:17:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 957 transitions. [2024-11-13 20:17:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 20:17:49,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:17:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 776 states and 965 transitions. [2024-11-13 20:17:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 965 transitions. [2024-11-13 20:17:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 20:17:49,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:49,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 804 states and 996 transitions. [2024-11-13 20:17:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 996 transitions. [2024-11-13 20:17:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 20:17:50,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:50,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:17:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 809 states and 1000 transitions. [2024-11-13 20:17:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1000 transitions. [2024-11-13 20:17:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 20:17:50,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:17:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 822 states and 1013 transitions. [2024-11-13 20:17:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1013 transitions. [2024-11-13 20:17:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 20:17:50,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:50,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 20:17:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 823 states and 1016 transitions. [2024-11-13 20:17:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1016 transitions. [2024-11-13 20:17:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 20:17:50,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:50,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 20:17:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 824 states and 1016 transitions. [2024-11-13 20:17:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1016 transitions. [2024-11-13 20:17:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 20:17:51,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-13 20:17:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 825 states and 1018 transitions. [2024-11-13 20:17:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1018 transitions. [2024-11-13 20:17:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 20:17:51,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:51,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:17:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 869 states and 1063 transitions. [2024-11-13 20:17:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1063 transitions. [2024-11-13 20:17:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 20:17:52,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:52,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 20:17:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 880 states and 1076 transitions. [2024-11-13 20:17:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1076 transitions. [2024-11-13 20:17:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 20:17:53,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:17:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 896 states and 1091 transitions. [2024-11-13 20:17:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1091 transitions. [2024-11-13 20:17:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 20:17:53,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:53,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:17:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 904 states and 1098 transitions. [2024-11-13 20:17:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1098 transitions. [2024-11-13 20:17:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 20:17:53,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 20:17:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 906 states and 1100 transitions. [2024-11-13 20:17:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1100 transitions. [2024-11-13 20:17:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 20:17:54,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:17:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 933 states and 1133 transitions. [2024-11-13 20:17:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1133 transitions. [2024-11-13 20:17:54,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 20:17:54,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:54,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:17:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 946 states and 1147 transitions. [2024-11-13 20:17:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1147 transitions. [2024-11-13 20:17:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 20:17:54,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:54,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:17:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 950 states and 1155 transitions. [2024-11-13 20:17:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1155 transitions. [2024-11-13 20:17:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 20:17:55,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:17:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 951 states and 1157 transitions. [2024-11-13 20:17:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1157 transitions. [2024-11-13 20:17:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 20:17:55,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:55,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:17:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 952 states and 1157 transitions. [2024-11-13 20:17:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1157 transitions. [2024-11-13 20:17:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 20:17:56,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:17:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 953 states and 1157 transitions. [2024-11-13 20:17:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1157 transitions. [2024-11-13 20:17:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 20:17:56,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:56,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:17:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1025 states and 1231 transitions. [2024-11-13 20:17:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1231 transitions. [2024-11-13 20:17:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 20:17:58,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:17:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:17:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1046 states and 1259 transitions. [2024-11-13 20:17:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1259 transitions. [2024-11-13 20:17:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 20:17:59,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:17:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:17:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:17:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:18:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1047 states and 1259 transitions. [2024-11-13 20:18:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1259 transitions. [2024-11-13 20:18:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 20:18:00,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:18:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1049 states and 1260 transitions. [2024-11-13 20:18:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1260 transitions. [2024-11-13 20:18:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:18:00,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:18:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1074 states and 1287 transitions. [2024-11-13 20:18:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1287 transitions. [2024-11-13 20:18:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:18:00,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:01,366 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 20:18:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1172 states and 1400 transitions. [2024-11-13 20:18:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1400 transitions. [2024-11-13 20:18:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:18:03,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:04,197 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 20:18:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1177 states and 1405 transitions. [2024-11-13 20:18:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1405 transitions. [2024-11-13 20:18:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:18:04,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 20:18:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1201 states and 1427 transitions. [2024-11-13 20:18:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1427 transitions. [2024-11-13 20:18:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:18:05,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:05,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 20:18:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1202 states and 1427 transitions. [2024-11-13 20:18:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1427 transitions. [2024-11-13 20:18:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 20:18:05,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:05,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 171 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 20:18:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1243 states and 1488 transitions. [2024-11-13 20:18:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1488 transitions. [2024-11-13 20:18:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 20:18:08,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:08,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 137 proven. 37 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-13 20:18:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1275 states and 1524 transitions. [2024-11-13 20:18:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1524 transitions. [2024-11-13 20:18:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-13 20:18:10,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 127 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:18:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1319 states and 1581 transitions. [2024-11-13 20:18:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1581 transitions. [2024-11-13 20:18:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-13 20:18:12,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 127 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:18:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1334 states and 1600 transitions. [2024-11-13 20:18:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1600 transitions. [2024-11-13 20:18:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 20:18:13,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-13 20:18:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1338 states and 1603 transitions. [2024-11-13 20:18:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1603 transitions. [2024-11-13 20:18:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 20:18:14,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 20:18:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1356 states and 1627 transitions. [2024-11-13 20:18:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1627 transitions. [2024-11-13 20:18:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 20:18:15,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 20:18:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1360 states and 1632 transitions. [2024-11-13 20:18:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1632 transitions. [2024-11-13 20:18:15,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:18:15,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:18:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1475 states and 1765 transitions. [2024-11-13 20:18:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1765 transitions. [2024-11-13 20:18:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-13 20:18:18,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 20:18:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1514 states and 1810 transitions. [2024-11-13 20:18:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1810 transitions. [2024-11-13 20:18:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 20:18:20,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-13 20:18:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1515 states and 1810 transitions. [2024-11-13 20:18:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1810 transitions. [2024-11-13 20:18:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:18:21,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:21,542 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 20:18:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1589 states and 1902 transitions. [2024-11-13 20:18:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1902 transitions. [2024-11-13 20:18:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:18:24,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:24,445 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 20:18:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1592 states and 1906 transitions. [2024-11-13 20:18:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1906 transitions. [2024-11-13 20:18:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:18:24,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:25,036 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 20:18:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1605 states and 1919 transitions. [2024-11-13 20:18:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1919 transitions. [2024-11-13 20:18:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:18:25,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:25,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:26,173 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 20:18:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1618 states and 1933 transitions. [2024-11-13 20:18:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1933 transitions. [2024-11-13 20:18:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:18:27,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:27,282 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 20:18:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1623 states and 1937 transitions. [2024-11-13 20:18:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 1937 transitions. [2024-11-13 20:18:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 20:18:27,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 20:18:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1630 states and 1945 transitions. [2024-11-13 20:18:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1945 transitions. [2024-11-13 20:18:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 20:18:28,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 20:18:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1634 states and 1948 transitions. [2024-11-13 20:18:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1948 transitions. [2024-11-13 20:18:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-13 20:18:29,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:29,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 159 proven. 37 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-13 20:18:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1666 states and 1985 transitions. [2024-11-13 20:18:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 1985 transitions. [2024-11-13 20:18:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 20:18:31,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 20:18:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 1702 states and 2024 transitions. [2024-11-13 20:18:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2024 transitions. [2024-11-13 20:18:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 20:18:33,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-13 20:18:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 1725 states and 2053 transitions. [2024-11-13 20:18:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2053 transitions. [2024-11-13 20:18:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-13 20:18:35,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:35,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 216 proven. 58 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-13 20:18:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 1731 states and 2060 transitions. [2024-11-13 20:18:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2060 transitions. [2024-11-13 20:18:37,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:18:37,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:37,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:37,582 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 20:18:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 1766 states and 2104 transitions. [2024-11-13 20:18:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2104 transitions. [2024-11-13 20:18:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:18:39,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:40,039 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 20:18:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 1779 states and 2117 transitions. [2024-11-13 20:18:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2117 transitions. [2024-11-13 20:18:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:18:41,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:41,459 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 20:18:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 1784 states and 2121 transitions. [2024-11-13 20:18:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2121 transitions. [2024-11-13 20:18:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-13 20:18:42,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:42,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 185 proven. 56 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-13 20:18:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 1802 states and 2141 transitions. [2024-11-13 20:18:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2141 transitions. [2024-11-13 20:18:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 20:18:42,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:43,515 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 20:18:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 1897 states and 2248 transitions. [2024-11-13 20:18:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2248 transitions. [2024-11-13 20:18:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:18:45,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 20:18:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1907 states and 2262 transitions. [2024-11-13 20:18:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2262 transitions. [2024-11-13 20:18:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 20:18:47,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 192 proven. 60 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-13 20:18:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 1964 states and 2330 transitions. [2024-11-13 20:18:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2330 transitions. [2024-11-13 20:18:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 20:18:50,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:51,718 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 20:18:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2084 states and 2475 transitions. [2024-11-13 20:18:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2475 transitions. [2024-11-13 20:18:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 20:18:57,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:57,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:57,697 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 20:18:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:18:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2158 states and 2554 transitions. [2024-11-13 20:18:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2554 transitions. [2024-11-13 20:18:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 20:18:59,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:18:59,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:18:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:18:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 20:19:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2166 states and 2563 transitions. [2024-11-13 20:19:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2563 transitions. [2024-11-13 20:19:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 20:19:00,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 20:19:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2172 states and 2570 transitions. [2024-11-13 20:19:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2570 transitions. [2024-11-13 20:19:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 20:19:00,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 20:19:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2176 states and 2573 transitions. [2024-11-13 20:19:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2573 transitions. [2024-11-13 20:19:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-13 20:19:01,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 187 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 20:19:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2179 states and 2576 transitions. [2024-11-13 20:19:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2576 transitions. [2024-11-13 20:19:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-13 20:19:02,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 187 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 20:19:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2183 states and 2579 transitions. [2024-11-13 20:19:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2579 transitions. [2024-11-13 20:19:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-13 20:19:03,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:03,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 187 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 20:19:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2187 states and 2582 transitions. [2024-11-13 20:19:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 2582 transitions. [2024-11-13 20:19:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-13 20:19:04,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 280 proven. 23 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-13 20:19:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2218 states and 2619 transitions. [2024-11-13 20:19:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 2619 transitions. [2024-11-13 20:19:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-13 20:19:07,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:07,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 206 proven. 8 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-13 20:19:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2243 states and 2644 transitions. [2024-11-13 20:19:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2644 transitions. [2024-11-13 20:19:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-13 20:19:08,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:08,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 206 proven. 54 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:19:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2256 states and 2658 transitions. [2024-11-13 20:19:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2658 transitions. [2024-11-13 20:19:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-13 20:19:10,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:10,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 206 proven. 54 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:19:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2257 states and 2659 transitions. [2024-11-13 20:19:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2659 transitions. [2024-11-13 20:19:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:19:11,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-13 20:19:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2271 states and 2674 transitions. [2024-11-13 20:19:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 2674 transitions. [2024-11-13 20:19:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-13 20:19:11,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-13 20:19:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2275 states and 2679 transitions. [2024-11-13 20:19:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2679 transitions. [2024-11-13 20:19:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:19:12,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 20:19:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2295 states and 2704 transitions. [2024-11-13 20:19:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2704 transitions. [2024-11-13 20:19:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:19:14,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:14,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 20:19:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2302 states and 2710 transitions. [2024-11-13 20:19:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2710 transitions. [2024-11-13 20:19:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:19:14,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:14,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 20:19:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2311 states and 2717 transitions. [2024-11-13 20:19:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2717 transitions. [2024-11-13 20:19:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 20:19:15,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:15,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 20:19:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2313 states and 2719 transitions. [2024-11-13 20:19:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2719 transitions. [2024-11-13 20:19:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-13 20:19:16,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:16,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 20:19:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2327 states and 2734 transitions. [2024-11-13 20:19:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2734 transitions. [2024-11-13 20:19:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-13 20:19:17,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:17,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 20:19:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2328 states and 2734 transitions. [2024-11-13 20:19:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2734 transitions. [2024-11-13 20:19:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:19:17,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 20:19:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2344 states and 2750 transitions. [2024-11-13 20:19:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2750 transitions. [2024-11-13 20:19:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-13 20:19:18,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-13 20:19:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2345 states and 2750 transitions. [2024-11-13 20:19:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2750 transitions. [2024-11-13 20:19:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 20:19:19,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:19:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2414 states and 2823 transitions. [2024-11-13 20:19:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2823 transitions. [2024-11-13 20:19:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 20:19:22,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:19:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2423 states and 2833 transitions. [2024-11-13 20:19:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2833 transitions. [2024-11-13 20:19:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 20:19:23,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:23,641 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 20:19:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2447 states and 2860 transitions. [2024-11-13 20:19:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2860 transitions. [2024-11-13 20:19:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 20:19:25,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:25,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:26,610 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 20:19:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2472 states and 2887 transitions. [2024-11-13 20:19:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 2887 transitions. [2024-11-13 20:19:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 20:19:28,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2543 states and 2966 transitions. [2024-11-13 20:19:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 2966 transitions. [2024-11-13 20:19:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 20:19:35,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:19:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2548 states and 2970 transitions. [2024-11-13 20:19:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 2970 transitions. [2024-11-13 20:19:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 20:19:36,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:36,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:19:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2555 states and 2977 transitions. [2024-11-13 20:19:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 2977 transitions. [2024-11-13 20:19:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 20:19:37,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:37,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:19:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 2586 states and 3010 transitions. [2024-11-13 20:19:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3010 transitions. [2024-11-13 20:19:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:19:39,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:39,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-13 20:19:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 2591 states and 3014 transitions. [2024-11-13 20:19:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3014 transitions. [2024-11-13 20:19:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:19:40,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:40,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-13 20:19:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 2592 states and 3014 transitions. [2024-11-13 20:19:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3014 transitions. [2024-11-13 20:19:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:19:40,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-13 20:19:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 2606 states and 3028 transitions. [2024-11-13 20:19:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3028 transitions. [2024-11-13 20:19:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:19:40,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-13 20:19:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 2614 states and 3036 transitions. [2024-11-13 20:19:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3036 transitions. [2024-11-13 20:19:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:19:41,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-13 20:19:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 2615 states and 3036 transitions. [2024-11-13 20:19:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3036 transitions. [2024-11-13 20:19:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:19:42,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:19:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 2618 states and 3040 transitions. [2024-11-13 20:19:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3040 transitions. [2024-11-13 20:19:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 20:19:42,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 20:19:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 2736 states and 3161 transitions. [2024-11-13 20:19:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3161 transitions. [2024-11-13 20:19:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-13 20:19:45,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:45,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 288 proven. 59 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-11-13 20:19:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 2737 states and 3162 transitions. [2024-11-13 20:19:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3162 transitions. [2024-11-13 20:19:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 20:19:45,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:45,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:19:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 2801 states and 3245 transitions. [2024-11-13 20:19:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3245 transitions. [2024-11-13 20:19:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 20:19:52,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:52,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:19:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 2810 states and 3252 transitions. [2024-11-13 20:19:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 3252 transitions. [2024-11-13 20:19:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 20:19:53,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:53,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:19:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 2817 states and 3258 transitions. [2024-11-13 20:19:54,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 3258 transitions. [2024-11-13 20:19:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-13 20:19:54,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:54,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 269 proven. 117 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:19:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:19:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 2854 states and 3305 transitions. [2024-11-13 20:19:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3305 transitions. [2024-11-13 20:19:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 20:19:59,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:19:59,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:19:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:19:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 293 proven. 122 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:20:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 2881 states and 3338 transitions. [2024-11-13 20:20:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 3338 transitions. [2024-11-13 20:20:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 20:20:02,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 293 proven. 122 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:20:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 2892 states and 3351 transitions. [2024-11-13 20:20:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3351 transitions. [2024-11-13 20:20:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-13 20:20:04,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:04,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-13 20:20:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 2899 states and 3358 transitions. [2024-11-13 20:20:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 3358 transitions. [2024-11-13 20:20:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 20:20:05,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:05,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 272 proven. 120 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 20:20:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 2929 states and 3399 transitions. [2024-11-13 20:20:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3399 transitions. [2024-11-13 20:20:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 20:20:10,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:20:10,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:20:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:20:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:20:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:20:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 2986 states and 3490 transitions. [2024-11-13 20:20:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3490 transitions. [2024-11-13 20:20:18,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 20:20:18,409 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 145 iterations. [2024-11-13 20:20:18,420 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 20:20:53,419 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,419 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,420 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,420 INFO L77 FloydHoareUtils]: At program point L500-1(lines 40 585) the Hoare annotation is: (not (and (not (= ~a20~0 1)) (not (= ~a17~0 1)) (= ~a7~0 1))) [2024-11-13 20:20:53,420 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,420 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,420 INFO L75 FloydHoareUtils]: For program point L501(line 501) no Hoare annotation was computed. [2024-11-13 20:20:53,420 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,421 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,421 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,421 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,422 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,422 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,422 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,422 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,422 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,422 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,423 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,423 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,423 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,423 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,423 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,423 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,424 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,424 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,424 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,424 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,424 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,424 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,425 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,425 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,426 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,426 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,426 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,426 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,427 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,427 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,427 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,427 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,427 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,428 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,428 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,428 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,428 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,429 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,429 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,429 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,429 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,429 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 20:20:53,429 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,430 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 20:20:53,430 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,430 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,430 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,430 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,431 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,431 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,431 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,431 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 20:20:53,431 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,431 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,432 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,432 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,432 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,432 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,432 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,433 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,433 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,433 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 501) no Hoare annotation was computed. [2024-11-13 20:20:53,433 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,433 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,434 INFO L77 FloydHoareUtils]: At program point L497-1(lines 40 585) the Hoare annotation is: (not (and (not (= ~a20~0 1)) (not (= ~a17~0 1)) (= ~a7~0 1))) [2024-11-13 20:20:53,434 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,434 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,434 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-13 20:20:53,434 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse6 (= ~a7~0 1)) (.cse5 (= ~a20~0 ~a7~0)) (.cse7 (= ~a8~0 15)) (.cse4 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and (not .cse6) (not (and .cse0 .cse2 .cse7 .cse5))) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse0 .cse1 .cse8 .cse2))) [2024-11-13 20:20:53,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:20:53 ImpRootNode [2024-11-13 20:20:53,449 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:20:53,450 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:20:53,450 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:20:53,450 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:20:53,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:17:26" (3/4) ... [2024-11-13 20:20:53,454 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 20:20:53,467 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-13 20:20:53,468 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 20:20:53,469 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 20:20:53,470 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 20:20:53,621 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:20:53,621 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 20:20:53,621 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:20:53,622 INFO L158 Benchmark]: Toolchain (without parser) took 209909.90ms. Allocated memory was 109.1MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 81.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-13 20:20:53,623 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 83.9MB. Free memory is still 40.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:20:53,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 666.45ms. Allocated memory is still 109.1MB. Free memory was 81.7MB in the beginning and 54.8MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 20:20:53,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.65ms. Allocated memory is still 109.1MB. Free memory was 54.8MB in the beginning and 49.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:20:53,623 INFO L158 Benchmark]: Boogie Preprocessor took 86.10ms. Allocated memory is still 109.1MB. Free memory was 49.6MB in the beginning and 45.6MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:20:53,624 INFO L158 Benchmark]: RCFGBuilder took 2014.73ms. Allocated memory is still 109.1MB. Free memory was 45.6MB in the beginning and 55.0MB in the end (delta: -9.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-13 20:20:53,624 INFO L158 Benchmark]: CodeCheck took 206867.20ms. Allocated memory was 109.1MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 55.0MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-13 20:20:53,624 INFO L158 Benchmark]: Witness Printer took 171.38ms. Allocated memory is still 2.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:20:53,626 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: 171.8s, OverallIterations: 145, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411740 SdHoareTripleChecker+Valid, 1162.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410738 mSDsluCounter, 70057 SdHoareTripleChecker+Invalid, 988.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60403 mSDsCounter, 100579 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 888978 IncrementalHoareTripleChecker+Invalid, 989557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100579 mSolverCounterUnsat, 9654 mSDtfsCounter, 888978 mSolverCounterSat, 12.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169392 GetRequests, 162447 SyntacticMatches, 5881 SemanticMatches, 1064 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746256 ImplicationChecksByTransitivity, 115.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 31.4s InterpolantComputationTime, 25621 NumberOfCodeBlocks, 25621 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 25477 ConstructedInterpolants, 0 QuantifiedInterpolants, 142455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 144 InterpolantComputations, 85 PerfectInterpolantSequences, 24217/28164 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: 501]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a21 == 1)) && (a20 != 1)) && !((((a12 == 8) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && (a17 != 1)) && !((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a8 == 15))) && (a7 == 1)) && !((((a12 == 8) && (14 == a8)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((((!((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a21 == 1)) && (a20 != 1)) && !((((a12 == 8) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && (a17 != 1)) && !((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a8 == 15))) && (a7 == 1)) && !((((a12 == 8) && (14 == a8)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 83.9MB. Free memory is still 40.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 666.45ms. Allocated memory is still 109.1MB. Free memory was 81.7MB in the beginning and 54.8MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.65ms. Allocated memory is still 109.1MB. Free memory was 54.8MB in the beginning and 49.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.10ms. Allocated memory is still 109.1MB. Free memory was 49.6MB in the beginning and 45.6MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2014.73ms. Allocated memory is still 109.1MB. Free memory was 45.6MB in the beginning and 55.0MB in the end (delta: -9.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * CodeCheck took 206867.20ms. Allocated memory was 109.1MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 55.0MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 171.38ms. Allocated memory is still 2.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 20:20:53,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cb67d2f-2f08-4980-b0b1-e003423a1b16/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