./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label25.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_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3 --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 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 05:12:01,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 05:12:01,501 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 05:12:01,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 05:12:01,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 05:12:01,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 05:12:01,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 05:12:01,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 05:12:01,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 05:12:01,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 05:12:01,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 05:12:01,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 05:12:01,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 05:12:01,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 05:12:01,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 05:12:01,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 05:12:01,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 05:12:01,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 05:12:01,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 05:12:01,547 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 05:12:01,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 05:12:01,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 05:12:01,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 05:12:01,548 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 05:12:01,548 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 05:12:01,548 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 05:12:01,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 05:12:01,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 05:12:01,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 05:12:01,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 05:12:01,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 05:12:01,549 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 05:12:01,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 05:12:01,549 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_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3 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 -> 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8 [2024-11-25 05:12:01,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 05:12:01,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 05:12:01,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 05:12:01,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 05:12:01,868 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 05:12:01,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2024-11-25 05:12:04,904 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/data/c469d74b3/241ebda0948f4ae8b2b41994a8787460/FLAG339eb3dc9 [2024-11-25 05:12:05,318 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 05:12:05,318 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2024-11-25 05:12:05,344 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/data/c469d74b3/241ebda0948f4ae8b2b41994a8787460/FLAG339eb3dc9 [2024-11-25 05:12:05,369 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/data/c469d74b3/241ebda0948f4ae8b2b41994a8787460 [2024-11-25 05:12:05,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 05:12:05,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 05:12:05,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 05:12:05,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 05:12:05,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 05:12:05,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:05" (1/1) ... [2024-11-25 05:12:05,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299bb676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:05, skipping insertion in model container [2024-11-25 05:12:05,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:05" (1/1) ... [2024-11-25 05:12:05,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 05:12:05,902 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_f17ddbbf-5e83-45b4-b871-87df807b6052/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359] [2024-11-25 05:12:05,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 05:12:05,952 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 05:12:06,096 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_f17ddbbf-5e83-45b4-b871-87df807b6052/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359] [2024-11-25 05:12:06,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 05:12:06,131 INFO L204 MainTranslator]: Completed translation [2024-11-25 05:12:06,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06 WrapperNode [2024-11-25 05:12:06,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 05:12:06,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 05:12:06,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 05:12:06,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 05:12:06,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,231 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 05:12:06,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 05:12:06,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 05:12:06,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 05:12:06,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 05:12:06,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 05:12:06,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 05:12:06,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 05:12:06,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 05:12:06,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06" (1/1) ... [2024-11-25 05:12:06,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 05:12:06,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 05:12:06,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 05:12:06,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 05:12:06,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 05:12:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 05:12:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 05:12:06,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 05:12:06,476 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 05:12:06,478 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 05:12:07,835 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 05:12:07,836 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 05:12:08,209 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 05:12:08,209 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 05:12:08,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:08 BoogieIcfgContainer [2024-11-25 05:12:08,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 05:12:08,211 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 05:12:08,211 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 05:12:08,221 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 05:12:08,221 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:08" (1/1) ... [2024-11-25 05:12:08,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 05:12:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 05:12:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 05:12:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 05:12:08,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-25 05:12:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-25 05:12:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 05:12:10,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-25 05:12:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-25 05:12:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 05:12:11,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-25 05:12:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-25 05:12:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-25 05:12:12,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-25 05:12:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-25 05:12:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-25 05:12:14,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:14,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:12:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-25 05:12:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-25 05:12:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 05:12:14,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:12:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-25 05:12:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-25 05:12:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-25 05:12:14,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 05:12:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-25 05:12:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-25 05:12:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 05:12:16,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:16,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 05:12:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-25 05:12:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-25 05:12:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 05:12:17,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:17,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:12:18,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-25 05:12:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-25 05:12:18,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-25 05:12:18,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:12:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-25 05:12:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-25 05:12:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 05:12:20,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:12:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-25 05:12:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-25 05:12:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 05:12:20,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:20,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-25 05:12:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-25 05:12:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 05:12:23,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:23,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-25 05:12:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-25 05:12:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 05:12:23,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 05:12:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-11-25 05:12:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-11-25 05:12:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 05:12:24,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:12:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-11-25 05:12:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-11-25 05:12:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 05:12:24,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:24,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-11-25 05:12:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-11-25 05:12:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 05:12:26,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:26,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-11-25 05:12:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-11-25 05:12:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 05:12:28,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-25 05:12:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-25 05:12:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 05:12:29,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:29,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:12:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-11-25 05:12:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-11-25 05:12:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 05:12:29,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:29,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:12:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-11-25 05:12:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-11-25 05:12:31,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-25 05:12:31,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:31,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-25 05:12:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-11-25 05:12:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-11-25 05:12:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 05:12:31,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:31,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:12:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 658 states and 796 transitions. [2024-11-25 05:12:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 796 transitions. [2024-11-25 05:12:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 05:12:32,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:32,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:12:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 705 states and 856 transitions. [2024-11-25 05:12:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 856 transitions. [2024-11-25 05:12:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 05:12:33,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:33,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:12:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 720 states and 876 transitions. [2024-11-25 05:12:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 876 transitions. [2024-11-25 05:12:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 05:12:34,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 804 states and 974 transitions. [2024-11-25 05:12:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 974 transitions. [2024-11-25 05:12:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 05:12:38,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 854 states and 1037 transitions. [2024-11-25 05:12:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1037 transitions. [2024-11-25 05:12:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 05:12:40,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:40,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 856 states and 1040 transitions. [2024-11-25 05:12:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1040 transitions. [2024-11-25 05:12:41,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 05:12:41,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:12:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 918 states and 1113 transitions. [2024-11-25 05:12:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1113 transitions. [2024-11-25 05:12:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 05:12:43,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:43,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:12:44,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 920 states and 1114 transitions. [2024-11-25 05:12:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1114 transitions. [2024-11-25 05:12:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:12:44,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1013 states and 1227 transitions. [2024-11-25 05:12:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1227 transitions. [2024-11-25 05:12:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:12:47,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1017 states and 1232 transitions. [2024-11-25 05:12:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1232 transitions. [2024-11-25 05:12:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:12:48,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:12:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1052 states and 1273 transitions. [2024-11-25 05:12:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1273 transitions. [2024-11-25 05:12:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 05:12:50,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 05:12:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1067 states and 1292 transitions. [2024-11-25 05:12:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1292 transitions. [2024-11-25 05:12:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-25 05:12:51,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 05:12:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1137 states and 1364 transitions. [2024-11-25 05:12:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1364 transitions. [2024-11-25 05:12:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 05:12:54,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1203 states and 1438 transitions. [2024-11-25 05:12:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1438 transitions. [2024-11-25 05:12:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 05:12:56,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:56,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1234 states and 1474 transitions. [2024-11-25 05:12:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1474 transitions. [2024-11-25 05:12:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 05:12:57,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:57,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:12:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:12:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1235 states and 1475 transitions. [2024-11-25 05:12:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1475 transitions. [2024-11-25 05:12:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 05:12:58,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:12:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:12:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:12:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:13:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1293 states and 1547 transitions. [2024-11-25 05:13:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1547 transitions. [2024-11-25 05:13:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 05:13:00,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:13:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1295 states and 1548 transitions. [2024-11-25 05:13:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1548 transitions. [2024-11-25 05:13:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 05:13:00,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:13:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1316 states and 1571 transitions. [2024-11-25 05:13:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1571 transitions. [2024-11-25 05:13:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:13:02,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:13:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1351 states and 1608 transitions. [2024-11-25 05:13:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1608 transitions. [2024-11-25 05:13:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:13:03,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:03,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:13:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1403 states and 1669 transitions. [2024-11-25 05:13:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1669 transitions. [2024-11-25 05:13:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:13:06,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:06,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:13:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1405 states and 1672 transitions. [2024-11-25 05:13:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1672 transitions. [2024-11-25 05:13:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:13:07,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:07,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:13:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1406 states and 1672 transitions. [2024-11-25 05:13:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1672 transitions. [2024-11-25 05:13:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 05:13:08,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:08,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1408 states and 1676 transitions. [2024-11-25 05:13:09,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1676 transitions. [2024-11-25 05:13:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 05:13:09,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:09,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1431 states and 1702 transitions. [2024-11-25 05:13:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1702 transitions. [2024-11-25 05:13:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 05:13:11,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:11,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1448 states and 1719 transitions. [2024-11-25 05:13:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1719 transitions. [2024-11-25 05:13:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:13:12,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:13,503 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 05:13:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1510 states and 1799 transitions. [2024-11-25 05:13:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1799 transitions. [2024-11-25 05:13:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:13:17,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 05:13:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1522 states and 1809 transitions. [2024-11-25 05:13:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1809 transitions. [2024-11-25 05:13:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:13:18,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 05:13:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1525 states and 1812 transitions. [2024-11-25 05:13:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1812 transitions. [2024-11-25 05:13:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 05:13:19,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:13:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1659 states and 1964 transitions. [2024-11-25 05:13:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 1964 transitions. [2024-11-25 05:13:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:13:23,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 05:13:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 1699 states and 2008 transitions. [2024-11-25 05:13:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2008 transitions. [2024-11-25 05:13:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:13:26,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:26,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1712 states and 2023 transitions. [2024-11-25 05:13:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2023 transitions. [2024-11-25 05:13:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:13:27,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:13:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 1715 states and 2027 transitions. [2024-11-25 05:13:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2027 transitions. [2024-11-25 05:13:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 05:13:28,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:28,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 05:13:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 1803 states and 2130 transitions. [2024-11-25 05:13:31,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2130 transitions. [2024-11-25 05:13:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-25 05:13:31,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:13:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 1877 states and 2206 transitions. [2024-11-25 05:13:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2206 transitions. [2024-11-25 05:13:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 05:13:33,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:13:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 1898 states and 2228 transitions. [2024-11-25 05:13:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2228 transitions. [2024-11-25 05:13:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-25 05:13:36,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:36,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-25 05:13:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 1900 states and 2230 transitions. [2024-11-25 05:13:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2230 transitions. [2024-11-25 05:13:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 05:13:36,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:36,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-25 05:13:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 1915 states and 2247 transitions. [2024-11-25 05:13:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2247 transitions. [2024-11-25 05:13:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-25 05:13:37,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:37,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 05:13:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 1952 states and 2292 transitions. [2024-11-25 05:13:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2292 transitions. [2024-11-25 05:13:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 05:13:39,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:13:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 1963 states and 2305 transitions. [2024-11-25 05:13:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2305 transitions. [2024-11-25 05:13:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-25 05:13:42,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 159 proven. 90 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:13:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 1995 states and 2344 transitions. [2024-11-25 05:13:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2344 transitions. [2024-11-25 05:13:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-25 05:13:45,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:45,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:13:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2012 states and 2363 transitions. [2024-11-25 05:13:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2363 transitions. [2024-11-25 05:13:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 05:13:47,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 05:13:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2026 states and 2378 transitions. [2024-11-25 05:13:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2378 transitions. [2024-11-25 05:13:49,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 05:13:49,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 05:13:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2067 states and 2426 transitions. [2024-11-25 05:13:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2426 transitions. [2024-11-25 05:13:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-25 05:13:50,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:50,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:13:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2106 states and 2478 transitions. [2024-11-25 05:13:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 2478 transitions. [2024-11-25 05:13:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 05:13:54,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 05:13:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2120 states and 2493 transitions. [2024-11-25 05:13:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2493 transitions. [2024-11-25 05:13:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-25 05:13:56,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 05:13:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2132 states and 2508 transitions. [2024-11-25 05:13:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2508 transitions. [2024-11-25 05:13:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-25 05:13:57,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 05:13:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2134 states and 2511 transitions. [2024-11-25 05:13:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2511 transitions. [2024-11-25 05:13:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:13:58,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:58,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-25 05:13:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:13:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2146 states and 2525 transitions. [2024-11-25 05:13:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2525 transitions. [2024-11-25 05:13:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:13:59,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:13:59,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:13:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:13:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-25 05:14:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2147 states and 2525 transitions. [2024-11-25 05:14:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2525 transitions. [2024-11-25 05:14:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:14:00,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:00,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2192 states and 2578 transitions. [2024-11-25 05:14:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2578 transitions. [2024-11-25 05:14:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:14:04,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2193 states and 2578 transitions. [2024-11-25 05:14:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2578 transitions. [2024-11-25 05:14:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:14:05,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:05,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:14:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2196 states and 2581 transitions. [2024-11-25 05:14:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2581 transitions. [2024-11-25 05:14:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 05:14:06,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:06,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2205 states and 2590 transitions. [2024-11-25 05:14:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2590 transitions. [2024-11-25 05:14:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 05:14:07,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-25 05:14:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2229 states and 2616 transitions. [2024-11-25 05:14:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2616 transitions. [2024-11-25 05:14:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 05:14:08,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2257 states and 2658 transitions. [2024-11-25 05:14:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2658 transitions. [2024-11-25 05:14:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 05:14:11,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:11,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2278 states and 2679 transitions. [2024-11-25 05:14:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2679 transitions. [2024-11-25 05:14:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 05:14:13,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:13,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-25 05:14:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2281 states and 2682 transitions. [2024-11-25 05:14:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 2682 transitions. [2024-11-25 05:14:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 05:14:14,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-25 05:14:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2284 states and 2685 transitions. [2024-11-25 05:14:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2685 transitions. [2024-11-25 05:14:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-25 05:14:14,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 05:14:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2287 states and 2691 transitions. [2024-11-25 05:14:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2691 transitions. [2024-11-25 05:14:16,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:14:16,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:16,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:14:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2298 states and 2704 transitions. [2024-11-25 05:14:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2704 transitions. [2024-11-25 05:14:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:14:18,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:18,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:14:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2358 states and 2771 transitions. [2024-11-25 05:14:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2771 transitions. [2024-11-25 05:14:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:14:24,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:24,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:14:30,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2407 states and 2824 transitions. [2024-11-25 05:14:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 2824 transitions. [2024-11-25 05:14:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:14:30,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:30,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:14:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2421 states and 2837 transitions. [2024-11-25 05:14:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 2837 transitions. [2024-11-25 05:14:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:14:33,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 05:14:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2424 states and 2849 transitions. [2024-11-25 05:14:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2849 transitions. [2024-11-25 05:14:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:14:34,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:34,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 05:14:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2425 states and 2849 transitions. [2024-11-25 05:14:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 2849 transitions. [2024-11-25 05:14:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:14:35,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:35,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 05:14:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2426 states and 2851 transitions. [2024-11-25 05:14:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2851 transitions. [2024-11-25 05:14:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-25 05:14:36,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:36,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2433 states and 2858 transitions. [2024-11-25 05:14:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 2858 transitions. [2024-11-25 05:14:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-25 05:14:36,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:14:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2456 states and 2887 transitions. [2024-11-25 05:14:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 2887 transitions. [2024-11-25 05:14:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-25 05:14:40,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:40,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:14:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2487 states and 2920 transitions. [2024-11-25 05:14:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 2920 transitions. [2024-11-25 05:14:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 05:14:44,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:44,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:14:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2490 states and 2924 transitions. [2024-11-25 05:14:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 2924 transitions. [2024-11-25 05:14:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 05:14:44,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:44,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:14:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2501 states and 2938 transitions. [2024-11-25 05:14:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 2938 transitions. [2024-11-25 05:14:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 05:14:47,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:47,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:14:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2502 states and 2938 transitions. [2024-11-25 05:14:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2938 transitions. [2024-11-25 05:14:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 05:14:48,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:14:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2515 states and 2960 transitions. [2024-11-25 05:14:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 2960 transitions. [2024-11-25 05:14:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 05:14:51,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:14:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-25 05:14:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:14:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 2640 states and 3104 transitions. [2024-11-25 05:14:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3104 transitions. [2024-11-25 05:14:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 05:14:59,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:14:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:14:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:15:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:15:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:15:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 2701 states and 3173 transitions. [2024-11-25 05:15:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3173 transitions. [2024-11-25 05:15:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 05:15:03,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:15:03,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:15:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:15:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:15:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:15:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 2706 states and 3179 transitions. [2024-11-25 05:15:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3179 transitions. [2024-11-25 05:15:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-25 05:15:04,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:15:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:15:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:15:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-25 05:15:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:15:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 2707 states and 3179 transitions. [2024-11-25 05:15:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2707 states and 3179 transitions. [2024-11-25 05:15:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 05:15:04,674 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:15:04,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:15:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:15:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-25 05:15:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:15:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 2759 states and 3228 transitions. [2024-11-25 05:15:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3228 transitions. [2024-11-25 05:15:09,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 05:15:09,281 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 101 iterations. [2024-11-25 05:15:09,291 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 05:15:46,830 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,830 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,830 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,831 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,831 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,831 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,832 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,832 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,832 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,832 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,833 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,833 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,833 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,833 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,834 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,834 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,834 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,834 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,835 INFO L77 FloydHoareUtils]: At program point L539-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-25 05:15:46,835 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,835 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,835 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,835 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,836 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,836 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,836 INFO L77 FloydHoareUtils]: At program point L542-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-25 05:15:46,836 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,836 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,836 INFO L75 FloydHoareUtils]: For program point L543(line 543) no Hoare annotation was computed. [2024-11-25 05:15:46,837 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,837 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,837 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,837 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,837 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,837 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,837 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,838 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,838 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,838 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,838 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,838 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,838 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,839 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,839 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,840 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,840 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,840 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,840 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,840 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,840 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 05:15:46,841 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,841 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-25 05:15:46,841 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,841 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,841 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,842 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,842 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,842 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,842 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,842 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 05:15:46,843 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,843 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,843 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,843 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,843 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,844 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,844 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,844 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,844 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-25 05:15:46,844 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2024-11-25 05:15:46,844 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,844 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-25 05:15:46,845 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,845 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,845 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:15:46,845 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse3 (= ~a12~0 8)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse0 (not (and .cse3 .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7)))) [2024-11-25 05:15:46,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 05:15:46 ImpRootNode [2024-11-25 05:15:46,862 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 05:15:46,863 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 05:15:46,863 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 05:15:46,863 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 05:15:46,864 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:08" (3/4) ... [2024-11-25 05:15:46,867 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 05:15:46,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-25 05:15:46,883 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-25 05:15:46,884 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-25 05:15:46,885 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 05:15:47,033 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 05:15:47,034 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 05:15:47,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 05:15:47,035 INFO L158 Benchmark]: Toolchain (without parser) took 221661.15ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 90.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 454.3MB. Max. memory is 16.1GB. [2024-11-25 05:15:47,035 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 05:15:47,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 755.86ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 63.6MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 05:15:47,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.46ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 58.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 05:15:47,036 INFO L158 Benchmark]: Boogie Preprocessor took 81.72ms. Allocated memory is still 117.4MB. Free memory was 58.0MB in the beginning and 53.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 05:15:47,037 INFO L158 Benchmark]: RCFGBuilder took 1892.37ms. Allocated memory is still 117.4MB. Free memory was 53.9MB in the beginning and 68.9MB in the end (delta: -14.9MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2024-11-25 05:15:47,037 INFO L158 Benchmark]: CodeCheck took 218651.76ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 68.9MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 417.8MB. Max. memory is 16.1GB. [2024-11-25 05:15:47,037 INFO L158 Benchmark]: Witness Printer took 170.68ms. Allocated memory is still 2.5GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 05:15:47,042 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: 181.0s, OverallIterations: 101, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 310604 SdHoareTripleChecker+Valid, 909.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309711 mSDsluCounter, 40939 SdHoareTripleChecker+Invalid, 788.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34745 mSDsCounter, 65808 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 671520 IncrementalHoareTripleChecker+Invalid, 737328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65808 mSolverCounterUnsat, 6194 mSDtfsCounter, 671520 mSolverCounterSat, 7.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137000 GetRequests, 128411 SyntacticMatches, 7615 SemanticMatches, 974 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697832 ImplicationChecksByTransitivity, 123.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 33.1s InterpolantComputationTime, 20394 NumberOfCodeBlocks, 20394 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 20294 ConstructedInterpolants, 0 QuantifiedInterpolants, 161191 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 100 InterpolantComputations, 27 PerfectInterpolantSequences, 18777/23969 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: 543]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !(((((!((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((((!((((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15))) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 755.86ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 63.6MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.46ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 58.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.72ms. Allocated memory is still 117.4MB. Free memory was 58.0MB in the beginning and 53.9MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1892.37ms. Allocated memory is still 117.4MB. Free memory was 53.9MB in the beginning and 68.9MB in the end (delta: -14.9MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * CodeCheck took 218651.76ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 68.9MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 417.8MB. Max. memory is 16.1GB. * Witness Printer took 170.68ms. Allocated memory is still 2.5GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 05:15:47,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f17ddbbf-5e83-45b4-b871-87df807b6052/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE