./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label34.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b --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-d790fec [2024-12-05 23:32:29,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 23:32:29,834 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 23:32:29,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 23:32:29,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 23:32:29,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 23:32:29,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 23:32:29,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 23:32:29,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 23:32:29,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 23:32:29,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 23:32:29,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 23:32:29,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 23:32:29,858 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 23:32:29,858 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 23:32:29,858 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 23:32:29,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 23:32:29,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:32:29,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 23:32:29,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 23:32:29,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 23:32:29,859 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 23:32:29,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 23:32:29,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b 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-12-05 23:32:30,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 23:32:30,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 23:32:30,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 23:32:30,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 23:32:30,062 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 23:32:30,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label34.c [2024-12-05 23:32:32,632 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/data/c6eeea4fb/f2657a41ffce4cdba8fbfe0c6616bc94/FLAGa1e30bb81 [2024-12-05 23:32:32,893 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 23:32:32,894 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/sv-benchmarks/c/eca-rers2012/Problem01_label34.c [2024-12-05 23:32:32,904 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/data/c6eeea4fb/f2657a41ffce4cdba8fbfe0c6616bc94/FLAGa1e30bb81 [2024-12-05 23:32:33,218 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/data/c6eeea4fb/f2657a41ffce4cdba8fbfe0c6616bc94 [2024-12-05 23:32:33,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 23:32:33,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 23:32:33,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 23:32:33,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 23:32:33,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 23:32:33,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42366c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33, skipping insertion in model container [2024-12-05 23:32:33,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 23:32:33,488 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_de10ea23-672a-42f5-9e88-ca650d0875ea/sv-benchmarks/c/eca-rers2012/Problem01_label34.c[18605,18618] [2024-12-05 23:32:33,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:32:33,519 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 23:32:33,591 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_de10ea23-672a-42f5-9e88-ca650d0875ea/sv-benchmarks/c/eca-rers2012/Problem01_label34.c[18605,18618] [2024-12-05 23:32:33,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:32:33,617 INFO L204 MainTranslator]: Completed translation [2024-12-05 23:32:33,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33 WrapperNode [2024-12-05 23:32:33,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 23:32:33,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 23:32:33,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 23:32:33,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 23:32:33,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,673 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-05 23:32:33,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 23:32:33,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 23:32:33,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 23:32:33,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 23:32:33,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 23:32:33,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 23:32:33,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 23:32:33,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 23:32:33,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:32:33" (1/1) ... [2024-12-05 23:32:33,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:32:33,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 23:32:33,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 23:32:33,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 23:32:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 23:32:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 23:32:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 23:32:33,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 23:32:33,849 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 23:32:33,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 23:32:34,688 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-05 23:32:34,688 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 23:32:34,913 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 23:32:34,914 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-05 23:32:34,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:32:34 BoogieIcfgContainer [2024-12-05 23:32:34,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 23:32:34,915 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 23:32:34,915 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 23:32:34,924 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 23:32:34,924 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:32:34" (1/1) ... [2024-12-05 23:32:34,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 23:32:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-05 23:32:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-05 23:32:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-05 23:32:34,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:34,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2024-12-05 23:32:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2024-12-05 23:32:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-05 23:32:35,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:35,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:32:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 218 states and 308 transitions. [2024-12-05 23:32:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 308 transitions. [2024-12-05 23:32:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-12-05 23:32:36,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:36,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 222 states and 315 transitions. [2024-12-05 23:32:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 315 transitions. [2024-12-05 23:32:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-05 23:32:36,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:36,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:32:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 223 states and 317 transitions. [2024-12-05 23:32:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 317 transitions. [2024-12-05 23:32:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-05 23:32:37,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 232 states and 330 transitions. [2024-12-05 23:32:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 330 transitions. [2024-12-05 23:32:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-05 23:32:37,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:37,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 241 states and 339 transitions. [2024-12-05 23:32:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 339 transitions. [2024-12-05 23:32:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-05 23:32:37,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:37,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 243 states and 342 transitions. [2024-12-05 23:32:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 342 transitions. [2024-12-05 23:32:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-05 23:32:37,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:37,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 258 states and 362 transitions. [2024-12-05 23:32:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 362 transitions. [2024-12-05 23:32:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-05 23:32:38,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:38,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 273 states and 382 transitions. [2024-12-05 23:32:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 382 transitions. [2024-12-05 23:32:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-05 23:32:39,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:39,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 277 states and 387 transitions. [2024-12-05 23:32:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 387 transitions. [2024-12-05 23:32:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-05 23:32:39,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:39,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 281 states and 396 transitions. [2024-12-05 23:32:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 396 transitions. [2024-12-05 23:32:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-05 23:32:39,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 286 states and 402 transitions. [2024-12-05 23:32:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 402 transitions. [2024-12-05 23:32:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-05 23:32:39,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:39,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 301 states and 422 transitions. [2024-12-05 23:32:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2024-12-05 23:32:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-05 23:32:40,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:32:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 320 states and 447 transitions. [2024-12-05 23:32:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 447 transitions. [2024-12-05 23:32:40,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-05 23:32:40,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:40,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 335 states and 466 transitions. [2024-12-05 23:32:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 466 transitions. [2024-12-05 23:32:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-05 23:32:41,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 339 states and 470 transitions. [2024-12-05 23:32:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 470 transitions. [2024-12-05 23:32:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-05 23:32:41,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:32:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 352 states and 484 transitions. [2024-12-05 23:32:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 484 transitions. [2024-12-05 23:32:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-05 23:32:41,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:41,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:32:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 354 states and 485 transitions. [2024-12-05 23:32:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 485 transitions. [2024-12-05 23:32:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-05 23:32:42,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:32:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 362 states and 495 transitions. [2024-12-05 23:32:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 495 transitions. [2024-12-05 23:32:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-05 23:32:42,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 377 states and 512 transitions. [2024-12-05 23:32:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 512 transitions. [2024-12-05 23:32:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-05 23:32:42,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:42,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 387 states and 524 transitions. [2024-12-05 23:32:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 524 transitions. [2024-12-05 23:32:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-05 23:32:43,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:43,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 389 states and 527 transitions. [2024-12-05 23:32:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2024-12-05 23:32:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-05 23:32:43,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:43,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:32:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 416 states and 559 transitions. [2024-12-05 23:32:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 559 transitions. [2024-12-05 23:32:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-05 23:32:43,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:32:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 420 states and 562 transitions. [2024-12-05 23:32:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 562 transitions. [2024-12-05 23:32:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-05 23:32:43,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:43,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 423 states and 566 transitions. [2024-12-05 23:32:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 566 transitions. [2024-12-05 23:32:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-05 23:32:44,022 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 437 states and 582 transitions. [2024-12-05 23:32:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 582 transitions. [2024-12-05 23:32:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 23:32:44,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 440 states and 585 transitions. [2024-12-05 23:32:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 585 transitions. [2024-12-05 23:32:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 23:32:44,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:32:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 446 states and 590 transitions. [2024-12-05 23:32:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 590 transitions. [2024-12-05 23:32:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-05 23:32:44,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-05 23:32:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 447 states and 591 transitions. [2024-12-05 23:32:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 591 transitions. [2024-12-05 23:32:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-05 23:32:45,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 461 states and 607 transitions. [2024-12-05 23:32:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 607 transitions. [2024-12-05 23:32:45,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-05 23:32:45,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:45,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 472 states and 620 transitions. [2024-12-05 23:32:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 620 transitions. [2024-12-05 23:32:45,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-05 23:32:45,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 23:32:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 476 states and 625 transitions. [2024-12-05 23:32:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 625 transitions. [2024-12-05 23:32:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-05 23:32:45,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:45,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:32:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 489 states and 639 transitions. [2024-12-05 23:32:45,600 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 639 transitions. [2024-12-05 23:32:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 23:32:45,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:45,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 512 states and 665 transitions. [2024-12-05 23:32:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 665 transitions. [2024-12-05 23:32:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-05 23:32:45,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:45,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:32:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 521 states and 674 transitions. [2024-12-05 23:32:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 674 transitions. [2024-12-05 23:32:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-05 23:32:45,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:32:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 637 states and 798 transitions. [2024-12-05 23:32:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 798 transitions. [2024-12-05 23:32:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-05 23:32:47,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:47,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 52 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 679 states and 844 transitions. [2024-12-05 23:32:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 844 transitions. [2024-12-05 23:32:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-05 23:32:47,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-05 23:32:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 697 states and 863 transitions. [2024-12-05 23:32:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 863 transitions. [2024-12-05 23:32:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-05 23:32:47,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:32:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 703 states and 870 transitions. [2024-12-05 23:32:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 870 transitions. [2024-12-05 23:32:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-05 23:32:48,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:32:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 718 states and 888 transitions. [2024-12-05 23:32:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 888 transitions. [2024-12-05 23:32:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-05 23:32:48,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:48,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:32:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 719 states and 889 transitions. [2024-12-05 23:32:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 889 transitions. [2024-12-05 23:32:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-05 23:32:48,354 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:32:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 770 states and 957 transitions. [2024-12-05 23:32:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 957 transitions. [2024-12-05 23:32:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-05 23:32:49,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:32:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 776 states and 965 transitions. [2024-12-05 23:32:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 965 transitions. [2024-12-05 23:32:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-05 23:32:50,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:50,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 804 states and 996 transitions. [2024-12-05 23:32:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 996 transitions. [2024-12-05 23:32:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-05 23:32:50,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:50,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 23:32:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 809 states and 1000 transitions. [2024-12-05 23:32:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1000 transitions. [2024-12-05 23:32:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-05 23:32:50,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 23:32:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 822 states and 1013 transitions. [2024-12-05 23:32:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1013 transitions. [2024-12-05 23:32:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 23:32:50,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:50,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:32:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 823 states and 1016 transitions. [2024-12-05 23:32:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1016 transitions. [2024-12-05 23:32:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-05 23:32:51,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-12-05 23:32:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 824 states and 1016 transitions. [2024-12-05 23:32:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1016 transitions. [2024-12-05 23:32:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-05 23:32:51,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-12-05 23:32:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 825 states and 1018 transitions. [2024-12-05 23:32:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1018 transitions. [2024-12-05 23:32:51,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-05 23:32:51,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:51,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:32:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 869 states and 1063 transitions. [2024-12-05 23:32:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1063 transitions. [2024-12-05 23:32:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-05 23:32:52,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-05 23:32:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 880 states and 1076 transitions. [2024-12-05 23:32:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1076 transitions. [2024-12-05 23:32:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-05 23:32:52,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:52,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-05 23:32:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 903 states and 1098 transitions. [2024-12-05 23:32:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1098 transitions. [2024-12-05 23:32:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-05 23:32:52,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:52,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-05 23:32:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 906 states and 1099 transitions. [2024-12-05 23:32:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1099 transitions. [2024-12-05 23:32:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-05 23:32:52,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:52,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-05 23:32:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 908 states and 1101 transitions. [2024-12-05 23:32:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1101 transitions. [2024-12-05 23:32:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-05 23:32:53,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-05 23:32:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 935 states and 1134 transitions. [2024-12-05 23:32:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1134 transitions. [2024-12-05 23:32:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-05 23:32:53,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:53,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-05 23:32:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 948 states and 1148 transitions. [2024-12-05 23:32:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1148 transitions. [2024-12-05 23:32:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-05 23:32:53,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-05 23:32:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 952 states and 1156 transitions. [2024-12-05 23:32:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1156 transitions. [2024-12-05 23:32:54,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-05 23:32:54,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-05 23:32:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 953 states and 1158 transitions. [2024-12-05 23:32:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1158 transitions. [2024-12-05 23:32:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-05 23:32:54,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:32:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 954 states and 1158 transitions. [2024-12-05 23:32:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1158 transitions. [2024-12-05 23:32:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-05 23:32:54,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:54,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:32:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 955 states and 1158 transitions. [2024-12-05 23:32:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1158 transitions. [2024-12-05 23:32:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-05 23:32:54,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:54,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:32:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1027 states and 1232 transitions. [2024-12-05 23:32:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1232 transitions. [2024-12-05 23:32:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-05 23:32:56,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:56,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-05 23:32:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1048 states and 1260 transitions. [2024-12-05 23:32:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1260 transitions. [2024-12-05 23:32:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-05 23:32:57,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-05 23:32:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1049 states and 1260 transitions. [2024-12-05 23:32:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1260 transitions. [2024-12-05 23:32:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-05 23:32:57,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:32:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1051 states and 1261 transitions. [2024-12-05 23:32:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1261 transitions. [2024-12-05 23:32:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-05 23:32:57,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-05 23:32:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:32:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1076 states and 1288 transitions. [2024-12-05 23:32:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1288 transitions. [2024-12-05 23:32:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:32:57,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:32:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:32:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:32:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:33:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1161 states and 1387 transitions. [2024-12-05 23:33:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1387 transitions. [2024-12-05 23:33:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:33:00,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:00,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:33:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1174 states and 1401 transitions. [2024-12-05 23:33:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1401 transitions. [2024-12-05 23:33:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:33:00,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:00,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:33:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1179 states and 1406 transitions. [2024-12-05 23:33:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1406 transitions. [2024-12-05 23:33:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:33:01,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-05 23:33:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1203 states and 1428 transitions. [2024-12-05 23:33:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1428 transitions. [2024-12-05 23:33:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:33:01,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-05 23:33:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1204 states and 1428 transitions. [2024-12-05 23:33:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1428 transitions. [2024-12-05 23:33:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-05 23:33:02,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:02,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 171 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 23:33:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1245 states and 1489 transitions. [2024-12-05 23:33:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1489 transitions. [2024-12-05 23:33:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-05 23:33:04,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:04,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 137 proven. 37 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-12-05 23:33:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1277 states and 1525 transitions. [2024-12-05 23:33:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1525 transitions. [2024-12-05 23:33:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-12-05 23:33:05,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 127 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:33:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1321 states and 1583 transitions. [2024-12-05 23:33:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1583 transitions. [2024-12-05 23:33:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-05 23:33:07,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-12-05 23:33:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1325 states and 1586 transitions. [2024-12-05 23:33:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1586 transitions. [2024-12-05 23:33:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-05 23:33:08,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-05 23:33:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1343 states and 1609 transitions. [2024-12-05 23:33:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1609 transitions. [2024-12-05 23:33:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-05 23:33:08,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:08,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-05 23:33:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1347 states and 1614 transitions. [2024-12-05 23:33:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1614 transitions. [2024-12-05 23:33:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:33:09,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:33:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1462 states and 1747 transitions. [2024-12-05 23:33:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1747 transitions. [2024-12-05 23:33:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-05 23:33:11,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-05 23:33:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1501 states and 1792 transitions. [2024-12-05 23:33:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1792 transitions. [2024-12-05 23:33:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 23:33:13,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-12-05 23:33:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1502 states and 1792 transitions. [2024-12-05 23:33:13,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1792 transitions. [2024-12-05 23:33:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:33:13,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:33:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1576 states and 1881 transitions. [2024-12-05 23:33:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1881 transitions. [2024-12-05 23:33:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:33:15,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:33:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1592 states and 1901 transitions. [2024-12-05 23:33:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1901 transitions. [2024-12-05 23:33:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:33:17,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:33:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1605 states and 1915 transitions. [2024-12-05 23:33:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1915 transitions. [2024-12-05 23:33:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:33:18,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:18,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:33:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1610 states and 1919 transitions. [2024-12-05 23:33:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1919 transitions. [2024-12-05 23:33:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-05 23:33:18,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:33:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1617 states and 1927 transitions. [2024-12-05 23:33:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1927 transitions. [2024-12-05 23:33:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-05 23:33:19,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:19,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:33:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1621 states and 1930 transitions. [2024-12-05 23:33:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1930 transitions. [2024-12-05 23:33:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-05 23:33:19,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:19,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 159 proven. 37 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-12-05 23:33:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1653 states and 1967 transitions. [2024-12-05 23:33:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1967 transitions. [2024-12-05 23:33:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 23:33:21,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 23:33:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 1689 states and 2006 transitions. [2024-12-05 23:33:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2006 transitions. [2024-12-05 23:33:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 23:33:23,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:23,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-05 23:33:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1712 states and 2035 transitions. [2024-12-05 23:33:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2035 transitions. [2024-12-05 23:33:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-05 23:33:25,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:25,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 216 proven. 58 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-05 23:33:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 1718 states and 2042 transitions. [2024-12-05 23:33:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2042 transitions. [2024-12-05 23:33:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 23:33:26,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:26,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:33:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 1766 states and 2099 transitions. [2024-12-05 23:33:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2099 transitions. [2024-12-05 23:33:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 23:33:29,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:33:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 1771 states and 2103 transitions. [2024-12-05 23:33:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2103 transitions. [2024-12-05 23:33:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-05 23:33:30,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-05 23:33:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 1775 states and 2106 transitions. [2024-12-05 23:33:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2106 transitions. [2024-12-05 23:33:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-05 23:33:30,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:30,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 185 proven. 56 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-05 23:33:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 1793 states and 2126 transitions. [2024-12-05 23:33:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2126 transitions. [2024-12-05 23:33:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-05 23:33:31,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:31,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:33:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 1888 states and 2233 transitions. [2024-12-05 23:33:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2233 transitions. [2024-12-05 23:33:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:33:33,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-12-05 23:33:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 1898 states and 2243 transitions. [2024-12-05 23:33:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2243 transitions. [2024-12-05 23:33:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-05 23:33:34,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:34,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 192 proven. 60 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-12-05 23:33:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 1955 states and 2311 transitions. [2024-12-05 23:33:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2311 transitions. [2024-12-05 23:33:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-05 23:33:36,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:33:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2075 states and 2449 transitions. [2024-12-05 23:33:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2449 transitions. [2024-12-05 23:33:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-05 23:33:41,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:33:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2149 states and 2528 transitions. [2024-12-05 23:33:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2528 transitions. [2024-12-05 23:33:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-05 23:33:43,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-05 23:33:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2157 states and 2536 transitions. [2024-12-05 23:33:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2536 transitions. [2024-12-05 23:33:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-12-05 23:33:44,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:44,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 187 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-12-05 23:33:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2164 states and 2542 transitions. [2024-12-05 23:33:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2542 transitions. [2024-12-05 23:33:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-12-05 23:33:45,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:45,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 187 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-12-05 23:33:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2168 states and 2545 transitions. [2024-12-05 23:33:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2545 transitions. [2024-12-05 23:33:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-05 23:33:46,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 280 proven. 23 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-12-05 23:33:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2199 states and 2582 transitions. [2024-12-05 23:33:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 2582 transitions. [2024-12-05 23:33:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-12-05 23:33:48,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:48,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 206 proven. 8 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-12-05 23:33:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2224 states and 2607 transitions. [2024-12-05 23:33:49,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 2607 transitions. [2024-12-05 23:33:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-12-05 23:33:49,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-05 23:33:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2237 states and 2624 transitions. [2024-12-05 23:33:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2624 transitions. [2024-12-05 23:33:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-12-05 23:33:51,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:51,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-05 23:33:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2240 states and 2626 transitions. [2024-12-05 23:33:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2626 transitions. [2024-12-05 23:33:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 23:33:51,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:51,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-12-05 23:33:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2254 states and 2641 transitions. [2024-12-05 23:33:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2641 transitions. [2024-12-05 23:33:52,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 23:33:52,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:52,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-12-05 23:33:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2258 states and 2646 transitions. [2024-12-05 23:33:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2646 transitions. [2024-12-05 23:33:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 23:33:53,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-05 23:33:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2278 states and 2671 transitions. [2024-12-05 23:33:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2671 transitions. [2024-12-05 23:33:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 23:33:54,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:54,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-05 23:33:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2287 states and 2679 transitions. [2024-12-05 23:33:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2679 transitions. [2024-12-05 23:33:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 23:33:55,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:55,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-05 23:33:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2294 states and 2685 transitions. [2024-12-05 23:33:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2685 transitions. [2024-12-05 23:33:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-05 23:33:55,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-05 23:33:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2308 states and 2700 transitions. [2024-12-05 23:33:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2700 transitions. [2024-12-05 23:33:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-05 23:33:56,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-05 23:33:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2309 states and 2700 transitions. [2024-12-05 23:33:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2700 transitions. [2024-12-05 23:33:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 23:33:56,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:56,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 23:33:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2314 states and 2703 transitions. [2024-12-05 23:33:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 2703 transitions. [2024-12-05 23:33:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 23:33:57,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 23:33:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2328 states and 2718 transitions. [2024-12-05 23:33:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2718 transitions. [2024-12-05 23:33:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 23:33:58,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 23:33:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2329 states and 2718 transitions. [2024-12-05 23:33:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 2718 transitions. [2024-12-05 23:33:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 23:33:58,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:58,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:34:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2398 states and 2791 transitions. [2024-12-05 23:34:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2791 transitions. [2024-12-05 23:34:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-05 23:34:01,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:34:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2407 states and 2801 transitions. [2024-12-05 23:34:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 2801 transitions. [2024-12-05 23:34:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-05 23:34:02,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-12-05 23:34:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2431 states and 2828 transitions. [2024-12-05 23:34:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 2828 transitions. [2024-12-05 23:34:04,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:34:04,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:34:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2456 states and 2855 transitions. [2024-12-05 23:34:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 2855 transitions. [2024-12-05 23:34:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:34:06,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:06,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:34:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2527 states and 2934 transitions. [2024-12-05 23:34:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 2934 transitions. [2024-12-05 23:34:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 23:34:12,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:12,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:34:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2532 states and 2938 transitions. [2024-12-05 23:34:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 2938 transitions. [2024-12-05 23:34:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-05 23:34:13,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:13,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:34:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2539 states and 2945 transitions. [2024-12-05 23:34:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 2945 transitions. [2024-12-05 23:34:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-05 23:34:13,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:13,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-05 23:34:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2570 states and 2978 transitions. [2024-12-05 23:34:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 2978 transitions. [2024-12-05 23:34:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 23:34:15,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:15,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-12-05 23:34:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2576 states and 2982 transitions. [2024-12-05 23:34:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 2982 transitions. [2024-12-05 23:34:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 23:34:15,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:15,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-12-05 23:34:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2584 states and 2990 transitions. [2024-12-05 23:34:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 2990 transitions. [2024-12-05 23:34:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 23:34:16,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:16,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-12-05 23:34:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 2598 states and 3005 transitions. [2024-12-05 23:34:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3005 transitions. [2024-12-05 23:34:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 23:34:17,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-12-05 23:34:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 2606 states and 3013 transitions. [2024-12-05 23:34:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3013 transitions. [2024-12-05 23:34:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 23:34:17,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:34:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 2609 states and 3017 transitions. [2024-12-05 23:34:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3017 transitions. [2024-12-05 23:34:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 23:34:17,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:17,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-05 23:34:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 2736 states and 3148 transitions. [2024-12-05 23:34:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3148 transitions. [2024-12-05 23:34:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-05 23:34:20,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:20,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-12-05 23:34:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 2743 states and 3155 transitions. [2024-12-05 23:34:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 3155 transitions. [2024-12-05 23:34:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 23:34:22,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:22,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:34:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 2793 states and 3222 transitions. [2024-12-05 23:34:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 3222 transitions. [2024-12-05 23:34:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 23:34:28,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:28,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:34:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 2816 states and 3245 transitions. [2024-12-05 23:34:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 3245 transitions. [2024-12-05 23:34:29,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 23:34:29,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:29,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:34:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 2823 states and 3251 transitions. [2024-12-05 23:34:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3251 transitions. [2024-12-05 23:34:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-12-05 23:34:30,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:30,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 293 proven. 122 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-05 23:34:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 2850 states and 3284 transitions. [2024-12-05 23:34:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 3284 transitions. [2024-12-05 23:34:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-05 23:34:33,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:33,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-05 23:34:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 2907 states and 3365 transitions. [2024-12-05 23:34:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3365 transitions. [2024-12-05 23:34:40,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-05 23:34:40,457 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 136 iterations. [2024-12-05 23:34:40,465 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-05 23:35:08,726 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,727 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-12-05 23:35:08,728 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-12-05 23:35:08,728 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-12-05 23:35:08,728 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-12-05 23:35:08,728 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-12-05 23:35:08,728 INFO L75 FloydHoareUtils]: For program point L501(line 501) no Hoare annotation was computed. [2024-12-05 23:35:08,729 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-12-05 23:35:08,729 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-12-05 23:35:08,729 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-12-05 23:35:08,729 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,729 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-12-05 23:35:08,730 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,730 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-12-05 23:35:08,730 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-12-05 23:35:08,730 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-12-05 23:35:08,731 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-12-05 23:35:08,731 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-12-05 23:35:08,731 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-12-05 23:35:08,732 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-12-05 23:35:08,732 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-12-05 23:35:08,732 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-12-05 23:35:08,732 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-12-05 23:35:08,732 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-12-05 23:35:08,733 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-12-05 23:35:08,733 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,733 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-12-05 23:35:08,733 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,733 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-12-05 23:35:08,734 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-12-05 23:35:08,734 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-12-05 23:35:08,734 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-12-05 23:35:08,734 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-12-05 23:35:08,734 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,734 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-12-05 23:35:08,735 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-12-05 23:35:08,735 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-12-05 23:35:08,735 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,735 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-12-05 23:35:08,735 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-12-05 23:35:08,735 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,736 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-12-05 23:35:08,736 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-12-05 23:35:08,736 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-12-05 23:35:08,736 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-12-05 23:35:08,736 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-12-05 23:35:08,736 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-12-05 23:35:08,737 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-12-05 23:35:08,737 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-05 23:35:08,737 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,737 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-05 23:35:08,737 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-12-05 23:35:08,737 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-12-05 23:35:08,737 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-12-05 23:35:08,738 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,738 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-12-05 23:35:08,738 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-12-05 23:35:08,738 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-12-05 23:35:08,738 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-05 23:35:08,738 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-12-05 23:35:08,739 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-12-05 23:35:08,739 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,739 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-12-05 23:35:08,739 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-12-05 23:35:08,739 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-12-05 23:35:08,739 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-12-05 23:35:08,740 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-12-05 23:35:08,740 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-12-05 23:35:08,740 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 501) no Hoare annotation was computed. [2024-12-05 23:35:08,740 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-12-05 23:35:08,740 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-12-05 23:35:08,740 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-12-05 23:35:08,741 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-12-05 23:35:08,741 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-12-05 23:35:08,741 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-12-05 23:35:08,741 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~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 .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-12-05 23:35:08,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 11:35:08 ImpRootNode [2024-12-05 23:35:08,755 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 23:35:08,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 23:35:08,756 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 23:35:08,756 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 23:35:08,757 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:32:34" (3/4) ... [2024-12-05 23:35:08,758 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-05 23:35:08,772 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-12-05 23:35:08,773 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-12-05 23:35:08,774 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-05 23:35:08,775 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-05 23:35:08,893 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 23:35:08,893 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 23:35:08,894 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 23:35:08,895 INFO L158 Benchmark]: Toolchain (without parser) took 155673.55ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 91.3MB in the beginning and 868.3MB in the end (delta: -777.0MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-12-05 23:35:08,895 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:35:08,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.15ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 64.1MB in the end (delta: 27.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-05 23:35:08,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.03ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 58.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:35:08,896 INFO L158 Benchmark]: Boogie Preprocessor took 52.88ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 54.6MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:35:08,896 INFO L158 Benchmark]: RCFGBuilder took 1186.45ms. Allocated memory is still 117.4MB. Free memory was 54.6MB in the beginning and 72.0MB in the end (delta: -17.4MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-12-05 23:35:08,897 INFO L158 Benchmark]: CodeCheck took 153840.51ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 72.0MB in the beginning and 880.9MB in the end (delta: -808.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-12-05 23:35:08,897 INFO L158 Benchmark]: Witness Printer took 137.88ms. Allocated memory is still 2.1GB. Free memory was 880.9MB in the beginning and 868.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-05 23:35:08,900 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: 125.5s, OverallIterations: 136, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363672 SdHoareTripleChecker+Valid, 766.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 362733 mSDsluCounter, 62254 SdHoareTripleChecker+Invalid, 649.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53597 mSDsCounter, 92032 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 786858 IncrementalHoareTripleChecker+Invalid, 878890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92032 mSolverCounterUnsat, 8657 mSDtfsCounter, 786858 mSolverCounterSat, 6.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155677 GetRequests, 149569 SyntacticMatches, 5102 SemanticMatches, 1006 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659583 ImplicationChecksByTransitivity, 83.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 23446 NumberOfCodeBlocks, 23446 NumberOfCodeBlocksAsserted, 135 NumberOfCheckSat, 23311 ConstructedInterpolants, 0 QuantifiedInterpolants, 122520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 135 InterpolantComputations, 85 PerfectInterpolantSequences, 21529/24829 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, ConComCheckerStatistics: 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.28ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.15ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 64.1MB in the end (delta: 27.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.03ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 58.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.88ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 54.6MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1186.45ms. Allocated memory is still 117.4MB. Free memory was 54.6MB in the beginning and 72.0MB in the end (delta: -17.4MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * CodeCheck took 153840.51ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 72.0MB in the beginning and 880.9MB in the end (delta: -808.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 137.88ms. Allocated memory is still 2.1GB. Free memory was 880.9MB in the beginning and 868.3MB 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-12-05 23:35:08,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de10ea23-672a-42f5-9e88-ca650d0875ea/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE