./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.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_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/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_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/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_a947776b-5127-4ca2-be48-34da39421534/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 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 00:54:20,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 00:54:20,079 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 00:54:20,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 00:54:20,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 00:54:20,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 00:54:20,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 00:54:20,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 00:54:20,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 00:54:20,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 00:54:20,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 00:54:20,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 00:54:20,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 00:54:20,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 00:54:20,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 00:54:20,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 00:54:20,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 00:54:20,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 00:54:20,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 00:54:20,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 00:54:20,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 00:54:20,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 00:54:20,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 00:54:20,113 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 00:54:20,113 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 00:54:20,113 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 00:54:20,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 00:54:20,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:54:20,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 00:54:20,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 00:54:20,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 00:54:20,113 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 00:54:20,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 00:54:20,114 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_a947776b-5127-4ca2-be48-34da39421534/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 -> 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 [2024-12-06 00:54:20,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 00:54:20,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 00:54:20,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 00:54:20,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 00:54:20,416 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 00:54:20,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2024-12-06 00:54:23,265 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/data/795931322/409f08e0b95147c3a17a7710ed7f5157/FLAG5f63a34c3 [2024-12-06 00:54:23,494 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 00:54:23,495 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2024-12-06 00:54:23,508 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/data/795931322/409f08e0b95147c3a17a7710ed7f5157/FLAG5f63a34c3 [2024-12-06 00:54:23,524 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/data/795931322/409f08e0b95147c3a17a7710ed7f5157 [2024-12-06 00:54:23,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 00:54:23,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 00:54:23,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 00:54:23,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 00:54:23,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 00:54:23,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:54:23" (1/1) ... [2024-12-06 00:54:23,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7a7c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:23, skipping insertion in model container [2024-12-06 00:54:23,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:54:23" (1/1) ... [2024-12-06 00:54:23,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 00:54:23,906 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_a947776b-5127-4ca2-be48-34da39421534/sv-benchmarks/c/eca-rers2012/Problem01_label30.c[21088,21101] [2024-12-06 00:54:23,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:54:23,941 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 00:54:24,043 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_a947776b-5127-4ca2-be48-34da39421534/sv-benchmarks/c/eca-rers2012/Problem01_label30.c[21088,21101] [2024-12-06 00:54:24,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:54:24,069 INFO L204 MainTranslator]: Completed translation [2024-12-06 00:54:24,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24 WrapperNode [2024-12-06 00:54:24,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 00:54:24,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 00:54:24,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 00:54:24,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 00:54:24,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,148 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 00:54:24,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 00:54:24,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 00:54:24,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 00:54:24,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 00:54:24,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 00:54:24,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 00:54:24,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 00:54:24,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 00:54:24,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:24" (1/1) ... [2024-12-06 00:54:24,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:54:24,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 00:54:24,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 00:54:24,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 00:54:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 00:54:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 00:54:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 00:54:24,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 00:54:24,374 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 00:54:24,376 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 00:54:25,461 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 00:54:25,461 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 00:54:25,751 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 00:54:25,751 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 00:54:25,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:54:25 BoogieIcfgContainer [2024-12-06 00:54:25,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 00:54:25,752 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 00:54:25,752 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 00:54:25,764 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 00:54:25,765 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:54:25" (1/1) ... [2024-12-06 00:54:25,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 00:54:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 00:54:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 00:54:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 00:54:25,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:26,718 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 00:54:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-12-06 00:54:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-12-06 00:54:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 00:54:27,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-12-06 00:54:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-12-06 00:54:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 00:54:28,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:29,027 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 00:54:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-12-06 00:54:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-12-06 00:54:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 00:54:29,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:30,224 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 00:54:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-12-06 00:54:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-12-06 00:54:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 00:54:30,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-12-06 00:54:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-12-06 00:54:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 00:54:31,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-12-06 00:54:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-12-06 00:54:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 00:54:31,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 00:54:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-12-06 00:54:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-12-06 00:54:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 00:54:32,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:32,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:32,923 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 00:54:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-12-06 00:54:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-12-06 00:54:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 00:54:33,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:33,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-12-06 00:54:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-12-06 00:54:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 00:54:34,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:34,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:34,917 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 00:54:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-12-06 00:54:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-12-06 00:54:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 00:54:36,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 00:54:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-12-06 00:54:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-12-06 00:54:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 00:54:36,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:36,933 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 00:54:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-12-06 00:54:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-12-06 00:54:38,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 00:54:38,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:38,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:38,958 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 00:54:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-12-06 00:54:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-12-06 00:54:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 00:54:39,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:54:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 511 states and 629 transitions. [2024-12-06 00:54:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 629 transitions. [2024-12-06 00:54:39,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 00:54:39,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:39,873 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 00:54:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 512 states and 629 transitions. [2024-12-06 00:54:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 629 transitions. [2024-12-06 00:54:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 00:54:39,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:40,303 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 00:54:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 581 states and 713 transitions. [2024-12-06 00:54:41,512 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 713 transitions. [2024-12-06 00:54:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 00:54:41,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:41,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:41,791 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 00:54:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:42,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 600 states and 736 transitions. [2024-12-06 00:54:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 736 transitions. [2024-12-06 00:54:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 00:54:42,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:43,105 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 00:54:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 602 states and 737 transitions. [2024-12-06 00:54:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 737 transitions. [2024-12-06 00:54:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:54:43,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 00:54:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-12-06 00:54:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-12-06 00:54:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 00:54:43,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:43,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 645 states and 784 transitions. [2024-12-06 00:54:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 784 transitions. [2024-12-06 00:54:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-06 00:54:44,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:44,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 00:54:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 670 states and 809 transitions. [2024-12-06 00:54:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 809 transitions. [2024-12-06 00:54:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 00:54:45,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:45,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:45,380 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 00:54:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 672 states and 810 transitions. [2024-12-06 00:54:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 810 transitions. [2024-12-06 00:54:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 00:54:45,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:45,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:54:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 718 states and 868 transitions. [2024-12-06 00:54:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 868 transitions. [2024-12-06 00:54:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 00:54:46,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:54:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 733 states and 887 transitions. [2024-12-06 00:54:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 887 transitions. [2024-12-06 00:54:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 00:54:47,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:47,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:48,131 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 00:54:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 817 states and 985 transitions. [2024-12-06 00:54:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 985 transitions. [2024-12-06 00:54:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 00:54:51,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:51,551 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 00:54:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 869 states and 1051 transitions. [2024-12-06 00:54:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1051 transitions. [2024-12-06 00:54:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 00:54:53,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:53,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:54:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 931 states and 1123 transitions. [2024-12-06 00:54:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1123 transitions. [2024-12-06 00:54:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 00:54:55,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:55,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:54:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 933 states and 1124 transitions. [2024-12-06 00:54:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1124 transitions. [2024-12-06 00:54:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:54:55,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:56,208 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 00:54:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1009 states and 1218 transitions. [2024-12-06 00:54:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1218 transitions. [2024-12-06 00:54:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:54:57,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:58,075 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 00:54:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1028 states and 1239 transitions. [2024-12-06 00:54:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1239 transitions. [2024-12-06 00:54:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:54:58,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-06 00:55:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1051 states and 1265 transitions. [2024-12-06 00:55:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1265 transitions. [2024-12-06 00:55:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 00:55:00,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:00,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 00:55:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1066 states and 1284 transitions. [2024-12-06 00:55:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1284 transitions. [2024-12-06 00:55:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 00:55:01,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:01,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:55:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1158 states and 1380 transitions. [2024-12-06 00:55:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1380 transitions. [2024-12-06 00:55:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:55:03,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:03,903 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 00:55:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1199 states and 1427 transitions. [2024-12-06 00:55:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1427 transitions. [2024-12-06 00:55:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:55:05,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:05,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:05,557 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 00:55:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1232 states and 1465 transitions. [2024-12-06 00:55:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1465 transitions. [2024-12-06 00:55:06,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:55:06,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:06,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:06,745 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 00:55:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1233 states and 1466 transitions. [2024-12-06 00:55:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1466 transitions. [2024-12-06 00:55:07,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 00:55:07,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:07,641 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 00:55:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1291 states and 1538 transitions. [2024-12-06 00:55:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1538 transitions. [2024-12-06 00:55:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 00:55:08,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:09,142 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 00:55:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1293 states and 1539 transitions. [2024-12-06 00:55:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1539 transitions. [2024-12-06 00:55:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 00:55:09,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:09,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:55:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1331 states and 1582 transitions. [2024-12-06 00:55:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1582 transitions. [2024-12-06 00:55:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 00:55:10,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:11,217 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 00:55:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1353 states and 1611 transitions. [2024-12-06 00:55:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1611 transitions. [2024-12-06 00:55:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 00:55:12,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:13,253 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 00:55:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1386 states and 1646 transitions. [2024-12-06 00:55:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1646 transitions. [2024-12-06 00:55:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 00:55:14,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:14,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:15,201 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 00:55:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1388 states and 1650 transitions. [2024-12-06 00:55:15,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1650 transitions. [2024-12-06 00:55:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 00:55:15,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:15,795 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 00:55:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1411 states and 1676 transitions. [2024-12-06 00:55:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1676 transitions. [2024-12-06 00:55:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 00:55:17,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:17,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:17,697 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 00:55:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1427 states and 1692 transitions. [2024-12-06 00:55:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1692 transitions. [2024-12-06 00:55:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 00:55:18,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:19,392 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 00:55:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1472 states and 1753 transitions. [2024-12-06 00:55:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1753 transitions. [2024-12-06 00:55:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 00:55:21,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:22,220 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 00:55:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1483 states and 1762 transitions. [2024-12-06 00:55:23,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1762 transitions. [2024-12-06 00:55:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 00:55:23,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:23,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:23,479 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 00:55:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1500 states and 1783 transitions. [2024-12-06 00:55:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1783 transitions. [2024-12-06 00:55:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 00:55:24,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:25,072 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 00:55:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1503 states and 1786 transitions. [2024-12-06 00:55:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1786 transitions. [2024-12-06 00:55:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 00:55:25,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:55:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1637 states and 1938 transitions. [2024-12-06 00:55:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 1938 transitions. [2024-12-06 00:55:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 00:55:29,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:29,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:29,886 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 00:55:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1662 states and 1964 transitions. [2024-12-06 00:55:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 1964 transitions. [2024-12-06 00:55:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 00:55:30,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:30,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:31,300 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 00:55:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1675 states and 1979 transitions. [2024-12-06 00:55:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1979 transitions. [2024-12-06 00:55:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 00:55:31,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:32,169 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 00:55:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1678 states and 1983 transitions. [2024-12-06 00:55:32,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1983 transitions. [2024-12-06 00:55:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 00:55:32,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:32,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-06 00:55:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 1766 states and 2083 transitions. [2024-12-06 00:55:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2083 transitions. [2024-12-06 00:55:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-06 00:55:35,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:55:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 1840 states and 2159 transitions. [2024-12-06 00:55:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2159 transitions. [2024-12-06 00:55:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 00:55:37,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:37,979 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 00:55:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 1861 states and 2181 transitions. [2024-12-06 00:55:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2181 transitions. [2024-12-06 00:55:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 00:55:39,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:40,171 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 00:55:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 1863 states and 2183 transitions. [2024-12-06 00:55:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2183 transitions. [2024-12-06 00:55:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-06 00:55:40,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-06 00:55:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 1878 states and 2200 transitions. [2024-12-06 00:55:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2200 transitions. [2024-12-06 00:55:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-12-06 00:55:41,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:41,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-06 00:55:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1915 states and 2245 transitions. [2024-12-06 00:55:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2245 transitions. [2024-12-06 00:55:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-06 00:55:43,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:43,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:55:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 1926 states and 2257 transitions. [2024-12-06 00:55:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2257 transitions. [2024-12-06 00:55:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 00:55:44,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:55:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 1929 states and 2261 transitions. [2024-12-06 00:55:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2261 transitions. [2024-12-06 00:55:45,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-06 00:55:45,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:55:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 1932 states and 2264 transitions. [2024-12-06 00:55:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2264 transitions. [2024-12-06 00:55:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-06 00:55:46,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:46,856 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 00:55:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1945 states and 2279 transitions. [2024-12-06 00:55:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2279 transitions. [2024-12-06 00:55:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 00:55:48,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 00:55:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 1959 states and 2295 transitions. [2024-12-06 00:55:49,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2295 transitions. [2024-12-06 00:55:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 00:55:49,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:50,235 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 00:55:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2000 states and 2343 transitions. [2024-12-06 00:55:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2343 transitions. [2024-12-06 00:55:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 00:55:51,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:51,736 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 00:55:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2039 states and 2395 transitions. [2024-12-06 00:55:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2395 transitions. [2024-12-06 00:55:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 00:55:54,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-06 00:55:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2053 states and 2410 transitions. [2024-12-06 00:55:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2410 transitions. [2024-12-06 00:55:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 00:55:55,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-12-06 00:55:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2056 states and 2413 transitions. [2024-12-06 00:55:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2413 transitions. [2024-12-06 00:55:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-06 00:55:56,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:56,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-06 00:55:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2068 states and 2426 transitions. [2024-12-06 00:55:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2426 transitions. [2024-12-06 00:55:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-06 00:55:58,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-06 00:55:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2070 states and 2431 transitions. [2024-12-06 00:55:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2431 transitions. [2024-12-06 00:55:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:55:59,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:59,379 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 00:56:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2082 states and 2443 transitions. [2024-12-06 00:56:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2443 transitions. [2024-12-06 00:56:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:56:00,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:00,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:00,463 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 00:56:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2113 states and 2482 transitions. [2024-12-06 00:56:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2482 transitions. [2024-12-06 00:56:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:56:04,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:04,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:04,541 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 00:56:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2116 states and 2485 transitions. [2024-12-06 00:56:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2485 transitions. [2024-12-06 00:56:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 00:56:04,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:05,185 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 00:56:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2125 states and 2494 transitions. [2024-12-06 00:56:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2494 transitions. [2024-12-06 00:56:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 00:56:05,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:05,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:05,715 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 00:56:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2149 states and 2520 transitions. [2024-12-06 00:56:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2520 transitions. [2024-12-06 00:56:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:56:06,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:06,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:06,994 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 00:56:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2226 states and 2616 transitions. [2024-12-06 00:56:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2616 transitions. [2024-12-06 00:56:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:56:11,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:11,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:12,038 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 00:56:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2230 states and 2620 transitions. [2024-12-06 00:56:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2620 transitions. [2024-12-06 00:56:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:56:12,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:12,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-12-06 00:56:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2233 states and 2623 transitions. [2024-12-06 00:56:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 2623 transitions. [2024-12-06 00:56:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:56:13,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-12-06 00:56:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2236 states and 2626 transitions. [2024-12-06 00:56:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2626 transitions. [2024-12-06 00:56:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 00:56:13,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:14,065 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 00:56:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2239 states and 2629 transitions. [2024-12-06 00:56:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2629 transitions. [2024-12-06 00:56:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:56:14,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:14,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:14,645 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 00:56:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2250 states and 2642 transitions. [2024-12-06 00:56:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 2642 transitions. [2024-12-06 00:56:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:56:16,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:17,164 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 00:56:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2319 states and 2718 transitions. [2024-12-06 00:56:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 2718 transitions. [2024-12-06 00:56:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:56:24,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:25,224 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 00:56:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2321 states and 2719 transitions. [2024-12-06 00:56:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2719 transitions. [2024-12-06 00:56:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:56:25,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:25,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:25,840 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 00:56:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2322 states and 2720 transitions. [2024-12-06 00:56:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2720 transitions. [2024-12-06 00:56:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:56:26,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:26,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:27,007 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 00:56:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2368 states and 2767 transitions. [2024-12-06 00:56:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 2767 transitions. [2024-12-06 00:56:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:56:30,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:31,085 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 00:56:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2369 states and 2767 transitions. [2024-12-06 00:56:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 2767 transitions. [2024-12-06 00:56:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:56:31,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:31,997 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 00:56:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2370 states and 2767 transitions. [2024-12-06 00:56:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2767 transitions. [2024-12-06 00:56:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 00:56:32,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:33,236 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 00:56:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2377 states and 2774 transitions. [2024-12-06 00:56:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 2774 transitions. [2024-12-06 00:56:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 00:56:33,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:33,625 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 00:56:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2378 states and 2774 transitions. [2024-12-06 00:56:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 2774 transitions. [2024-12-06 00:56:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 00:56:34,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:34,759 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 00:56:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2409 states and 2807 transitions. [2024-12-06 00:56:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 2807 transitions. [2024-12-06 00:56:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 00:56:38,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:38,847 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 00:56:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2412 states and 2811 transitions. [2024-12-06 00:56:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2811 transitions. [2024-12-06 00:56:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 00:56:39,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:39,642 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 00:56:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2423 states and 2827 transitions. [2024-12-06 00:56:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2827 transitions. [2024-12-06 00:56:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 00:56:41,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:41,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 00:56:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2435 states and 2841 transitions. [2024-12-06 00:56:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 2841 transitions. [2024-12-06 00:56:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 00:56:43,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:43,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:44,294 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 00:56:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2562 states and 2985 transitions. [2024-12-06 00:56:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 2985 transitions. [2024-12-06 00:56:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 00:56:52,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:52,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:53,064 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 00:56:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 2623 states and 3054 transitions. [2024-12-06 00:56:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3054 transitions. [2024-12-06 00:56:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 00:56:55,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:55,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:55,914 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 00:56:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 2628 states and 3060 transitions. [2024-12-06 00:56:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 3060 transitions. [2024-12-06 00:56:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 00:56:56,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:56,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-12-06 00:56:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 2629 states and 3060 transitions. [2024-12-06 00:56:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3060 transitions. [2024-12-06 00:56:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 00:56:56,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:57,332 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 00:57:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 2681 states and 3108 transitions. [2024-12-06 00:57:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3108 transitions. [2024-12-06 00:57:00,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 00:57:00,924 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 98 iterations. [2024-12-06 00:57:00,933 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 00:57:34,013 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,013 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,014 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,014 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,014 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,015 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,015 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,015 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,015 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,016 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,016 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,016 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,017 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,017 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,017 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,017 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,018 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,018 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,018 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,018 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,019 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,019 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,019 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,019 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,019 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,020 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,020 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,020 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,020 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,021 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,021 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,021 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,021 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,021 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,022 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,022 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,022 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,022 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,022 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,023 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,023 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,023 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,023 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,024 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,024 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,024 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,024 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 00:57:34,024 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,024 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 00:57:34,024 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,025 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,025 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,025 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,025 INFO L77 FloydHoareUtils]: At program point L557-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-12-06 00:57:34,025 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,026 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,026 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,026 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 00:57:34,026 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,026 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,027 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,027 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,027 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,027 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,027 INFO L77 FloydHoareUtils]: At program point L560-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-12-06 00:57:34,027 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,028 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,028 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse6 (= 14 ~a8~0)) (.cse5 (= 5 ~a16~0)) (.cse2 (not .cse7)) (.cse1 (= ~a12~0 8)) (.cse4 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse0 .cse1 .cse5 .cse2 .cse3)) (not (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (and .cse1 .cse6 .cse5 .cse2)) (= ~a21~0 1) (not (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4)) (= ~a7~0 1))))) [2024-12-06 00:57:34,028 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 561) no Hoare annotation was computed. [2024-12-06 00:57:34,028 INFO L75 FloydHoareUtils]: For program point L561(line 561) no Hoare annotation was computed. [2024-12-06 00:57:34,028 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,029 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 00:57:34,029 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,029 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,029 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,029 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 00:57:34,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 12:57:34 ImpRootNode [2024-12-06 00:57:34,047 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 00:57:34,048 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 00:57:34,048 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 00:57:34,048 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 00:57:34,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:54:25" (3/4) ... [2024-12-06 00:57:34,051 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 00:57:34,066 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-12-06 00:57:34,067 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 00:57:34,068 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 00:57:34,069 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 00:57:34,188 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 00:57:34,188 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 00:57:34,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 00:57:34,189 INFO L158 Benchmark]: Toolchain (without parser) took 190661.02ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 90.9MB in the beginning and 785.9MB in the end (delta: -695.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-12-06 00:57:34,189 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:57:34,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.69ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 64.2MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 00:57:34,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.47ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 58.7MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:57:34,190 INFO L158 Benchmark]: Boogie Preprocessor took 63.11ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 54.4MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:57:34,191 INFO L158 Benchmark]: RCFGBuilder took 1538.44ms. Allocated memory is still 117.4MB. Free memory was 54.4MB in the beginning and 32.3MB in the end (delta: 22.1MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2024-12-06 00:57:34,191 INFO L158 Benchmark]: CodeCheck took 188295.09ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 32.3MB in the beginning and 798.5MB in the end (delta: -766.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-12-06 00:57:34,191 INFO L158 Benchmark]: Witness Printer took 140.31ms. Allocated memory is still 1.9GB. Free memory was 798.5MB in the beginning and 785.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:57:34,194 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: 155.1s, OverallIterations: 98, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292331 SdHoareTripleChecker+Valid, 819.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291465 mSDsluCounter, 38601 SdHoareTripleChecker+Invalid, 701.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32752 mSDsCounter, 63558 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634205 IncrementalHoareTripleChecker+Invalid, 697763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63558 mSolverCounterUnsat, 5849 mSDtfsCounter, 634205 mSolverCounterSat, 6.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132389 GetRequests, 124432 SyntacticMatches, 7039 SemanticMatches, 918 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584545 ImplicationChecksByTransitivity, 102.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 29.0s InterpolantComputationTime, 19745 NumberOfCodeBlocks, 19745 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 19648 ConstructedInterpolants, 0 QuantifiedInterpolants, 158817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 25 PerfectInterpolantSequences, 17823/23166 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: 561]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((!(((((a12 == 8) && (5 == a16)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 540.69ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 64.2MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.47ms. Allocated memory is still 117.4MB. Free memory was 63.9MB in the beginning and 58.7MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.11ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 54.4MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1538.44ms. Allocated memory is still 117.4MB. Free memory was 54.4MB in the beginning and 32.3MB in the end (delta: 22.1MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * CodeCheck took 188295.09ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 32.3MB in the beginning and 798.5MB in the end (delta: -766.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 140.31ms. Allocated memory is still 1.9GB. Free memory was 798.5MB in the beginning and 785.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 00:57:34,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a947776b-5127-4ca2-be48-34da39421534/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE