./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 02:17:13,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 02:17:13,101 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 02:17:13,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 02:17:13,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 02:17:13,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 02:17:13,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 02:17:13,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 02:17:13,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 02:17:13,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 02:17:13,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 02:17:13,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 02:17:13,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 02:17:13,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 02:17:13,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 02:17:13,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 02:17:13,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 02:17:13,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 02:17:13,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 02:17:13,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 02:17:13,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 02:17:13,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 02:17:13,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 02:17:13,131 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 02:17:13,131 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 02:17:13,131 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 02:17:13,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 02:17:13,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:17:13,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 02:17:13,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 02:17:13,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 02:17:13,132 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 02:17:13,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 02:17:13,132 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_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb [2024-12-06 02:17:13,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 02:17:13,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 02:17:13,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 02:17:13,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 02:17:13,385 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 02:17:13,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2024-12-06 02:17:16,251 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/data/fe7b0cb86/aead281812a648c8892690ab7500f598/FLAG14c3956e0 [2024-12-06 02:17:16,539 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 02:17:16,540 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2024-12-06 02:17:16,553 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/data/fe7b0cb86/aead281812a648c8892690ab7500f598/FLAG14c3956e0 [2024-12-06 02:17:16,570 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/data/fe7b0cb86/aead281812a648c8892690ab7500f598 [2024-12-06 02:17:16,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 02:17:16,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 02:17:16,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 02:17:16,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 02:17:16,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 02:17:16,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:17:16" (1/1) ... [2024-12-06 02:17:16,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da10570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:16, skipping insertion in model container [2024-12-06 02:17:16,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:17:16" (1/1) ... [2024-12-06 02:17:16,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 02:17:16,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/sv-benchmarks/c/eca-rers2012/Problem01_label29.c[18109,18122] [2024-12-06 02:17:16,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:17:16,945 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 02:17:17,017 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_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/sv-benchmarks/c/eca-rers2012/Problem01_label29.c[18109,18122] [2024-12-06 02:17:17,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:17:17,045 INFO L204 MainTranslator]: Completed translation [2024-12-06 02:17:17,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17 WrapperNode [2024-12-06 02:17:17,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 02:17:17,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 02:17:17,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 02:17:17,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 02:17:17,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,111 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 02:17:17,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 02:17:17,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 02:17:17,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 02:17:17,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 02:17:17,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 02:17:17,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 02:17:17,175 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 02:17:17,175 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 02:17:17,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:17" (1/1) ... [2024-12-06 02:17:17,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:17:17,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 02:17:17,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 02:17:17,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 02:17:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 02:17:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 02:17:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 02:17:17,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 02:17:17,310 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 02:17:17,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 02:17:18,283 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 02:17:18,284 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 02:17:18,503 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 02:17:18,503 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 02:17:18,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:17:18 BoogieIcfgContainer [2024-12-06 02:17:18,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 02:17:18,504 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 02:17:18,504 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 02:17:18,511 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 02:17:18,511 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:17:18" (1/1) ... [2024-12-06 02:17:18,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 02:17:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 02:17:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 02:17:18,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 02:17:18,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-12-06 02:17:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-12-06 02:17:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 02:17:19,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-12-06 02:17:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-12-06 02:17:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 02:17:20,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-12-06 02:17:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-12-06 02:17:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 02:17:21,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-12-06 02:17:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-12-06 02:17:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 02:17:22,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:17:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-12-06 02:17:22,815 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-12-06 02:17:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 02:17:22,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:22,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:17:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-12-06 02:17:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-12-06 02:17:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 02:17:23,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-12-06 02:17:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-12-06 02:17:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 02:17:24,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-12-06 02:17:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-12-06 02:17:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 02:17:25,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:25,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:17:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-12-06 02:17:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-12-06 02:17:25,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 02:17:25,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:17:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-12-06 02:17:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-12-06 02:17:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 02:17:27,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:27,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 02:17:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-12-06 02:17:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-12-06 02:17:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 02:17:28,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-12-06 02:17:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-12-06 02:17:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 02:17:29,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-12-06 02:17:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-12-06 02:17:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 02:17:30,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 02:17:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-12-06 02:17:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-12-06 02:17:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 02:17:30,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 02:17:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-12-06 02:17:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-12-06 02:17:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 02:17:31,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:31,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-12-06 02:17:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-12-06 02:17:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 02:17:33,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-12-06 02:17:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-12-06 02:17:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 02:17:34,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-12-06 02:17:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-12-06 02:17:34,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 02:17:34,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:34,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 02:17:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-12-06 02:17:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-12-06 02:17:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 02:17:34,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:34,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:17:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-12-06 02:17:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-12-06 02:17:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-06 02:17:35,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 02:17:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-12-06 02:17:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-12-06 02:17:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 02:17:36,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 688 states and 834 transitions. [2024-12-06 02:17:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 834 transitions. [2024-12-06 02:17:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 02:17:38,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:17:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 735 states and 895 transitions. [2024-12-06 02:17:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 895 transitions. [2024-12-06 02:17:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 02:17:39,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:17:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 750 states and 915 transitions. [2024-12-06 02:17:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 915 transitions. [2024-12-06 02:17:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 02:17:39,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:39,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 834 states and 1009 transitions. [2024-12-06 02:17:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1009 transitions. [2024-12-06 02:17:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 02:17:43,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:43,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 884 states and 1072 transitions. [2024-12-06 02:17:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1072 transitions. [2024-12-06 02:17:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 02:17:44,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:44,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 886 states and 1075 transitions. [2024-12-06 02:17:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1075 transitions. [2024-12-06 02:17:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 02:17:44,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:44,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:17:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 948 states and 1148 transitions. [2024-12-06 02:17:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1148 transitions. [2024-12-06 02:17:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 02:17:46,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:17:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 950 states and 1149 transitions. [2024-12-06 02:17:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1149 transitions. [2024-12-06 02:17:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 02:17:47,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1043 states and 1262 transitions. [2024-12-06 02:17:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1262 transitions. [2024-12-06 02:17:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 02:17:49,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1047 states and 1267 transitions. [2024-12-06 02:17:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1267 transitions. [2024-12-06 02:17:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 02:17:50,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:17:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1082 states and 1309 transitions. [2024-12-06 02:17:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1309 transitions. [2024-12-06 02:17:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 02:17:52,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:52,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:17:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1097 states and 1328 transitions. [2024-12-06 02:17:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1328 transitions. [2024-12-06 02:17:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 02:17:53,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 02:17:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1167 states and 1400 transitions. [2024-12-06 02:17:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1400 transitions. [2024-12-06 02:17:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 02:17:55,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1232 states and 1475 transitions. [2024-12-06 02:17:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1475 transitions. [2024-12-06 02:17:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 02:17:57,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:57,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1263 states and 1511 transitions. [2024-12-06 02:17:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1511 transitions. [2024-12-06 02:17:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 02:17:57,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1264 states and 1512 transitions. [2024-12-06 02:17:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1512 transitions. [2024-12-06 02:17:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 02:17:58,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 02:17:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1310 states and 1570 transitions. [2024-12-06 02:17:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1570 transitions. [2024-12-06 02:17:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 02:17:59,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 02:18:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1324 states and 1585 transitions. [2024-12-06 02:18:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1585 transitions. [2024-12-06 02:18:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 02:18:00,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:00,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:18:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1345 states and 1608 transitions. [2024-12-06 02:18:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1608 transitions. [2024-12-06 02:18:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 02:18:02,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 02:18:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1369 states and 1634 transitions. [2024-12-06 02:18:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1634 transitions. [2024-12-06 02:18:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 02:18:02,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:02,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 02:18:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1382 states and 1648 transitions. [2024-12-06 02:18:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1648 transitions. [2024-12-06 02:18:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 02:18:03,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 02:18:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1435 states and 1709 transitions. [2024-12-06 02:18:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1709 transitions. [2024-12-06 02:18:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 02:18:06,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:06,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 02:18:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1437 states and 1712 transitions. [2024-12-06 02:18:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1712 transitions. [2024-12-06 02:18:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 02:18:07,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:18:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1462 states and 1741 transitions. [2024-12-06 02:18:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1741 transitions. [2024-12-06 02:18:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 02:18:09,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:18:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1480 states and 1758 transitions. [2024-12-06 02:18:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1758 transitions. [2024-12-06 02:18:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 02:18:11,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 02:18:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1529 states and 1825 transitions. [2024-12-06 02:18:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1825 transitions. [2024-12-06 02:18:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 02:18:14,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 02:18:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1554 states and 1848 transitions. [2024-12-06 02:18:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1848 transitions. [2024-12-06 02:18:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 02:18:16,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:16,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-06 02:18:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1557 states and 1851 transitions. [2024-12-06 02:18:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1851 transitions. [2024-12-06 02:18:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 02:18:16,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:16,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:18:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 1691 states and 2004 transitions. [2024-12-06 02:18:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2004 transitions. [2024-12-06 02:18:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 02:18:20,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:18:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 1716 states and 2030 transitions. [2024-12-06 02:18:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2030 transitions. [2024-12-06 02:18:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 02:18:21,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:18:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 1729 states and 2044 transitions. [2024-12-06 02:18:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2044 transitions. [2024-12-06 02:18:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 02:18:22,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:18:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 1732 states and 2048 transitions. [2024-12-06 02:18:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2048 transitions. [2024-12-06 02:18:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 02:18:23,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:23,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-06 02:18:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 1820 states and 2151 transitions. [2024-12-06 02:18:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2151 transitions. [2024-12-06 02:18:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-06 02:18:26,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:18:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 1894 states and 2227 transitions. [2024-12-06 02:18:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2227 transitions. [2024-12-06 02:18:28,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 02:18:28,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 02:18:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 1915 states and 2249 transitions. [2024-12-06 02:18:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2249 transitions. [2024-12-06 02:18:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 02:18:30,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 02:18:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 1917 states and 2251 transitions. [2024-12-06 02:18:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2251 transitions. [2024-12-06 02:18:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-06 02:18:30,788 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-06 02:18:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 1932 states and 2268 transitions. [2024-12-06 02:18:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2268 transitions. [2024-12-06 02:18:31,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-12-06 02:18:31,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-06 02:18:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 1969 states and 2313 transitions. [2024-12-06 02:18:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2313 transitions. [2024-12-06 02:18:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-06 02:18:33,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 02:18:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 1980 states and 2325 transitions. [2024-12-06 02:18:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2325 transitions. [2024-12-06 02:18:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 02:18:34,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:34,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 159 proven. 90 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 02:18:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2012 states and 2363 transitions. [2024-12-06 02:18:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2363 transitions. [2024-12-06 02:18:36,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-06 02:18:36,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:36,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-06 02:18:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2015 states and 2366 transitions. [2024-12-06 02:18:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2366 transitions. [2024-12-06 02:18:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 02:18:37,354 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 02:18:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2029 states and 2381 transitions. [2024-12-06 02:18:38,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2381 transitions. [2024-12-06 02:18:38,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 02:18:38,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:38,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 02:18:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2070 states and 2429 transitions. [2024-12-06 02:18:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2429 transitions. [2024-12-06 02:18:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 02:18:40,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:40,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 02:18:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2109 states and 2481 transitions. [2024-12-06 02:18:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2481 transitions. [2024-12-06 02:18:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 02:18:43,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-06 02:18:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2123 states and 2496 transitions. [2024-12-06 02:18:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2496 transitions. [2024-12-06 02:18:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-06 02:18:44,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:44,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-06 02:18:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2135 states and 2510 transitions. [2024-12-06 02:18:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2510 transitions. [2024-12-06 02:18:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-06 02:18:45,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:45,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-06 02:18:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2137 states and 2512 transitions. [2024-12-06 02:18:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2512 transitions. [2024-12-06 02:18:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 02:18:46,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-06 02:18:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2149 states and 2526 transitions. [2024-12-06 02:18:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2526 transitions. [2024-12-06 02:18:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 02:18:47,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:47,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-06 02:18:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2150 states and 2526 transitions. [2024-12-06 02:18:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2526 transitions. [2024-12-06 02:18:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 02:18:47,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:18:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2195 states and 2578 transitions. [2024-12-06 02:18:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2578 transitions. [2024-12-06 02:18:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 02:18:52,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:52,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:18:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2264 states and 2663 transitions. [2024-12-06 02:18:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2663 transitions. [2024-12-06 02:18:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 02:18:56,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:56,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:18:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2266 states and 2664 transitions. [2024-12-06 02:18:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 2664 transitions. [2024-12-06 02:18:57,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 02:18:57,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:57,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:18:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2275 states and 2673 transitions. [2024-12-06 02:18:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2673 transitions. [2024-12-06 02:18:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 02:18:57,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:57,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-12-06 02:18:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2299 states and 2699 transitions. [2024-12-06 02:18:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 2699 transitions. [2024-12-06 02:18:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 02:18:58,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:58,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:19:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2324 states and 2738 transitions. [2024-12-06 02:19:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2738 transitions. [2024-12-06 02:19:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 02:19:00,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:00,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:19:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2345 states and 2759 transitions. [2024-12-06 02:19:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2759 transitions. [2024-12-06 02:19:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 02:19:02,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:02,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 02:19:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2360 states and 2782 transitions. [2024-12-06 02:19:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2782 transitions. [2024-12-06 02:19:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 02:19:05,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:05,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 02:19:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2365 states and 2790 transitions. [2024-12-06 02:19:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2790 transitions. [2024-12-06 02:19:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 02:19:06,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:06,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 02:19:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2368 states and 2796 transitions. [2024-12-06 02:19:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 2796 transitions. [2024-12-06 02:19:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:07,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 02:19:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2379 states and 2809 transitions. [2024-12-06 02:19:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 2809 transitions. [2024-12-06 02:19:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:09,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:09,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:19:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2454 states and 2892 transitions. [2024-12-06 02:19:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 2892 transitions. [2024-12-06 02:19:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:16,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:19:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2455 states and 2892 transitions. [2024-12-06 02:19:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 2892 transitions. [2024-12-06 02:19:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:16,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:19:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2500 states and 2939 transitions. [2024-12-06 02:19:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 2939 transitions. [2024-12-06 02:19:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:20,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:19:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2502 states and 2940 transitions. [2024-12-06 02:19:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2940 transitions. [2024-12-06 02:19:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:22,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 02:19:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2505 states and 2949 transitions. [2024-12-06 02:19:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 2949 transitions. [2024-12-06 02:19:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:23,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 02:19:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2506 states and 2949 transitions. [2024-12-06 02:19:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2949 transitions. [2024-12-06 02:19:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:24,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:24,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 02:19:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2507 states and 2954 transitions. [2024-12-06 02:19:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 2954 transitions. [2024-12-06 02:19:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 02:19:24,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:24,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:19:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2514 states and 2961 transitions. [2024-12-06 02:19:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 2961 transitions. [2024-12-06 02:19:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 02:19:25,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:25,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 02:19:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2537 states and 2991 transitions. [2024-12-06 02:19:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 2991 transitions. [2024-12-06 02:19:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 02:19:28,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:28,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 02:19:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 2568 states and 3024 transitions. [2024-12-06 02:19:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3024 transitions. [2024-12-06 02:19:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 02:19:31,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:19:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 2571 states and 3028 transitions. [2024-12-06 02:19:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3028 transitions. [2024-12-06 02:19:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 02:19:31,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 02:19:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 2582 states and 3043 transitions. [2024-12-06 02:19:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3043 transitions. [2024-12-06 02:19:33,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 02:19:33,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:33,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 02:19:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 2594 states and 3062 transitions. [2024-12-06 02:19:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3062 transitions. [2024-12-06 02:19:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 02:19:35,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:35,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 02:19:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 2595 states and 3063 transitions. [2024-12-06 02:19:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3063 transitions. [2024-12-06 02:19:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 02:19:36,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-06 02:19:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 2722 states and 3214 transitions. [2024-12-06 02:19:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3214 transitions. [2024-12-06 02:19:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 02:19:43,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:19:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3283 states to 2783 states and 3283 transitions. [2024-12-06 02:19:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3283 transitions. [2024-12-06 02:19:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 02:19:46,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:46,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:19:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 2788 states and 3289 transitions. [2024-12-06 02:19:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3289 transitions. [2024-12-06 02:19:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 02:19:47,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:47,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-12-06 02:19:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 2789 states and 3289 transitions. [2024-12-06 02:19:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3289 transitions. [2024-12-06 02:19:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 02:19:47,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:47,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 02:19:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 2841 states and 3338 transitions. [2024-12-06 02:19:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3338 transitions. [2024-12-06 02:19:51,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 02:19:51,376 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 101 iterations. [2024-12-06 02:19:51,383 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 02:20:24,879 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-12-06 02:20:24,879 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,879 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,879 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,880 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,880 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,880 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-12-06 02:20:24,880 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,880 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 02:20:24,881 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,881 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-12-06 02:20:24,881 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,881 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,881 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,882 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-12-06 02:20:24,882 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,882 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,882 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,882 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,882 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,883 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,883 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,883 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,883 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-12-06 02:20:24,883 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,884 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 02:20:24,884 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,884 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-12-06 02:20:24,884 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,884 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,884 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,885 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 02:20:24,885 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,885 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,885 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,885 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-12-06 02:20:24,885 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,886 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,886 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 02:20:24,886 INFO L77 FloydHoareUtils]: At program point L485-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-12-06 02:20:24,886 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,886 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,886 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,886 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,886 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-12-06 02:20:24,887 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,887 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,887 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 02:20:24,887 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-12-06 02:20:24,887 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 02:20:24,887 INFO L77 FloydHoareUtils]: At program point L488-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-12-06 02:20:24,887 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,887 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,887 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,888 INFO L75 FloydHoareUtils]: For program point L489(line 489) no Hoare annotation was computed. [2024-12-06 02:20:24,888 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-12-06 02:20:24,888 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,888 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,888 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,888 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 02:20:24,888 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,888 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,888 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 02:20:24,889 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 489) no Hoare annotation was computed. [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,889 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 02:20:24,890 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-12-06 02:20:24,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 02:20:24 ImpRootNode [2024-12-06 02:20:24,904 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 02:20:24,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 02:20:24,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 02:20:24,905 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 02:20:24,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:17:18" (3/4) ... [2024-12-06 02:20:24,908 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 02:20:24,920 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-12-06 02:20:24,921 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 02:20:24,922 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-06 02:20:24,923 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 02:20:25,035 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 02:20:25,035 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 02:20:25,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 02:20:25,036 INFO L158 Benchmark]: Toolchain (without parser) took 188461.61ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 114.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 454.1MB. Max. memory is 16.1GB. [2024-12-06 02:20:25,036 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:20:25,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.52ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 87.7MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 02:20:25,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.08ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 82.4MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:20:25,037 INFO L158 Benchmark]: Boogie Preprocessor took 61.69ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 78.3MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:20:25,037 INFO L158 Benchmark]: RCFGBuilder took 1328.87ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 63.7MB in the end (delta: 14.6MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-12-06 02:20:25,038 INFO L158 Benchmark]: CodeCheck took 186400.17ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 63.7MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 394.2MB. Max. memory is 16.1GB. [2024-12-06 02:20:25,038 INFO L158 Benchmark]: Witness Printer took 130.50ms. Allocated memory is still 2.0GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:20:25,040 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: 152.8s, OverallIterations: 101, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 320298 SdHoareTripleChecker+Valid, 761.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319405 mSDsluCounter, 42854 SdHoareTripleChecker+Invalid, 655.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36410 mSDsCounter, 66883 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 691560 IncrementalHoareTripleChecker+Invalid, 758443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66883 mSolverCounterUnsat, 6444 mSDtfsCounter, 691560 mSolverCounterSat, 5.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137846 GetRequests, 129144 SyntacticMatches, 7686 SemanticMatches, 1016 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747496 ImplicationChecksByTransitivity, 105.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 20431 NumberOfCodeBlocks, 20431 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 20331 ConstructedInterpolants, 0 QuantifiedInterpolants, 165158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 100 InterpolantComputations, 23 PerfectInterpolantSequences, 18671/24029 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 489]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !(((((!((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((((!((((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15))) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.52ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 87.7MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.08ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 82.4MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.69ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 78.3MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1328.87ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 63.7MB in the end (delta: 14.6MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * CodeCheck took 186400.17ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 63.7MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 394.2MB. Max. memory is 16.1GB. * Witness Printer took 130.50ms. Allocated memory is still 2.0GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 02:20:25,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87c9a9-54fb-4bbc-860d-23546a0fcaae/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE