./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label22.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_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/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_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label22.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/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_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/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 4d8ab50842d069074a372df0f6486f85fb04e0716bd5a388e751a6626a969998 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:45:11,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:45:11,465 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:45:11,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:45:11,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:45:11,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:45:11,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:45:11,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:45:11,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:45:11,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:45:11,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:45:11,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:45:11,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:45:11,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:45:11,493 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:45:11,493 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:45:11,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:45:11,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:45:11,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:45:11,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:45:11,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:45:11,494 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:45:11,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:45:11,494 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_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/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 -> 4d8ab50842d069074a372df0f6486f85fb04e0716bd5a388e751a6626a969998 [2024-12-06 05:45:11,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:45:11,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:45:11,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:45:11,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:45:11,746 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:45:11,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label22.c [2024-12-06 05:45:14,367 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/data/8844b5647/02eb83834e0b413ab082ac8410dd8fc1/FLAG7ecc63f67 [2024-12-06 05:45:14,625 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:45:14,626 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/sv-benchmarks/c/eca-rers2012/Problem01_label22.c [2024-12-06 05:45:14,637 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/data/8844b5647/02eb83834e0b413ab082ac8410dd8fc1/FLAG7ecc63f67 [2024-12-06 05:45:14,917 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/data/8844b5647/02eb83834e0b413ab082ac8410dd8fc1 [2024-12-06 05:45:14,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:45:14,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:45:14,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:45:14,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:45:14,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:45:14,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:45:14" (1/1) ... [2024-12-06 05:45:14,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a547f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:14, skipping insertion in model container [2024-12-06 05:45:14,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:45:14" (1/1) ... [2024-12-06 05:45:14,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:45:15,189 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_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/sv-benchmarks/c/eca-rers2012/Problem01_label22.c[21338,21351] [2024-12-06 05:45:15,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:45:15,213 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:45:15,299 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_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/sv-benchmarks/c/eca-rers2012/Problem01_label22.c[21338,21351] [2024-12-06 05:45:15,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:45:15,318 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:45:15,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15 WrapperNode [2024-12-06 05:45:15,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:45:15,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:45:15,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:45:15,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:45:15,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,370 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 05:45:15,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:45:15,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:45:15,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:45:15,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:45:15,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:45:15,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:45:15,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:45:15,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:45:15,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:15" (1/1) ... [2024-12-06 05:45:15,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:45:15,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:45:15,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:45:15,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:45:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:45:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:45:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:45:15,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:45:15,534 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:45:15,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:45:16,332 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 05:45:16,332 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:45:16,514 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:45:16,514 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 05:45:16,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:45:16 BoogieIcfgContainer [2024-12-06 05:45:16,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:45:16,516 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:45:16,516 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:45:16,522 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:45:16,522 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:45:16" (1/1) ... [2024-12-06 05:45:16,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:45:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 05:45:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 05:45:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 05:45:16,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:16,977 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-06 05:45:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-12-06 05:45:17,486 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-12-06 05:45:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 05:45:17,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:17,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 218 states and 307 transitions. [2024-12-06 05:45:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 307 transitions. [2024-12-06 05:45:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 05:45:18,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 223 states and 315 transitions. [2024-12-06 05:45:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 315 transitions. [2024-12-06 05:45:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 05:45:19,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 295 states and 389 transitions. [2024-12-06 05:45:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 389 transitions. [2024-12-06 05:45:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-06 05:45:20,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 298 states and 393 transitions. [2024-12-06 05:45:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 393 transitions. [2024-12-06 05:45:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-06 05:45:20,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:20,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 299 states and 395 transitions. [2024-12-06 05:45:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 395 transitions. [2024-12-06 05:45:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 05:45:21,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 307 states and 410 transitions. [2024-12-06 05:45:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 410 transitions. [2024-12-06 05:45:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-06 05:45:21,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 310 states and 414 transitions. [2024-12-06 05:45:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 414 transitions. [2024-12-06 05:45:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 05:45:21,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:45:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 314 states and 423 transitions. [2024-12-06 05:45:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2024-12-06 05:45:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 05:45:22,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:22,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:45:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 317 states and 427 transitions. [2024-12-06 05:45:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 427 transitions. [2024-12-06 05:45:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 05:45:22,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 328 states and 444 transitions. [2024-12-06 05:45:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 444 transitions. [2024-12-06 05:45:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 05:45:23,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:23,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:23,442 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-06 05:45:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 335 states and 454 transitions. [2024-12-06 05:45:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2024-12-06 05:45:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 05:45:23,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:23,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:23,891 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-06 05:45:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 338 states and 458 transitions. [2024-12-06 05:45:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 458 transitions. [2024-12-06 05:45:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 05:45:24,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:24,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:24,114 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-06 05:45:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 344 states and 467 transitions. [2024-12-06 05:45:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 467 transitions. [2024-12-06 05:45:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 05:45:24,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:24,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 348 states and 473 transitions. [2024-12-06 05:45:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 473 transitions. [2024-12-06 05:45:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 05:45:25,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:25,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:25,439 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-06 05:45:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 352 states and 479 transitions. [2024-12-06 05:45:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 479 transitions. [2024-12-06 05:45:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-06 05:45:25,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:25,873 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-06 05:45:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 362 states and 492 transitions. [2024-12-06 05:45:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 492 transitions. [2024-12-06 05:45:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-06 05:45:26,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:26,558 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-06 05:45:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 365 states and 496 transitions. [2024-12-06 05:45:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 496 transitions. [2024-12-06 05:45:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-06 05:45:26,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 367 states and 499 transitions. [2024-12-06 05:45:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 499 transitions. [2024-12-06 05:45:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 05:45:27,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:27,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:27,461 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-06 05:45:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 370 states and 503 transitions. [2024-12-06 05:45:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 503 transitions. [2024-12-06 05:45:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 05:45:27,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:27,891 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-06 05:45:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 371 states and 503 transitions. [2024-12-06 05:45:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 503 transitions. [2024-12-06 05:45:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 05:45:28,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:28,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:28,088 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-06 05:45:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 378 states and 511 transitions. [2024-12-06 05:45:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 511 transitions. [2024-12-06 05:45:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 05:45:28,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:28,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 386 states and 520 transitions. [2024-12-06 05:45:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 520 transitions. [2024-12-06 05:45:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 05:45:28,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:28,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 388 states and 523 transitions. [2024-12-06 05:45:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 523 transitions. [2024-12-06 05:45:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 05:45:28,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:45:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 395 states and 530 transitions. [2024-12-06 05:45:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 530 transitions. [2024-12-06 05:45:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 05:45:28,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 404 states and 540 transitions. [2024-12-06 05:45:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 540 transitions. [2024-12-06 05:45:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-06 05:45:29,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:29,383 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-06 05:45:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 410 states and 546 transitions. [2024-12-06 05:45:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 546 transitions. [2024-12-06 05:45:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 05:45:29,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:29,598 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-06 05:45:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 427 states and 564 transitions. [2024-12-06 05:45:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 564 transitions. [2024-12-06 05:45:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 05:45:29,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 428 states and 566 transitions. [2024-12-06 05:45:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 566 transitions. [2024-12-06 05:45:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 05:45:29,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:29,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:29,991 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-06 05:45:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 431 states and 570 transitions. [2024-12-06 05:45:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 570 transitions. [2024-12-06 05:45:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 05:45:30,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:30,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:30,291 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-06 05:45:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 437 states and 576 transitions. [2024-12-06 05:45:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 576 transitions. [2024-12-06 05:45:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 05:45:30,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 438 states and 578 transitions. [2024-12-06 05:45:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 578 transitions. [2024-12-06 05:45:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 05:45:30,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:45:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 458 states and 599 transitions. [2024-12-06 05:45:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 599 transitions. [2024-12-06 05:45:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-06 05:45:31,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:31,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:45:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 459 states and 601 transitions. [2024-12-06 05:45:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 601 transitions. [2024-12-06 05:45:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-06 05:45:31,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:31,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 462 states and 604 transitions. [2024-12-06 05:45:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 604 transitions. [2024-12-06 05:45:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 05:45:31,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:31,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:31,555 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-06 05:45:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 465 states and 610 transitions. [2024-12-06 05:45:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 610 transitions. [2024-12-06 05:45:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 05:45:31,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:31,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:45:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 466 states and 610 transitions. [2024-12-06 05:45:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 610 transitions. [2024-12-06 05:45:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 05:45:31,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:31,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 568 states and 724 transitions. [2024-12-06 05:45:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 724 transitions. [2024-12-06 05:45:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 05:45:34,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 571 states and 727 transitions. [2024-12-06 05:45:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 727 transitions. [2024-12-06 05:45:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 05:45:34,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 573 states and 730 transitions. [2024-12-06 05:45:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 730 transitions. [2024-12-06 05:45:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 05:45:34,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:34,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 576 states and 735 transitions. [2024-12-06 05:45:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 735 transitions. [2024-12-06 05:45:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 05:45:35,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:35,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 05:45:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 582 states and 743 transitions. [2024-12-06 05:45:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 743 transitions. [2024-12-06 05:45:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 05:45:35,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:45:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 584 states and 745 transitions. [2024-12-06 05:45:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 745 transitions. [2024-12-06 05:45:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 05:45:36,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 593 states and 754 transitions. [2024-12-06 05:45:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 754 transitions. [2024-12-06 05:45:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 05:45:36,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:36,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 628 states and 792 transitions. [2024-12-06 05:45:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 792 transitions. [2024-12-06 05:45:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-06 05:45:36,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 636 states and 802 transitions. [2024-12-06 05:45:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 802 transitions. [2024-12-06 05:45:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 05:45:37,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 650 states and 819 transitions. [2024-12-06 05:45:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 819 transitions. [2024-12-06 05:45:37,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 05:45:37,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:37,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 762 states and 948 transitions. [2024-12-06 05:45:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 948 transitions. [2024-12-06 05:45:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 05:45:40,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 765 states and 951 transitions. [2024-12-06 05:45:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 951 transitions. [2024-12-06 05:45:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 05:45:40,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:40,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 771 states and 960 transitions. [2024-12-06 05:45:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 960 transitions. [2024-12-06 05:45:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 05:45:41,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 773 states and 961 transitions. [2024-12-06 05:45:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 961 transitions. [2024-12-06 05:45:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 05:45:42,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:42,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:45:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 788 states and 988 transitions. [2024-12-06 05:45:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 988 transitions. [2024-12-06 05:45:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-06 05:45:43,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:45:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 799 states and 998 transitions. [2024-12-06 05:45:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 998 transitions. [2024-12-06 05:45:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-06 05:45:44,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 807 states and 1010 transitions. [2024-12-06 05:45:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1010 transitions. [2024-12-06 05:45:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-12-06 05:45:44,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 808 states and 1011 transitions. [2024-12-06 05:45:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1011 transitions. [2024-12-06 05:45:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 05:45:44,221 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:45:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 815 states and 1020 transitions. [2024-12-06 05:45:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1020 transitions. [2024-12-06 05:45:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 05:45:45,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:45,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:45:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 820 states and 1026 transitions. [2024-12-06 05:45:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1026 transitions. [2024-12-06 05:45:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 05:45:45,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:45,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 823 states and 1029 transitions. [2024-12-06 05:45:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1029 transitions. [2024-12-06 05:45:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 05:45:45,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-12-06 05:45:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 832 states and 1039 transitions. [2024-12-06 05:45:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1039 transitions. [2024-12-06 05:45:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 05:45:46,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 853 states and 1066 transitions. [2024-12-06 05:45:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1066 transitions. [2024-12-06 05:45:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 05:45:47,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 944 states and 1167 transitions. [2024-12-06 05:45:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1167 transitions. [2024-12-06 05:45:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 05:45:48,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:45:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 947 states and 1168 transitions. [2024-12-06 05:45:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1168 transitions. [2024-12-06 05:45:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 05:45:48,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:45:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 950 states and 1173 transitions. [2024-12-06 05:45:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1173 transitions. [2024-12-06 05:45:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 05:45:49,674 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:49,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 05:45:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 960 states and 1185 transitions. [2024-12-06 05:45:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1185 transitions. [2024-12-06 05:45:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 05:45:50,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:45:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 963 states and 1189 transitions. [2024-12-06 05:45:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1189 transitions. [2024-12-06 05:45:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 05:45:50,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:50,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 966 states and 1193 transitions. [2024-12-06 05:45:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1193 transitions. [2024-12-06 05:45:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 05:45:50,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 62 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 967 states and 1193 transitions. [2024-12-06 05:45:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1193 transitions. [2024-12-06 05:45:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 05:45:50,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:50,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 982 states and 1210 transitions. [2024-12-06 05:45:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1210 transitions. [2024-12-06 05:45:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 05:45:50,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 64 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1021 states and 1259 transitions. [2024-12-06 05:45:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1259 transitions. [2024-12-06 05:45:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 05:45:53,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1024 states and 1263 transitions. [2024-12-06 05:45:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1263 transitions. [2024-12-06 05:45:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 05:45:53,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:53,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-12-06 05:45:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1031 states and 1270 transitions. [2024-12-06 05:45:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1270 transitions. [2024-12-06 05:45:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 05:45:53,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:45:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1114 states and 1363 transitions. [2024-12-06 05:45:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1363 transitions. [2024-12-06 05:45:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 05:45:55,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1120 states and 1369 transitions. [2024-12-06 05:45:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1369 transitions. [2024-12-06 05:45:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 05:45:56,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:56,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-06 05:45:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1123 states and 1373 transitions. [2024-12-06 05:45:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1373 transitions. [2024-12-06 05:45:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 05:45:56,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 05:45:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1195 states and 1452 transitions. [2024-12-06 05:45:58,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1452 transitions. [2024-12-06 05:45:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 05:45:58,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:58,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:58,972 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-06 05:45:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1205 states and 1464 transitions. [2024-12-06 05:45:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1464 transitions. [2024-12-06 05:45:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-06 05:45:59,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:59,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1223 states and 1487 transitions. [2024-12-06 05:46:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1487 transitions. [2024-12-06 05:46:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 05:46:00,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:46:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1224 states and 1488 transitions. [2024-12-06 05:46:00,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1488 transitions. [2024-12-06 05:46:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 05:46:00,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 05:46:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1359 states and 1636 transitions. [2024-12-06 05:46:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1636 transitions. [2024-12-06 05:46:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 05:46:05,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:05,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1396 states and 1677 transitions. [2024-12-06 05:46:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1677 transitions. [2024-12-06 05:46:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 05:46:07,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:07,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1415 states and 1707 transitions. [2024-12-06 05:46:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1707 transitions. [2024-12-06 05:46:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 05:46:08,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1423 states and 1713 transitions. [2024-12-06 05:46:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1713 transitions. [2024-12-06 05:46:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 05:46:09,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1441 states and 1732 transitions. [2024-12-06 05:46:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1732 transitions. [2024-12-06 05:46:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 05:46:11,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:11,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1447 states and 1737 transitions. [2024-12-06 05:46:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1737 transitions. [2024-12-06 05:46:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 05:46:12,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1448 states and 1738 transitions. [2024-12-06 05:46:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1738 transitions. [2024-12-06 05:46:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-12-06 05:46:12,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 124 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1449 states and 1738 transitions. [2024-12-06 05:46:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1738 transitions. [2024-12-06 05:46:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 05:46:12,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:12,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 128 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1451 states and 1739 transitions. [2024-12-06 05:46:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1739 transitions. [2024-12-06 05:46:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 05:46:12,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:12,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 128 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1453 states and 1740 transitions. [2024-12-06 05:46:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1740 transitions. [2024-12-06 05:46:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 05:46:13,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 128 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1460 states and 1747 transitions. [2024-12-06 05:46:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1747 transitions. [2024-12-06 05:46:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 05:46:14,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:46:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1464 states and 1752 transitions. [2024-12-06 05:46:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1752 transitions. [2024-12-06 05:46:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 05:46:15,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:46:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1465 states and 1752 transitions. [2024-12-06 05:46:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1752 transitions. [2024-12-06 05:46:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 05:46:15,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:15,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:46:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1468 states and 1755 transitions. [2024-12-06 05:46:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1755 transitions. [2024-12-06 05:46:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 05:46:15,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:46:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1497 states and 1785 transitions. [2024-12-06 05:46:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1785 transitions. [2024-12-06 05:46:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-06 05:46:16,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:16,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:46:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1511 states and 1802 transitions. [2024-12-06 05:46:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1802 transitions. [2024-12-06 05:46:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-06 05:46:18,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:46:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1542 states and 1833 transitions. [2024-12-06 05:46:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1833 transitions. [2024-12-06 05:46:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-06 05:46:19,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:19,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:46:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1553 states and 1842 transitions. [2024-12-06 05:46:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1842 transitions. [2024-12-06 05:46:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-06 05:46:19,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:19,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:46:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1569 states and 1857 transitions. [2024-12-06 05:46:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1857 transitions. [2024-12-06 05:46:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-06 05:46:20,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:46:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1572 states and 1860 transitions. [2024-12-06 05:46:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1860 transitions. [2024-12-06 05:46:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 05:46:21,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1586 states and 1883 transitions. [2024-12-06 05:46:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1883 transitions. [2024-12-06 05:46:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 05:46:24,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1599 states and 1894 transitions. [2024-12-06 05:46:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 1894 transitions. [2024-12-06 05:46:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 05:46:25,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:25,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1628 states and 1924 transitions. [2024-12-06 05:46:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1924 transitions. [2024-12-06 05:46:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 05:46:26,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1629 states and 1924 transitions. [2024-12-06 05:46:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 1924 transitions. [2024-12-06 05:46:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 05:46:27,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:27,582 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-06 05:46:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1682 states and 1996 transitions. [2024-12-06 05:46:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 1996 transitions. [2024-12-06 05:46:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 05:46:31,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:31,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:31,462 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-06 05:46:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1707 states and 2023 transitions. [2024-12-06 05:46:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2023 transitions. [2024-12-06 05:46:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 05:46:33,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:33,530 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-06 05:46:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 1712 states and 2027 transitions. [2024-12-06 05:46:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2027 transitions. [2024-12-06 05:46:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-12-06 05:46:33,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:33,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 140 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:46:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 1726 states and 2044 transitions. [2024-12-06 05:46:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2044 transitions. [2024-12-06 05:46:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-12-06 05:46:34,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 140 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:46:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 1728 states and 2045 transitions. [2024-12-06 05:46:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2045 transitions. [2024-12-06 05:46:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-06 05:46:35,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 1770 states and 2097 transitions. [2024-12-06 05:46:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2097 transitions. [2024-12-06 05:46:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 05:46:38,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:38,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-12-06 05:46:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1821 states and 2155 transitions. [2024-12-06 05:46:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2155 transitions. [2024-12-06 05:46:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 05:46:40,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:46:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 1832 states and 2168 transitions. [2024-12-06 05:46:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2168 transitions. [2024-12-06 05:46:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-06 05:46:41,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:41,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:46:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 1835 states and 2177 transitions. [2024-12-06 05:46:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2177 transitions. [2024-12-06 05:46:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-06 05:46:43,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:46:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 1867 states and 2216 transitions. [2024-12-06 05:46:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2216 transitions. [2024-12-06 05:46:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-06 05:46:44,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:44,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:46:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 1868 states and 2218 transitions. [2024-12-06 05:46:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2218 transitions. [2024-12-06 05:46:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-06 05:46:45,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:45,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:45,328 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-06 05:46:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 1870 states and 2222 transitions. [2024-12-06 05:46:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2222 transitions. [2024-12-06 05:46:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-12-06 05:46:46,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 117 proven. 58 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:46:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 1900 states and 2258 transitions. [2024-12-06 05:46:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2258 transitions. [2024-12-06 05:46:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-12-06 05:46:48,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:48,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 145 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:46:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 1907 states and 2266 transitions. [2024-12-06 05:46:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2266 transitions. [2024-12-06 05:46:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:46:49,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:49,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:50,455 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-06 05:46:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 1973 states and 2369 transitions. [2024-12-06 05:46:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2369 transitions. [2024-12-06 05:46:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:46:58,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:58,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:58,810 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-06 05:47:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 1987 states and 2385 transitions. [2024-12-06 05:47:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2385 transitions. [2024-12-06 05:47:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:47:01,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:01,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:01,790 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-06 05:47:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 1988 states and 2386 transitions. [2024-12-06 05:47:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2386 transitions. [2024-12-06 05:47:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:47:02,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:02,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:02,563 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-06 05:47:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2005 states and 2405 transitions. [2024-12-06 05:47:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2405 transitions. [2024-12-06 05:47:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:47:04,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:04,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:04,367 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-06 05:47:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2008 states and 2407 transitions. [2024-12-06 05:47:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2407 transitions. [2024-12-06 05:47:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:47:04,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:04,681 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-06 05:47:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2020 states and 2421 transitions. [2024-12-06 05:47:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2421 transitions. [2024-12-06 05:47:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:47:06,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:06,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:06,538 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-06 05:47:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2025 states and 2426 transitions. [2024-12-06 05:47:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2426 transitions. [2024-12-06 05:47:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:47:06,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:06,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:06,880 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-06 05:47:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2036 states and 2436 transitions. [2024-12-06 05:47:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2436 transitions. [2024-12-06 05:47:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:47:07,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:07,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:07,627 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-06 05:47:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2049 states and 2450 transitions. [2024-12-06 05:47:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2450 transitions. [2024-12-06 05:47:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:47:08,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:08,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:09,138 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-06 05:47:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2050 states and 2450 transitions. [2024-12-06 05:47:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2450 transitions. [2024-12-06 05:47:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:47:09,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:09,834 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-06 05:47:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2052 states and 2453 transitions. [2024-12-06 05:47:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2453 transitions. [2024-12-06 05:47:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:47:09,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:10,217 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-06 05:47:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2062 states and 2462 transitions. [2024-12-06 05:47:10,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2462 transitions. [2024-12-06 05:47:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 05:47:10,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:10,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 204 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:47:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2076 states and 2478 transitions. [2024-12-06 05:47:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2478 transitions. [2024-12-06 05:47:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 05:47:12,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 204 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:47:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2077 states and 2479 transitions. [2024-12-06 05:47:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2479 transitions. [2024-12-06 05:47:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 05:47:12,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 05:47:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2121 states and 2528 transitions. [2024-12-06 05:47:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2528 transitions. [2024-12-06 05:47:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 05:47:16,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:16,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 127 proven. 88 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 05:47:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2148 states and 2565 transitions. [2024-12-06 05:47:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2565 transitions. [2024-12-06 05:47:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 05:47:19,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:19,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:19,752 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-06 05:47:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2178 states and 2597 transitions. [2024-12-06 05:47:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2597 transitions. [2024-12-06 05:47:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-12-06 05:47:22,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:22,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-12-06 05:47:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2180 states and 2601 transitions. [2024-12-06 05:47:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2601 transitions. [2024-12-06 05:47:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-12-06 05:47:23,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-12-06 05:47:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2181 states and 2602 transitions. [2024-12-06 05:47:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2602 transitions. [2024-12-06 05:47:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:47:24,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:24,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 130 proven. 84 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-06 05:47:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2229 states and 2662 transitions. [2024-12-06 05:47:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2662 transitions. [2024-12-06 05:47:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:47:28,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:28,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 177 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:47:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2271 states and 2718 transitions. [2024-12-06 05:47:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 2718 transitions. [2024-12-06 05:47:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:47:34,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:34,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 177 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:47:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2279 states and 2724 transitions. [2024-12-06 05:47:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2724 transitions. [2024-12-06 05:47:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:47:36,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 177 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:47:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2281 states and 2725 transitions. [2024-12-06 05:47:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 2725 transitions. [2024-12-06 05:47:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:47:36,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 177 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:47:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2286 states and 2730 transitions. [2024-12-06 05:47:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 2730 transitions. [2024-12-06 05:47:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:47:37,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 211 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-12-06 05:47:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2316 states and 2768 transitions. [2024-12-06 05:47:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 2768 transitions. [2024-12-06 05:47:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:47:40,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 159 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:47:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2348 states and 2809 transitions. [2024-12-06 05:47:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 2809 transitions. [2024-12-06 05:47:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:47:43,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 159 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:47:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2360 states and 2823 transitions. [2024-12-06 05:47:44,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2823 transitions. [2024-12-06 05:47:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 05:47:44,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-12-06 05:47:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2488 states and 2967 transitions. [2024-12-06 05:47:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2967 transitions. [2024-12-06 05:47:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 05:47:51,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:51,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:51,688 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-06 05:47:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2511 states and 2998 transitions. [2024-12-06 05:47:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 2998 transitions. [2024-12-06 05:47:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 05:47:56,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:56,275 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-06 05:47:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 2523 states and 3016 transitions. [2024-12-06 05:47:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3016 transitions. [2024-12-06 05:47:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 05:47:58,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:58,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:58,525 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-06 05:47:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 2532 states and 3024 transitions. [2024-12-06 05:47:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3024 transitions. [2024-12-06 05:47:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-06 05:47:59,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:59,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 193 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:48:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 2555 states and 3060 transitions. [2024-12-06 05:48:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3060 transitions. [2024-12-06 05:48:05,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-06 05:48:05,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 193 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:48:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 2566 states and 3070 transitions. [2024-12-06 05:48:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3070 transitions. [2024-12-06 05:48:06,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-06 05:48:06,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:06,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 193 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:48:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 2568 states and 3072 transitions. [2024-12-06 05:48:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3072 transitions. [2024-12-06 05:48:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-06 05:48:07,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:07,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 193 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:48:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 2569 states and 3073 transitions. [2024-12-06 05:48:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3073 transitions. [2024-12-06 05:48:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:48:08,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:09,276 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-06 05:48:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 2588 states and 3097 transitions. [2024-12-06 05:48:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3097 transitions. [2024-12-06 05:48:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:48:12,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:13,194 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-06 05:48:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 2622 states and 3133 transitions. [2024-12-06 05:48:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3133 transitions. [2024-12-06 05:48:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:48:17,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:17,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:17,827 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-06 05:48:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 2625 states and 3135 transitions. [2024-12-06 05:48:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3135 transitions. [2024-12-06 05:48:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 05:48:18,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:18,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:19,013 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-06 05:48:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 2651 states and 3165 transitions. [2024-12-06 05:48:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3165 transitions. [2024-12-06 05:48:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 05:48:21,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:21,280 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-06 05:48:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 2662 states and 3179 transitions. [2024-12-06 05:48:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3179 transitions. [2024-12-06 05:48:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 05:48:23,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:23,287 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-06 05:48:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 2670 states and 3187 transitions. [2024-12-06 05:48:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3187 transitions. [2024-12-06 05:48:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:48:24,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:24,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:48:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 2695 states and 3219 transitions. [2024-12-06 05:48:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3219 transitions. [2024-12-06 05:48:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:48:30,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:48:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 2713 states and 3237 transitions. [2024-12-06 05:48:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3237 transitions. [2024-12-06 05:48:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:48:35,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:35,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:48:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 2714 states and 3237 transitions. [2024-12-06 05:48:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3237 transitions. [2024-12-06 05:48:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:48:36,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-06 05:48:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 2735 states and 3260 transitions. [2024-12-06 05:48:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3260 transitions. [2024-12-06 05:48:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:48:39,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:48:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 2781 states and 3332 transitions. [2024-12-06 05:48:49,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3332 transitions. [2024-12-06 05:48:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:48:49,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:48:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 2818 states and 3374 transitions. [2024-12-06 05:48:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3374 transitions. [2024-12-06 05:48:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:48:54,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 05:48:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:55,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 2834 states and 3390 transitions. [2024-12-06 05:48:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 3390 transitions. [2024-12-06 05:48:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:48:55,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:55,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:48:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 2847 states and 3403 transitions. [2024-12-06 05:48:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3403 transitions. [2024-12-06 05:48:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 05:48:56,713 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:49:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3467 states to 2892 states and 3467 transitions. [2024-12-06 05:49:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3467 transitions. [2024-12-06 05:49:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 05:49:04,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:49:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 2926 states and 3502 transitions. [2024-12-06 05:49:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 3502 transitions. [2024-12-06 05:49:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 05:49:08,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:49:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 2967 states and 3552 transitions. [2024-12-06 05:49:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 3552 transitions. [2024-12-06 05:49:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 05:49:12,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:49:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 2985 states and 3569 transitions. [2024-12-06 05:49:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 3569 transitions. [2024-12-06 05:49:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-12-06 05:49:13,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:13,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:49:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3602 states to 3013 states and 3602 transitions. [2024-12-06 05:49:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3602 transitions. [2024-12-06 05:49:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-12-06 05:49:16,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:49:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 3031 states and 3619 transitions. [2024-12-06 05:49:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 3619 transitions. [2024-12-06 05:49:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-12-06 05:49:18,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:18,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 200 proven. 41 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:49:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3042 states and 3630 transitions. [2024-12-06 05:49:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 3630 transitions. [2024-12-06 05:49:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-12-06 05:49:19,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:49:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3058 states and 3653 transitions. [2024-12-06 05:49:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 3653 transitions. [2024-12-06 05:49:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:49:22,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:22,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:49:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3068 states and 3669 transitions. [2024-12-06 05:49:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 3669 transitions. [2024-12-06 05:49:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:49:25,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:49:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3080 states and 3685 transitions. [2024-12-06 05:49:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 3685 transitions. [2024-12-06 05:49:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:49:27,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:49:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3085 states and 3694 transitions. [2024-12-06 05:49:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 3694 transitions. [2024-12-06 05:49:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:49:29,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:29,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:49:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3699 states to 3088 states and 3699 transitions. [2024-12-06 05:49:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 3699 transitions. [2024-12-06 05:49:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:49:32,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:32,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:49:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3102 states and 3720 transitions. [2024-12-06 05:49:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 3720 transitions. [2024-12-06 05:49:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:49:37,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:49:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3126 states and 3744 transitions. [2024-12-06 05:49:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 3744 transitions. [2024-12-06 05:49:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-12-06 05:49:40,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-06 05:49:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3136 states and 3759 transitions. [2024-12-06 05:49:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 3759 transitions. [2024-12-06 05:49:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-12-06 05:49:44,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-06 05:49:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3145 states and 3769 transitions. [2024-12-06 05:49:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3769 transitions. [2024-12-06 05:49:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-12-06 05:49:47,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-06 05:49:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3148 states and 3776 transitions. [2024-12-06 05:49:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3776 transitions. [2024-12-06 05:49:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-12-06 05:49:50,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-06 05:49:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3177 states and 3806 transitions. [2024-12-06 05:49:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 3806 transitions. [2024-12-06 05:49:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-12-06 05:49:52,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:52,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-06 05:49:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3178 states and 3807 transitions. [2024-12-06 05:49:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 3807 transitions. [2024-12-06 05:49:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 05:49:53,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 05:50:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3232 states and 3868 transitions. [2024-12-06 05:50:01,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 3868 transitions. [2024-12-06 05:50:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 05:50:01,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:01,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 05:50:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3237 states and 3872 transitions. [2024-12-06 05:50:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 3872 transitions. [2024-12-06 05:50:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 05:50:02,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:02,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 05:50:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3874 states to 3239 states and 3874 transitions. [2024-12-06 05:50:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 3874 transitions. [2024-12-06 05:50:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-12-06 05:50:04,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:04,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 171 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:50:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3241 states and 3877 transitions. [2024-12-06 05:50:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 3877 transitions. [2024-12-06 05:50:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-12-06 05:50:05,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:05,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:50:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3265 states and 3906 transitions. [2024-12-06 05:50:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3265 states and 3906 transitions. [2024-12-06 05:50:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-12-06 05:50:10,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:10,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:50:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3273 states and 3913 transitions. [2024-12-06 05:50:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 3913 transitions. [2024-12-06 05:50:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-12-06 05:50:11,986 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:50:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3275 states and 3914 transitions. [2024-12-06 05:50:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3914 transitions. [2024-12-06 05:50:12,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:50:12,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:50:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3296 states and 3937 transitions. [2024-12-06 05:50:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 3937 transitions. [2024-12-06 05:50:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:50:15,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:50:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3301 states and 3942 transitions. [2024-12-06 05:50:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 3942 transitions. [2024-12-06 05:50:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:50:17,005 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:17,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:50:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3306 states and 3948 transitions. [2024-12-06 05:50:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 3948 transitions. [2024-12-06 05:50:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:50:18,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:18,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:50:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3309 states and 3950 transitions. [2024-12-06 05:50:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 3950 transitions. [2024-12-06 05:50:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:50:18,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:50:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3316 states and 3957 transitions. [2024-12-06 05:50:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 3957 transitions. [2024-12-06 05:50:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:50:20,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:20,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:50:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3323 states and 3964 transitions. [2024-12-06 05:50:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 3964 transitions. [2024-12-06 05:50:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:50:21,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:21,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:50:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3336 states and 3977 transitions. [2024-12-06 05:50:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 3977 transitions. [2024-12-06 05:50:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 05:50:22,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:50:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3346 states and 3991 transitions. [2024-12-06 05:50:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 3991 transitions. [2024-12-06 05:50:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 05:50:23,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:50:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 3367 states and 4008 transitions. [2024-12-06 05:50:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3367 states and 4008 transitions. [2024-12-06 05:50:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 05:50:25,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:50:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 3370 states and 4011 transitions. [2024-12-06 05:50:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4011 transitions. [2024-12-06 05:50:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 05:50:26,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:26,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:50:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 3373 states and 4014 transitions. [2024-12-06 05:50:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 4014 transitions. [2024-12-06 05:50:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 05:50:27,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:50:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 3380 states and 4020 transitions. [2024-12-06 05:50:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4020 transitions. [2024-12-06 05:50:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-06 05:50:28,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 190 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:50:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4029 states to 3387 states and 4029 transitions. [2024-12-06 05:50:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4029 transitions. [2024-12-06 05:50:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 05:50:31,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:31,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:50:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 3446 states and 4113 transitions. [2024-12-06 05:50:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4113 transitions. [2024-12-06 05:50:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 05:50:42,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:50:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 3462 states and 4132 transitions. [2024-12-06 05:50:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 4132 transitions. [2024-12-06 05:50:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 05:50:44,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:44,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:44,176 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-06 05:50:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 3491 states and 4171 transitions. [2024-12-06 05:50:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4171 transitions. [2024-12-06 05:50:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 05:50:46,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:47,133 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-06 05:50:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 3505 states and 4187 transitions. [2024-12-06 05:50:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 4187 transitions. [2024-12-06 05:50:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 05:50:48,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:48,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:50:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 3544 states and 4249 transitions. [2024-12-06 05:50:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 4249 transitions. [2024-12-06 05:50:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 05:50:56,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:50:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4265 states to 3561 states and 4265 transitions. [2024-12-06 05:50:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 4265 transitions. [2024-12-06 05:50:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:50:58,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-12-06 05:50:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:50:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4266 states to 3562 states and 4266 transitions. [2024-12-06 05:50:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 4266 transitions. [2024-12-06 05:50:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:50:59,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:50:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:50:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:50:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:51:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4277 states to 3573 states and 4277 transitions. [2024-12-06 05:51:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 4277 transitions. [2024-12-06 05:51:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:51:01,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:01,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-06 05:51:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 3575 states and 4279 transitions. [2024-12-06 05:51:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 4279 transitions. [2024-12-06 05:51:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:51:02,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:02,522 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-06 05:51:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 3590 states and 4299 transitions. [2024-12-06 05:51:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 4299 transitions. [2024-12-06 05:51:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:51:05,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:05,294 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-06 05:51:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4309 states to 3600 states and 4309 transitions. [2024-12-06 05:51:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4309 transitions. [2024-12-06 05:51:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:51:07,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:07,189 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-06 05:51:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 3602 states and 4311 transitions. [2024-12-06 05:51:07,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3602 states and 4311 transitions. [2024-12-06 05:51:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:51:07,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-06 05:51:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 3604 states and 4312 transitions. [2024-12-06 05:51:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4312 transitions. [2024-12-06 05:51:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:51:08,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:08,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:09,387 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-06 05:51:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 3608 states and 4319 transitions. [2024-12-06 05:51:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 4319 transitions. [2024-12-06 05:51:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:51:12,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:13,031 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-06 05:51:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4361 states to 3649 states and 4361 transitions. [2024-12-06 05:51:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 4361 transitions. [2024-12-06 05:51:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:51:18,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:51:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 3666 states and 4381 transitions. [2024-12-06 05:51:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4381 transitions. [2024-12-06 05:51:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 05:51:21,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:21,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 254 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:51:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 3668 states and 4381 transitions. [2024-12-06 05:51:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4381 transitions. [2024-12-06 05:51:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 05:51:23,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:23,333 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-06 05:51:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4390 states to 3677 states and 4390 transitions. [2024-12-06 05:51:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4390 transitions. [2024-12-06 05:51:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 05:51:24,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:24,677 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-06 05:51:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4412 states to 3699 states and 4412 transitions. [2024-12-06 05:51:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3699 states and 4412 transitions. [2024-12-06 05:51:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 05:51:27,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:27,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:51:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 3762 states and 4492 transitions. [2024-12-06 05:51:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3762 states and 4492 transitions. [2024-12-06 05:51:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 05:51:36,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:36,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:51:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 3776 states and 4508 transitions. [2024-12-06 05:51:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 4508 transitions. [2024-12-06 05:51:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 05:51:39,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:39,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 05:51:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 3806 states and 4542 transitions. [2024-12-06 05:51:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4542 transitions. [2024-12-06 05:51:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:51:44,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:44,385 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-06 05:51:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 3817 states and 4554 transitions. [2024-12-06 05:51:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 4554 transitions. [2024-12-06 05:51:45,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:51:45,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:45,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-06 05:51:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4558 states to 3820 states and 4558 transitions. [2024-12-06 05:51:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 4558 transitions. [2024-12-06 05:51:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:51:45,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:45,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-06 05:51:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 3831 states and 4569 transitions. [2024-12-06 05:51:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 4569 transitions. [2024-12-06 05:51:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:51:47,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:47,825 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-06 05:52:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4652 states to 3898 states and 4652 transitions. [2024-12-06 05:52:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 4652 transitions. [2024-12-06 05:52:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:52:03,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:04,085 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-06 05:52:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 3910 states and 4663 transitions. [2024-12-06 05:52:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3910 states and 4663 transitions. [2024-12-06 05:52:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:52:06,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:06,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:07,117 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-06 05:52:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 3936 states and 4690 transitions. [2024-12-06 05:52:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 4690 transitions. [2024-12-06 05:52:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:52:13,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:14,001 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-06 05:52:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4719 states to 3960 states and 4719 transitions. [2024-12-06 05:52:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 4719 transitions. [2024-12-06 05:52:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:52:22,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:22,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:22,646 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-06 05:52:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 3967 states and 4725 transitions. [2024-12-06 05:52:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3967 states and 4725 transitions. [2024-12-06 05:52:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:52:26,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:26,449 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-06 05:52:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4729 states to 3972 states and 4729 transitions. [2024-12-06 05:52:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 4729 transitions. [2024-12-06 05:52:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:52:28,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:28,654 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-06 05:52:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4751 states to 3993 states and 4751 transitions. [2024-12-06 05:52:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 4751 transitions. [2024-12-06 05:52:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:52:34,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:34,893 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-06 05:52:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4001 states and 4759 transitions. [2024-12-06 05:52:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 4759 transitions. [2024-12-06 05:52:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:52:36,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 05:52:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4008 states and 4768 transitions. [2024-12-06 05:52:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 4768 transitions. [2024-12-06 05:52:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-12-06 05:52:38,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:38,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-12-06 05:52:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4011 states and 4773 transitions. [2024-12-06 05:52:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 4773 transitions. [2024-12-06 05:52:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-12-06 05:52:40,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-12-06 05:52:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4787 states to 4025 states and 4787 transitions. [2024-12-06 05:52:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4025 states and 4787 transitions. [2024-12-06 05:52:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-12-06 05:52:42,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-12-06 05:52:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4795 states to 4034 states and 4795 transitions. [2024-12-06 05:52:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 4795 transitions. [2024-12-06 05:52:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 05:52:43,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 268 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:52:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4798 states to 4038 states and 4798 transitions. [2024-12-06 05:52:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 4798 transitions. [2024-12-06 05:52:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 05:52:44,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:45,053 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-06 05:52:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4065 states and 4832 transitions. [2024-12-06 05:52:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4065 states and 4832 transitions. [2024-12-06 05:52:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 05:52:51,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:51,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-12-06 05:52:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4074 states and 4841 transitions. [2024-12-06 05:52:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 4841 transitions. [2024-12-06 05:52:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 05:52:52,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 253 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:52:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4079 states and 4845 transitions. [2024-12-06 05:52:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 4845 transitions. [2024-12-06 05:52:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 05:52:55,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:55,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 253 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:52:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4846 states to 4080 states and 4846 transitions. [2024-12-06 05:52:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 4846 transitions. [2024-12-06 05:52:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 05:52:56,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:56,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-12-06 05:52:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4081 states and 4847 transitions. [2024-12-06 05:52:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4081 states and 4847 transitions. [2024-12-06 05:52:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 05:52:57,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:57,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-06 05:52:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4096 states and 4863 transitions. [2024-12-06 05:52:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4096 states and 4863 transitions. [2024-12-06 05:52:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 05:52:59,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:59,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-06 05:53:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4106 states and 4872 transitions. [2024-12-06 05:53:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 4872 transitions. [2024-12-06 05:53:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 05:53:00,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:00,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:00,990 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-06 05:53:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4137 states and 4906 transitions. [2024-12-06 05:53:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 4906 transitions. [2024-12-06 05:53:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 05:53:07,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:08,003 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-06 05:53:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4168 states and 4942 transitions. [2024-12-06 05:53:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 4942 transitions. [2024-12-06 05:53:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 05:53:14,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-12-06 05:53:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4175 states and 4948 transitions. [2024-12-06 05:53:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 4948 transitions. [2024-12-06 05:53:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:53:16,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:16,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 231 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:53:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4952 states to 4178 states and 4952 transitions. [2024-12-06 05:53:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 4952 transitions. [2024-12-06 05:53:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:53:19,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:19,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:19,974 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-06 05:53:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4181 states and 4956 transitions. [2024-12-06 05:53:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 4181 states and 4956 transitions. [2024-12-06 05:53:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:53:20,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:20,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:53:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4204 states and 4985 transitions. [2024-12-06 05:53:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4204 states and 4985 transitions. [2024-12-06 05:53:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:53:24,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:24,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:53:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5007 states to 4220 states and 5007 transitions. [2024-12-06 05:53:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 5007 transitions. [2024-12-06 05:53:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:53:29,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:29,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:53:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 4235 states and 5023 transitions. [2024-12-06 05:53:33,661 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 5023 transitions. [2024-12-06 05:53:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:53:33,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:53:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 4236 states and 5025 transitions. [2024-12-06 05:53:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4236 states and 5025 transitions. [2024-12-06 05:53:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:53:35,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:35,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:36,149 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-06 05:54:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 4366 states and 5201 transitions. [2024-12-06 05:54:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4366 states and 5201 transitions. [2024-12-06 05:54:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 05:54:00,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-12-06 05:54:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 4367 states and 5202 transitions. [2024-12-06 05:54:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4367 states and 5202 transitions. [2024-12-06 05:54:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-12-06 05:54:01,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:54:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 4476 states and 5323 transitions. [2024-12-06 05:54:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 5323 transitions. [2024-12-06 05:54:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 05:54:09,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:09,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:10,824 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-06 05:54:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5364 states to 4508 states and 5364 transitions. [2024-12-06 05:54:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 5364 transitions. [2024-12-06 05:54:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 05:54:16,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:16,510 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-06 05:54:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 4526 states and 5384 transitions. [2024-12-06 05:54:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 5384 transitions. [2024-12-06 05:54:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-12-06 05:54:20,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-12-06 05:54:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 4527 states and 5385 transitions. [2024-12-06 05:54:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 5385 transitions. [2024-12-06 05:54:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-12-06 05:54:22,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:22,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-12-06 05:54:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5389 states to 4531 states and 5389 transitions. [2024-12-06 05:54:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 5389 transitions. [2024-12-06 05:54:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-12-06 05:54:23,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:23,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 287 proven. 58 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-06 05:54:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5431 states to 4565 states and 5431 transitions. [2024-12-06 05:54:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5431 transitions. [2024-12-06 05:54:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-12-06 05:54:29,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:29,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-12-06 05:54:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5447 states to 4580 states and 5447 transitions. [2024-12-06 05:54:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4580 states and 5447 transitions. [2024-12-06 05:54:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:54:30,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:30,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:54:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 4630 states and 5517 transitions. [2024-12-06 05:54:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 5517 transitions. [2024-12-06 05:54:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:54:44,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:44,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:54:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5525 states to 4632 states and 5525 transitions. [2024-12-06 05:54:47,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 5525 transitions. [2024-12-06 05:54:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:54:47,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:47,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:54:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5557 states to 4662 states and 5557 transitions. [2024-12-06 05:54:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4662 states and 5557 transitions. [2024-12-06 05:54:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:54:51,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:54:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5577 states to 4680 states and 5577 transitions. [2024-12-06 05:54:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5577 transitions. [2024-12-06 05:54:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:54:53,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:54:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5577 states to 4681 states and 5577 transitions. [2024-12-06 05:54:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 5577 transitions. [2024-12-06 05:54:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:54:55,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:54:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5607 states to 4711 states and 5607 transitions. [2024-12-06 05:54:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4711 states and 5607 transitions. [2024-12-06 05:54:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:54:58,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:58,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:55:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 4741 states and 5638 transitions. [2024-12-06 05:55:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 5638 transitions. [2024-12-06 05:55:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:55:02,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:55:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 4742 states and 5638 transitions. [2024-12-06 05:55:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4742 states and 5638 transitions. [2024-12-06 05:55:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:55:04,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 64 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-06 05:55:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 4743 states and 5638 transitions. [2024-12-06 05:55:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4743 states and 5638 transitions. [2024-12-06 05:55:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:55:05,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:05,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 64 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-06 05:55:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5649 states to 4755 states and 5649 transitions. [2024-12-06 05:55:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 5649 transitions. [2024-12-06 05:55:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 05:55:07,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:07,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 64 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-06 05:55:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5649 states to 4756 states and 5649 transitions. [2024-12-06 05:55:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 5649 transitions. [2024-12-06 05:55:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-12-06 05:55:08,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:08,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-12-06 05:55:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5649 states to 4757 states and 5649 transitions. [2024-12-06 05:55:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 5649 transitions. [2024-12-06 05:55:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-12-06 05:55:09,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-12-06 05:55:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5649 states to 4758 states and 5649 transitions. [2024-12-06 05:55:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 5649 transitions. [2024-12-06 05:55:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-12-06 05:55:11,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 368 proven. 105 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-06 05:55:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5657 states to 4763 states and 5657 transitions. [2024-12-06 05:55:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 5657 transitions. [2024-12-06 05:55:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-12-06 05:55:14,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:14,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 385 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-12-06 05:55:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5682 states to 4781 states and 5682 transitions. [2024-12-06 05:55:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 5682 transitions. [2024-12-06 05:55:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 05:55:23,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:23,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-06 05:55:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 4828 states and 5734 transitions. [2024-12-06 05:55:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 5734 transitions. [2024-12-06 05:55:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 05:55:29,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-06 05:55:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5750 states to 4843 states and 5750 transitions. [2024-12-06 05:55:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 5750 transitions. [2024-12-06 05:55:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 05:55:33,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:55:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:55:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:55:35,217 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-06 05:55:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:55:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5811 states to 4894 states and 5811 transitions. [2024-12-06 05:55:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 5811 transitions. [2024-12-06 05:55:50,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 05:55:50,713 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 286 iterations. [2024-12-06 05:55:50,720 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 05:57:06,817 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,817 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,818 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,818 INFO L77 FloydHoareUtils]: At program point L566-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-12-06 05:57:06,818 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,818 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,819 INFO L75 FloydHoareUtils]: For program point L567(line 567) no Hoare annotation was computed. [2024-12-06 05:57:06,819 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,819 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,819 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,820 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,820 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,820 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,820 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,821 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,821 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,821 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,821 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,822 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,822 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,822 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,822 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,823 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (let ((.cse8 (= ~a7~0 1)) (.cse15 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse11 (<= 15 ~a8~0)) (.cse9 (= ~a16~0 6)) (.cse14 (< ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse12 (not .cse4)) (.cse7 (not .cse15)) (.cse10 (= ~a8~0 15)) (.cse13 (= ~a20~0 ~a7~0)) (.cse5 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse8) (and (not (and .cse0 .cse9 .cse10 .cse5)) .cse11) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 3)) .cse10) (and .cse12 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and (not .cse3) .cse11) (and (= ~a7~0 0) .cse10) (and (not (= 14 ~a8~0)) .cse14) (and .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse13) (and .cse12 .cse0 .cse7 .cse3 .cse8 .cse6) (and .cse10 .cse13) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse15 .cse4 .cse6)))) [2024-12-06 05:57:06,823 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,823 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,823 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1)) (.cse15 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse6 (= ~a8~0 15)) (.cse13 (= ~a16~0 6)) (.cse14 (< ~a8~0 15)) (.cse11 (<= 15 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse10 (not .cse4)) (.cse8 (not .cse15)) (.cse12 (= ~a20~0 ~a7~0)) (.cse5 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse9)) (.cse3 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse9) (and .cse10 .cse11) (and (not .cse0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse5) (and (not (and .cse13 .cse6)) .cse11) (and (not .cse5) .cse6) (and (not (= 14 ~a8~0)) .cse14) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse14) (and .cse11 (not (and .cse3 (= ~a7~0 0)))) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse12) (and .cse10 .cse0 .cse8 .cse3 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse12 .cse5 .cse7) (and .cse0 .cse2 .cse3 .cse15 .cse4 .cse7)))) [2024-12-06 05:57:06,824 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,824 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,824 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,825 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,825 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,825 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,825 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,826 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,826 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,826 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,826 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,827 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1)) (.cse15 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse6 (= ~a8~0 15)) (.cse13 (= ~a16~0 6)) (.cse14 (< ~a8~0 15)) (.cse11 (<= 15 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse10 (not .cse4)) (.cse8 (not .cse15)) (.cse12 (= ~a20~0 ~a7~0)) (.cse5 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse9)) (.cse3 (= ~a21~0 1)) (.cse7 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse9) (and .cse10 .cse11) (and (not .cse0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse5) (and (not (and .cse13 .cse6)) .cse11) (and (not .cse5) .cse6) (and (not (= 14 ~a8~0)) .cse14) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse14) (and .cse11 (not (and .cse3 (= ~a7~0 0)))) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse12) (and .cse10 .cse0 .cse8 .cse3 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse12 .cse5 .cse7) (and .cse0 .cse2 .cse3 .cse15 .cse4 .cse7)))) [2024-12-06 05:57:06,827 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,827 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,827 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,828 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,828 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,828 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,828 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,829 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,829 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,829 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,829 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 05:57:06,829 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,829 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 05:57:06,830 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,830 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,830 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,830 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,831 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,831 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,831 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,831 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 05:57:06,831 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,832 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,832 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,832 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,833 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,833 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,833 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,833 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,833 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,834 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 567) no Hoare annotation was computed. [2024-12-06 05:57:06,834 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,834 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,834 INFO L77 FloydHoareUtils]: At program point L563-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-12-06 05:57:06,834 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,835 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,835 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse8 (= ~a7~0 1)) (.cse4 (= ~a17~0 1))) (let ((.cse7 (not .cse4)) (.cse1 (= 5 ~a16~0)) (.cse5 (= ~a20~0 ~a7~0)) (.cse10 (= ~a17~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse8)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1)) (.cse9 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and (not .cse6) .cse0 .cse7 .cse3 .cse8 .cse9)) (= 14 ~a8~0) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse6 .cse10)) (not (and .cse0 .cse1 .cse7 .cse3 .cse8)) (not (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10)) (not (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse9)) (not (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9)))))) [2024-12-06 05:57:06,835 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse11 (= ~a7~0 1)) (.cse6 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse8 (= ~a16~0 6)) (.cse15 (not .cse4)) (.cse10 (not .cse6)) (.cse1 (= 5 ~a16~0)) (.cse14 (< ~a8~0 15)) (.cse7 (<= 15 ~a8~0)) (.cse0 (= ~a12~0 8)) (.cse2 (not .cse11)) (.cse3 (= ~a21~0 1)) (.cse9 (= ~a16~0 4)) (.cse13 (= ~a20~0 ~a7~0)) (.cse12 (= ~a8~0 15)) (.cse5 (= ~a17~0 ~a7~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (= ~a20~0 0)) .cse6 .cse7) (and (not .cse8) .cse4 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse11) (and (not .cse12) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5) (and .cse10 (<= ~a16~0 5) .cse7) (and (not (= 14 ~a8~0)) .cse14) (and .cse15 (< 5 ~a16~0) .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse14) (and (< ~a16~0 5) .cse7) (and .cse15 .cse0 .cse10 .cse3 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse14) (and (not (and .cse0 .cse3 (= ~a7~0 0))) .cse7) (and .cse4 (not .cse5) .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse12 .cse13) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse12 .cse5)))) [2024-12-06 05:57:06,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:57:06 ImpRootNode [2024-12-06 05:57:06,853 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:57:06,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:57:06,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:57:06,853 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:57:06,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:45:16" (3/4) ... [2024-12-06 05:57:06,856 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 05:57:06,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 118 nodes and edges [2024-12-06 05:57:06,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-12-06 05:57:06,870 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 05:57:06,871 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 05:57:07,177 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:57:07,178 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:57:07,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:57:07,179 INFO L158 Benchmark]: Toolchain (without parser) took 712259.50ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 116.5MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-12-06 05:57:07,183 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 142.6MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:57:07,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.21ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 89.2MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 05:57:07,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.84ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 83.6MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:57:07,183 INFO L158 Benchmark]: Boogie Preprocessor took 48.69ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 79.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:57:07,184 INFO L158 Benchmark]: RCFGBuilder took 1094.51ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 64.7MB in the end (delta: 14.8MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2024-12-06 05:57:07,184 INFO L158 Benchmark]: CodeCheck took 710336.97ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 64.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-12-06 05:57:07,184 INFO L158 Benchmark]: Witness Printer took 324.91ms. Allocated memory is still 3.7GB. Free memory was 1.5GB in the beginning and 2.7GB in the end (delta: -1.2GB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:57:07,186 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: 634.2s, OverallIterations: 286, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1541732 SdHoareTripleChecker+Valid, 3449.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1537196 mSDsluCounter, 240638 SdHoareTripleChecker+Invalid, 2983.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212685 mSDsCounter, 299054 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3166355 IncrementalHoareTripleChecker+Invalid, 3465409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299054 mSolverCounterUnsat, 27953 mSDtfsCounter, 3166355 mSolverCounterSat, 19.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368941 GetRequests, 350799 SyntacticMatches, 15392 SemanticMatches, 2750 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5138259 ImplicationChecksByTransitivity, 529.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.4s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 55.6s InterpolantComputationTime, 54605 NumberOfCodeBlocks, 54605 NumberOfCodeBlocksAsserted, 285 NumberOfCheckSat, 54320 ConstructedInterpolants, 0 QuantifiedInterpolants, 332435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 285 InterpolantComputations, 130 PerfectInterpolantSequences, 53540/63556 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: 567]: 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) && (5 == a16)) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a20 == a7)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1)) && (a16 == 4))) && (14 == a8)) && !((((((a12 == 8) && (5 == a16)) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a17 == a7))) && !((((((a12 == 8) && (a16 == 6)) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a17 == a7))) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !((((((a12 == 8) && (5 == a16)) && (a7 != 1)) && (a21 == 1)) && (a20 == a7)) && (a17 == a7))) && !((((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a17 == a7)) && (a16 == 4))) && !((((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == a7)) && (a17 == a7)) && (a16 == 4))) && !((((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((((!((((((a12 == 8) && (5 == a16)) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a20 == a7)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1)) && (a16 == 4))) && (14 == a8)) && !((((((a12 == 8) && (5 == a16)) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a17 == a7))) && !((((((a12 == 8) && (a16 == 6)) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a17 == a7))) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !((((((a12 == 8) && (5 == a16)) && (a7 != 1)) && (a21 == 1)) && (a20 == a7)) && (a17 == a7))) && !((((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a17 == a7)) && (a16 == 4))) && !((((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == a7)) && (a17 == a7)) && (a16 == 4))) && !((((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 142.6MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.21ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 89.2MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.84ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 83.6MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.69ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 79.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1094.51ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 64.7MB in the end (delta: 14.8MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * CodeCheck took 710336.97ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 64.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 324.91ms. Allocated memory is still 3.7GB. Free memory was 1.5GB in the beginning and 2.7GB in the end (delta: -1.2GB). There was no memory consumed. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 05:57:07,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6406ae1e-3269-45f1-b37a-8c9805ac6ae6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE