./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f4b32ab55ef7da7a1c45381b7a9ca93704fa76788ea88b9dbed6ebccc0ba509 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:56:59,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:56:59,477 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:56:59,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:56:59,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:56:59,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:56:59,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:56:59,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:56:59,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:56:59,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:56:59,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:56:59,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:56:59,523 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:56:59,523 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:56:59,524 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:56:59,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:56:59,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:56:59,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:56:59,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:56:59,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:56:59,525 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:56:59,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:56:59,525 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_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f4b32ab55ef7da7a1c45381b7a9ca93704fa76788ea88b9dbed6ebccc0ba509 [2024-11-13 22:56:59,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:56:59,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:56:59,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:56:59,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:56:59,915 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:56:59,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c Unable to find full path for "g++" [2024-11-13 22:57:01,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:57:02,298 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:57:02,298 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2024-11-13 22:57:02,321 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/data/0781984b0/2ff50c31624840f79b89d492dc291a3e/FLAGf32706ffc [2024-11-13 22:57:02,482 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/data/0781984b0/2ff50c31624840f79b89d492dc291a3e [2024-11-13 22:57:02,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:57:02,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:57:02,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:57:02,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:57:02,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:57:02,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:57:02" (1/1) ... [2024-11-13 22:57:02,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c9631b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:02, skipping insertion in model container [2024-11-13 22:57:02,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:57:02" (1/1) ... [2024-11-13 22:57:02,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:57:02,868 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_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/sv-benchmarks/c/eca-rers2012/Problem01_label10.c[19224,19237] [2024-11-13 22:57:02,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:57:02,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:57:03,019 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_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/sv-benchmarks/c/eca-rers2012/Problem01_label10.c[19224,19237] [2024-11-13 22:57:03,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:57:03,055 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:57:03,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03 WrapperNode [2024-11-13 22:57:03,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:57:03,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:57:03,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:57:03,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:57:03,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,159 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 22:57:03,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:57:03,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:57:03,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:57:03,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:57:03,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:57:03,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:57:03,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:57:03,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:57:03,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:57:03" (1/1) ... [2024-11-13 22:57:03,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:57:03,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:57:03,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:57:03,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:57:03,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:57:03,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:57:03,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:57:03,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:57:03,436 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:57:03,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:57:04,940 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 22:57:04,942 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:57:05,324 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:57:05,326 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:57:05,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:57:05 BoogieIcfgContainer [2024-11-13 22:57:05,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:57:05,328 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:57:05,328 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:57:05,341 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:57:05,341 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:57:05" (1/1) ... [2024-11-13 22:57:05,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:57:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 22:57:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 22:57:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 22:57:05,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:57:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-13 22:57:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-13 22:57:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 22:57:07,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:07,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:07,648 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-13 22:57:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-13 22:57:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-13 22:57:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 22:57:08,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:08,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:09,530 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-13 22:57:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-13 22:57:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-13 22:57:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 22:57:10,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:10,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:11,118 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-13 22:57:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-13 22:57:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-13 22:57:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 22:57:11,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:11,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:12,132 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-13 22:57:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-13 22:57:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-13 22:57:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 22:57:12,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:12,817 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-13 22:57:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-13 22:57:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-13 22:57:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 22:57:12,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:13,265 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-13 22:57:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-13 22:57:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-13 22:57:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 22:57:14,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:14,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:14,781 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-13 22:57:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-13 22:57:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-13 22:57:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 22:57:15,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:15,936 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-13 22:57:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-13 22:57:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-13 22:57:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 22:57:16,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:17,279 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-13 22:57:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-13 22:57:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-13 22:57:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 22:57:18,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:18,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:19,336 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-13 22:57:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-13 22:57:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-13 22:57:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 22:57:19,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:20,081 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-13 22:57:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-13 22:57:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-13 22:57:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 22:57:22,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:22,695 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-13 22:57:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-13 22:57:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-13 22:57:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 22:57:22,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:22,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:23,051 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-13 22:57:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-11-13 22:57:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-11-13 22:57:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 22:57:23,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:24,020 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-13 22:57:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-11-13 22:57:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-11-13 22:57:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 22:57:24,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:24,678 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-13 22:57:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-11-13 22:57:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-11-13 22:57:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 22:57:26,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:27,233 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-13 22:57:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-11-13 22:57:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-11-13 22:57:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 22:57:28,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:28,942 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-13 22:57:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-13 22:57:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-13 22:57:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 22:57:29,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:29,557 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-13 22:57:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-11-13 22:57:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-11-13 22:57:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 22:57:29,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:30,096 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-13 22:57:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-11-13 22:57:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-11-13 22:57:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 22:57:31,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:31,568 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-13 22:57:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-11-13 22:57:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-11-13 22:57:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 22:57:31,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:32,134 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-13 22:57:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 658 states and 796 transitions. [2024-11-13 22:57:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 796 transitions. [2024-11-13 22:57:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 22:57:32,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:32,710 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-13 22:57:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 705 states and 856 transitions. [2024-11-13 22:57:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 856 transitions. [2024-11-13 22:57:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 22:57:34,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:34,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:34,521 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-13 22:57:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 720 states and 876 transitions. [2024-11-13 22:57:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 876 transitions. [2024-11-13 22:57:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 22:57:35,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:35,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:35,814 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-13 22:57:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 804 states and 972 transitions. [2024-11-13 22:57:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 972 transitions. [2024-11-13 22:57:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:57:39,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:39,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:57:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 853 states and 1034 transitions. [2024-11-13 22:57:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1034 transitions. [2024-11-13 22:57:41,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 22:57:41,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:41,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:57:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 856 states and 1038 transitions. [2024-11-13 22:57:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1038 transitions. [2024-11-13 22:57:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 22:57:41,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:41,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:42,509 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-13 22:57:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 918 states and 1111 transitions. [2024-11-13 22:57:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1111 transitions. [2024-11-13 22:57:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 22:57:44,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:44,698 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-13 22:57:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 920 states and 1112 transitions. [2024-11-13 22:57:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1112 transitions. [2024-11-13 22:57:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:57:45,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:45,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:57:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1013 states and 1225 transitions. [2024-11-13 22:57:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1225 transitions. [2024-11-13 22:57:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:57:48,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:57:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1017 states and 1230 transitions. [2024-11-13 22:57:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1230 transitions. [2024-11-13 22:57:49,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 22:57:49,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:49,976 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-13 22:57:51,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1052 states and 1271 transitions. [2024-11-13 22:57:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1271 transitions. [2024-11-13 22:57:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 22:57:51,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:52,115 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-13 22:57:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1067 states and 1290 transitions. [2024-11-13 22:57:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1290 transitions. [2024-11-13 22:57:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 22:57:52,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:57:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1159 states and 1386 transitions. [2024-11-13 22:57:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1386 transitions. [2024-11-13 22:57:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:57:55,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:55,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:57:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1205 states and 1440 transitions. [2024-11-13 22:57:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1440 transitions. [2024-11-13 22:57:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 22:57:57,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:57,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:57:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1206 states and 1441 transitions. [2024-11-13 22:57:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1441 transitions. [2024-11-13 22:57:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 22:57:57,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 22:57:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:57:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1252 states and 1499 transitions. [2024-11-13 22:57:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1499 transitions. [2024-11-13 22:57:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 22:57:59,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:57:59,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:57:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:57:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 22:58:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1266 states and 1514 transitions. [2024-11-13 22:58:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1514 transitions. [2024-11-13 22:58:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 22:58:00,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:00,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:00,407 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-13 22:58:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1304 states and 1557 transitions. [2024-11-13 22:58:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1557 transitions. [2024-11-13 22:58:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:58:01,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:01,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:02,064 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-13 22:58:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1339 states and 1594 transitions. [2024-11-13 22:58:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1594 transitions. [2024-11-13 22:58:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:58:03,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 22:58:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1392 states and 1655 transitions. [2024-11-13 22:58:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1655 transitions. [2024-11-13 22:58:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 22:58:06,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 22:58:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1394 states and 1658 transitions. [2024-11-13 22:58:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1658 transitions. [2024-11-13 22:58:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:58:07,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:58:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1422 states and 1692 transitions. [2024-11-13 22:58:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1692 transitions. [2024-11-13 22:58:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:58:09,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:58:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1445 states and 1718 transitions. [2024-11-13 22:58:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1718 transitions. [2024-11-13 22:58:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 22:58:11,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:58:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1463 states and 1735 transitions. [2024-11-13 22:58:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1735 transitions. [2024-11-13 22:58:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:58:13,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:14,207 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-13 22:58:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1527 states and 1816 transitions. [2024-11-13 22:58:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1816 transitions. [2024-11-13 22:58:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:58:18,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:18,412 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-13 22:58:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1537 states and 1825 transitions. [2024-11-13 22:58:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1825 transitions. [2024-11-13 22:58:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 22:58:19,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:20,001 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-13 22:58:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1540 states and 1828 transitions. [2024-11-13 22:58:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1828 transitions. [2024-11-13 22:58:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 22:58:20,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:20,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:58:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1674 states and 1976 transitions. [2024-11-13 22:58:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1976 transitions. [2024-11-13 22:58:25,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:58:25,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:25,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:25,397 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-13 22:58:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 1699 states and 2002 transitions. [2024-11-13 22:58:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2002 transitions. [2024-11-13 22:58:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:58:26,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:26,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:26,683 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-13 22:58:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1712 states and 2017 transitions. [2024-11-13 22:58:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2017 transitions. [2024-11-13 22:58:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 22:58:27,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:27,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:27,708 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-13 22:58:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 1715 states and 2021 transitions. [2024-11-13 22:58:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2021 transitions. [2024-11-13 22:58:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 22:58:28,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:28,794 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-13 22:58:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 1803 states and 2123 transitions. [2024-11-13 22:58:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2123 transitions. [2024-11-13 22:58:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 22:58:31,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 22:58:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 1877 states and 2199 transitions. [2024-11-13 22:58:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2199 transitions. [2024-11-13 22:58:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-13 22:58:34,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:34,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:34,999 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-13 22:58:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 1898 states and 2221 transitions. [2024-11-13 22:58:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2221 transitions. [2024-11-13 22:58:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-13 22:58:36,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:37,157 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-13 22:58:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 1900 states and 2223 transitions. [2024-11-13 22:58:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2223 transitions. [2024-11-13 22:58:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 22:58:37,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:37,802 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-13 22:58:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 1915 states and 2240 transitions. [2024-11-13 22:58:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2240 transitions. [2024-11-13 22:58:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 22:58:38,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:38,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:38,840 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-13 22:58:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 1952 states and 2285 transitions. [2024-11-13 22:58:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2285 transitions. [2024-11-13 22:58:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-13 22:58:40,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 22:58:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 1981 states and 2319 transitions. [2024-11-13 22:58:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2319 transitions. [2024-11-13 22:58:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-13 22:58:42,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:42,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:58:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 1995 states and 2336 transitions. [2024-11-13 22:58:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2336 transitions. [2024-11-13 22:58:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-13 22:58:44,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 22:58:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2001 states and 2344 transitions. [2024-11-13 22:58:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2344 transitions. [2024-11-13 22:58:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:58:46,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:46,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:46,784 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-13 22:58:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2004 states and 2347 transitions. [2024-11-13 22:58:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2347 transitions. [2024-11-13 22:58:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-13 22:58:47,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:47,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-13 22:58:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2045 states and 2395 transitions. [2024-11-13 22:58:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2395 transitions. [2024-11-13 22:58:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 22:58:49,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:49,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:49,622 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-13 22:58:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2084 states and 2449 transitions. [2024-11-13 22:58:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2449 transitions. [2024-11-13 22:58:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:58:53,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:53,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:53,478 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-13 22:58:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2098 states and 2464 transitions. [2024-11-13 22:58:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2464 transitions. [2024-11-13 22:58:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-13 22:58:54,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-13 22:58:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2101 states and 2466 transitions. [2024-11-13 22:58:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2466 transitions. [2024-11-13 22:58:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 22:58:55,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:55,899 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-13 22:58:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2113 states and 2479 transitions. [2024-11-13 22:58:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2479 transitions. [2024-11-13 22:58:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-13 22:58:57,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:57,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:57,520 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-13 22:58:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2115 states and 2484 transitions. [2024-11-13 22:58:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2484 transitions. [2024-11-13 22:58:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:58:58,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:58,462 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-13 22:58:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2127 states and 2498 transitions. [2024-11-13 22:58:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2498 transitions. [2024-11-13 22:58:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:58:59,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:58:59,607 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-13 22:58:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:58:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2128 states and 2498 transitions. [2024-11-13 22:58:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2498 transitions. [2024-11-13 22:58:59,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:58:59,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:58:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:58:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:59:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2205 states and 2597 transitions. [2024-11-13 22:59:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2597 transitions. [2024-11-13 22:59:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-13 22:59:07,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:59:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2222 states and 2613 transitions. [2024-11-13 22:59:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2613 transitions. [2024-11-13 22:59:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 22:59:09,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:09,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:59:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2231 states and 2622 transitions. [2024-11-13 22:59:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2622 transitions. [2024-11-13 22:59:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-13 22:59:10,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:10,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-13 22:59:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2255 states and 2648 transitions. [2024-11-13 22:59:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2648 transitions. [2024-11-13 22:59:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:59:11,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:12,067 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-13 22:59:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2297 states and 2704 transitions. [2024-11-13 22:59:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 2704 transitions. [2024-11-13 22:59:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:59:15,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:15,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:15,513 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-13 22:59:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2301 states and 2708 transitions. [2024-11-13 22:59:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2708 transitions. [2024-11-13 22:59:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:59:16,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:59:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2316 states and 2731 transitions. [2024-11-13 22:59:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 2731 transitions. [2024-11-13 22:59:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:59:19,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:59:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2318 states and 2733 transitions. [2024-11-13 22:59:20,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2733 transitions. [2024-11-13 22:59:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-13 22:59:20,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:20,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:59:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2323 states and 2742 transitions. [2024-11-13 22:59:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2742 transitions. [2024-11-13 22:59:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-13 22:59:22,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:23,074 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-13 22:59:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2326 states and 2748 transitions. [2024-11-13 22:59:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2748 transitions. [2024-11-13 22:59:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:59:23,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 22:59:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2337 states and 2761 transitions. [2024-11-13 22:59:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 2761 transitions. [2024-11-13 22:59:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:59:26,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:26,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:59:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2398 states and 2829 transitions. [2024-11-13 22:59:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2829 transitions. [2024-11-13 22:59:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:59:34,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:34,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:59:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2444 states and 2879 transitions. [2024-11-13 22:59:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 2879 transitions. [2024-11-13 22:59:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:59:40,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:40,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:59:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2460 states and 2894 transitions. [2024-11-13 22:59:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 2894 transitions. [2024-11-13 22:59:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:59:43,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:59:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2461 states and 2894 transitions. [2024-11-13 22:59:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2894 transitions. [2024-11-13 22:59:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:59:44,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:44,533 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-13 22:59:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2464 states and 2901 transitions. [2024-11-13 22:59:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 2901 transitions. [2024-11-13 22:59:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:59:46,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:46,280 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-13 22:59:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2465 states and 2904 transitions. [2024-11-13 22:59:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 2904 transitions. [2024-11-13 22:59:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-13 22:59:46,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:46,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:46,953 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-13 22:59:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2466 states and 2904 transitions. [2024-11-13 22:59:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 2904 transitions. [2024-11-13 22:59:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-13 22:59:47,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:59:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2473 states and 2911 transitions. [2024-11-13 22:59:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 2911 transitions. [2024-11-13 22:59:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-13 22:59:48,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:48,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:48,982 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-13 22:59:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2496 states and 2942 transitions. [2024-11-13 22:59:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2942 transitions. [2024-11-13 22:59:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-13 22:59:52,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 22:59:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2527 states and 2975 transitions. [2024-11-13 22:59:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 2975 transitions. [2024-11-13 22:59:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:59:56,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 22:59:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2530 states and 2979 transitions. [2024-11-13 22:59:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 2979 transitions. [2024-11-13 22:59:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:59:56,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:56,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:59:57,411 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-13 22:59:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:59:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2541 states and 2994 transitions. [2024-11-13 22:59:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 2994 transitions. [2024-11-13 22:59:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 22:59:59,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:59:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:59:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:00:00,146 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-13 23:00:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:00:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 2553 states and 3009 transitions. [2024-11-13 23:00:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3009 transitions. [2024-11-13 23:00:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-13 23:00:02,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:00:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:00:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:00:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 23:00:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:00:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 2678 states and 3163 transitions. [2024-11-13 23:00:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 3163 transitions. [2024-11-13 23:00:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 23:00:10,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:00:10,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:00:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:00:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 23:00:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:00:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 2739 states and 3232 transitions. [2024-11-13 23:00:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 3232 transitions. [2024-11-13 23:00:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 23:00:14,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:00:14,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:00:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:00:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 23:00:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:00:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 2744 states and 3238 transitions. [2024-11-13 23:00:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3238 transitions. [2024-11-13 23:00:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-13 23:00:15,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:00:15,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:00:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:00:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-13 23:00:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:00:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 2745 states and 3238 transitions. [2024-11-13 23:00:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3238 transitions. [2024-11-13 23:00:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-13 23:00:15,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:00:15,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:00:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:00:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 23:00:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:00:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 2797 states and 3286 transitions. [2024-11-13 23:00:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3286 transitions. [2024-11-13 23:00:19,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 23:00:19,867 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 100 iterations. [2024-11-13 23:00:19,876 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 23:01:03,522 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 23:01:03,522 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,522 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,523 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,523 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,523 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,523 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-13 23:01:03,524 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,525 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-13 23:01:03,525 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,526 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 23:01:03,526 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,526 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,527 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,527 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-13 23:01:03,527 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,527 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,528 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,528 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,528 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,528 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,529 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,529 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,530 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 23:01:03,530 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,530 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-13 23:01:03,530 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,531 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-13 23:01:03,531 INFO L77 FloydHoareUtils]: At program point L512-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-13 23:01:03,531 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,532 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,532 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,532 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-13 23:01:03,533 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,533 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,533 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,533 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 23:01:03,533 INFO L77 FloydHoareUtils]: At program point L515-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-13 23:01:03,534 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,534 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,534 INFO L75 FloydHoareUtils]: For program point L516(line 516) no Hoare annotation was computed. [2024-11-13 23:01:03,534 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-13 23:01:03,534 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,534 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,535 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,535 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,535 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-13 23:01:03,535 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,535 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,535 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 23:01:03,535 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 23:01:03,536 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-13 23:01:03,536 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,536 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,537 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,537 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 23:01:03,538 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,538 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,539 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,539 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 23:01:03,539 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,539 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,540 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 23:01:03,540 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,540 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,540 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-13 23:01:03,541 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,541 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,541 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse6 (= 14 ~a8~0)) (.cse5 (= 5 ~a16~0)) (.cse2 (not .cse7)) (.cse1 (= ~a12~0 8)) (.cse4 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse0 .cse1 .cse5 .cse2 .cse3)) (not (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (and .cse1 .cse6 .cse5 .cse2)) (= ~a21~0 1) (not (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4)) (= ~a7~0 1))))) [2024-11-13 23:01:03,541 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 516) no Hoare annotation was computed. [2024-11-13 23:01:03,542 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,542 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-11-13 23:01:03,542 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,542 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,543 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-13 23:01:03,543 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-13 23:01:03,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 11:01:03 ImpRootNode [2024-11-13 23:01:03,574 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 23:01:03,575 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:01:03,575 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:01:03,575 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:01:03,576 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:57:05" (3/4) ... [2024-11-13 23:01:03,580 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 23:01:03,607 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-13 23:01:03,608 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 23:01:03,613 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 23:01:03,614 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 23:01:03,758 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 23:01:03,758 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 23:01:03,758 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:01:03,760 INFO L158 Benchmark]: Toolchain (without parser) took 241272.97ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 116.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 284.6MB. Max. memory is 16.1GB. [2024-11-13 23:01:03,762 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 142.6MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:01:03,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.34ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 89.7MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 23:01:03,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.40ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 84.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:01:03,765 INFO L158 Benchmark]: Boogie Preprocessor took 60.66ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 80.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:01:03,765 INFO L158 Benchmark]: RCFGBuilder took 2102.37ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 82.4MB in the end (delta: -2.3MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2024-11-13 23:01:03,765 INFO L158 Benchmark]: CodeCheck took 238246.09ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 82.4MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. [2024-11-13 23:01:03,767 INFO L158 Benchmark]: Witness Printer took 183.79ms. Allocated memory is still 2.6GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:01:03,769 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: 194.5s, OverallIterations: 100, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311106 SdHoareTripleChecker+Valid, 994.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 310222 mSDsluCounter, 42114 SdHoareTripleChecker+Invalid, 856.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35757 mSDsCounter, 65980 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 672719 IncrementalHoareTripleChecker+Invalid, 738699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65980 mSolverCounterUnsat, 6357 mSDtfsCounter, 672719 mSolverCounterSat, 9.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136395 GetRequests, 127995 SyntacticMatches, 7400 SemanticMatches, 1000 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692779 ImplicationChecksByTransitivity, 132.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 34.2s InterpolantComputationTime, 20222 NumberOfCodeBlocks, 20222 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 20123 ConstructedInterpolants, 0 QuantifiedInterpolants, 165746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 99 InterpolantComputations, 23 PerfectInterpolantSequences, 18170/23775 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 516]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((!(((((a12 == 8) && (5 == a16)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 142.6MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.34ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 89.7MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.40ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 84.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.66ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 80.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2102.37ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 82.4MB in the end (delta: -2.3MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * CodeCheck took 238246.09ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 82.4MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. * Witness Printer took 183.79ms. Allocated memory is still 2.6GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 23:01:03,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d74eed1-d34f-4f6c-933d-dde2bcdf6164/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE