./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.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_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/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_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/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_aa452218-1ebc-4ac5-b662-3380eb6dbeff/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 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 21:43:48,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 21:43:48,192 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 21:43:48,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 21:43:48,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 21:43:48,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 21:43:48,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 21:43:48,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 21:43:48,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 21:43:48,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 21:43:48,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 21:43:48,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 21:43:48,217 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 21:43:48,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 21:43:48,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 21:43:48,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 21:43:48,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 21:43:48,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 21:43:48,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 21:43:48,218 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 21:43:48,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 21:43:48,218 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 21:43:48,218 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 21:43:48,218 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 21:43:48,218 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 21:43:48,218 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 21:43:48,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 21:43:48,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 21:43:48,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 21:43:48,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 21:43:48,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 21:43:48,219 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 21:43:48,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 21:43:48,219 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_aa452218-1ebc-4ac5-b662-3380eb6dbeff/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 -> 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf [2024-12-05 21:43:48,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 21:43:48,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 21:43:48,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 21:43:48,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 21:43:48,467 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 21:43:48,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2024-12-05 21:43:51,097 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/data/42c8d4517/789cc909ff4842b986266a46b15549d5/FLAG36b168b56 [2024-12-05 21:43:51,370 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 21:43:51,371 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2024-12-05 21:43:51,381 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/data/42c8d4517/789cc909ff4842b986266a46b15549d5/FLAG36b168b56 [2024-12-05 21:43:51,686 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/data/42c8d4517/789cc909ff4842b986266a46b15549d5 [2024-12-05 21:43:51,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 21:43:51,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 21:43:51,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 21:43:51,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 21:43:51,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 21:43:51,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:43:51" (1/1) ... [2024-12-05 21:43:51,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@732c11a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:51, skipping insertion in model container [2024-12-05 21:43:51,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:43:51" (1/1) ... [2024-12-05 21:43:51,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 21:43:51,945 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_aa452218-1ebc-4ac5-b662-3380eb6dbeff/sv-benchmarks/c/eca-rers2012/Problem01_label14.c[21834,21847] [2024-12-05 21:43:51,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 21:43:51,969 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 21:43:52,031 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_aa452218-1ebc-4ac5-b662-3380eb6dbeff/sv-benchmarks/c/eca-rers2012/Problem01_label14.c[21834,21847] [2024-12-05 21:43:52,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 21:43:52,049 INFO L204 MainTranslator]: Completed translation [2024-12-05 21:43:52,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52 WrapperNode [2024-12-05 21:43:52,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 21:43:52,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 21:43:52,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 21:43:52,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 21:43:52,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,101 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-05 21:43:52,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 21:43:52,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 21:43:52,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 21:43:52,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 21:43:52,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 21:43:52,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 21:43:52,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 21:43:52,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 21:43:52,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:43:52" (1/1) ... [2024-12-05 21:43:52,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 21:43:52,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 21:43:52,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 21:43:52,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 21:43:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 21:43:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 21:43:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 21:43:52,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 21:43:52,257 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 21:43:52,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 21:43:53,116 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-05 21:43:53,117 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 21:43:53,382 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 21:43:53,383 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-05 21:43:53,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:43:53 BoogieIcfgContainer [2024-12-05 21:43:53,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 21:43:53,384 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 21:43:53,384 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 21:43:53,394 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 21:43:53,394 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:43:53" (1/1) ... [2024-12-05 21:43:53,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 21:43:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:43:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-05 21:43:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-05 21:43:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-05 21:43:53,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:43:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:43:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:43:54,120 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-05 21:43:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:43:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-12-05 21:43:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-12-05 21:43:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-05 21:43:54,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:43:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:43:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:43:54,909 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-05 21:43:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:43:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-12-05 21:43:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-12-05 21:43:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-05 21:43:55,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:43:55,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:43:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:43:56,309 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-05 21:43:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:43:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-12-05 21:43:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-12-05 21:43:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-05 21:43:57,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:43:57,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:43:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:43:57,334 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-05 21:43:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:43:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-12-05 21:43:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-12-05 21:43:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-05 21:43:57,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:43:57,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:43:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:43:57,895 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-05 21:43:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:43:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-12-05 21:43:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-12-05 21:43:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-05 21:43:58,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:43:58,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:43:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:43:58,259 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-05 21:43:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:43:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-12-05 21:43:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-12-05 21:43:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-05 21:43:58,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:43:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:43:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:43:58,514 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-05 21:43:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:43:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-12-05 21:43:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-12-05 21:43:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-05 21:43:59,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:43:59,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:43:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:43:59,482 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-05 21:43:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:43:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-12-05 21:43:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-12-05 21:43:59,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-05 21:43:59,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:43:59,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:43:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:00,190 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-05 21:44:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-12-05 21:44:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-12-05 21:44:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-05 21:44:00,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:01,225 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-05 21:44:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-12-05 21:44:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-12-05 21:44:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-05 21:44:02,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:02,452 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-05 21:44:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-12-05 21:44:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-12-05 21:44:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-05 21:44:02,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:02,810 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-05 21:44:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-12-05 21:44:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-12-05 21:44:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-05 21:44:04,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:04,315 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-05 21:44:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-12-05 21:44:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-12-05 21:44:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 21:44:04,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:44:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 511 states and 629 transitions. [2024-12-05 21:44:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 629 transitions. [2024-12-05 21:44:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 21:44:05,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:05,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:05,268 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-05 21:44:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 512 states and 629 transitions. [2024-12-05 21:44:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 629 transitions. [2024-12-05 21:44:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-05 21:44:05,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:05,687 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-05 21:44:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 581 states and 713 transitions. [2024-12-05 21:44:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 713 transitions. [2024-12-05 21:44:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-05 21:44:06,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:06,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:06,995 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-05 21:44:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 600 states and 736 transitions. [2024-12-05 21:44:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 736 transitions. [2024-12-05 21:44:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-05 21:44:07,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:07,878 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-05 21:44:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 602 states and 737 transitions. [2024-12-05 21:44:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 737 transitions. [2024-12-05 21:44:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-05 21:44:08,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:08,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:08,195 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-05 21:44:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-12-05 21:44:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-12-05 21:44:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-05 21:44:08,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:08,511 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-05 21:44:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 645 states and 784 transitions. [2024-12-05 21:44:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 784 transitions. [2024-12-05 21:44:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-05 21:44:09,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:09,417 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-05 21:44:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 670 states and 809 transitions. [2024-12-05 21:44:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 809 transitions. [2024-12-05 21:44:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-05 21:44:09,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:09,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:44:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 672 states and 810 transitions. [2024-12-05 21:44:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 810 transitions. [2024-12-05 21:44:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-05 21:44:10,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:10,241 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-05 21:44:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 718 states and 868 transitions. [2024-12-05 21:44:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 868 transitions. [2024-12-05 21:44:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-05 21:44:11,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:11,249 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-05 21:44:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 733 states and 887 transitions. [2024-12-05 21:44:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 887 transitions. [2024-12-05 21:44:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-05 21:44:11,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:11,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:12,248 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-05 21:44:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 817 states and 985 transitions. [2024-12-05 21:44:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 985 transitions. [2024-12-05 21:44:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 21:44:14,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:14,912 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-05 21:44:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 869 states and 1051 transitions. [2024-12-05 21:44:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1051 transitions. [2024-12-05 21:44:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 21:44:16,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:17,013 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-05 21:44:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 931 states and 1123 transitions. [2024-12-05 21:44:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1123 transitions. [2024-12-05 21:44:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 21:44:18,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:18,709 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-05 21:44:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 933 states and 1124 transitions. [2024-12-05 21:44:18,965 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1124 transitions. [2024-12-05 21:44:18,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 21:44:18,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:19,476 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-05 21:44:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1009 states and 1218 transitions. [2024-12-05 21:44:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1218 transitions. [2024-12-05 21:44:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 21:44:21,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:21,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:21,371 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-05 21:44:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1028 states and 1239 transitions. [2024-12-05 21:44:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1239 transitions. [2024-12-05 21:44:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 21:44:22,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:22,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-05 21:44:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1051 states and 1265 transitions. [2024-12-05 21:44:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1265 transitions. [2024-12-05 21:44:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 21:44:23,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:23,417 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-05 21:44:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1066 states and 1284 transitions. [2024-12-05 21:44:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1284 transitions. [2024-12-05 21:44:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-05 21:44:23,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:23,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:24,005 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-05 21:44:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1136 states and 1356 transitions. [2024-12-05 21:44:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1356 transitions. [2024-12-05 21:44:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 21:44:26,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:26,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:26,314 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-05 21:44:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1199 states and 1427 transitions. [2024-12-05 21:44:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1427 transitions. [2024-12-05 21:44:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 21:44:27,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:27,893 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-05 21:44:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1233 states and 1466 transitions. [2024-12-05 21:44:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1466 transitions. [2024-12-05 21:44:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 21:44:28,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:29,346 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-05 21:44:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1293 states and 1539 transitions. [2024-12-05 21:44:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1539 transitions. [2024-12-05 21:44:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 21:44:30,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:30,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:30,753 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-05 21:44:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1314 states and 1562 transitions. [2024-12-05 21:44:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1562 transitions. [2024-12-05 21:44:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 21:44:31,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:31,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:32,288 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-05 21:44:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1336 states and 1591 transitions. [2024-12-05 21:44:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1591 transitions. [2024-12-05 21:44:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 21:44:33,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:33,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:34,116 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-05 21:44:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1369 states and 1626 transitions. [2024-12-05 21:44:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1626 transitions. [2024-12-05 21:44:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-05 21:44:35,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:35,918 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-05 21:44:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1371 states and 1630 transitions. [2024-12-05 21:44:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1630 transitions. [2024-12-05 21:44:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-05 21:44:36,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:36,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:36,547 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-05 21:44:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1394 states and 1656 transitions. [2024-12-05 21:44:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1656 transitions. [2024-12-05 21:44:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-05 21:44:37,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:38,040 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-05 21:44:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1411 states and 1673 transitions. [2024-12-05 21:44:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1673 transitions. [2024-12-05 21:44:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 21:44:39,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:39,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:39,756 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-05 21:44:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1475 states and 1756 transitions. [2024-12-05 21:44:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1756 transitions. [2024-12-05 21:44:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 21:44:42,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:42,874 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-05 21:44:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1485 states and 1765 transitions. [2024-12-05 21:44:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1765 transitions. [2024-12-05 21:44:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 21:44:43,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:43,815 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-05 21:44:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1488 states and 1768 transitions. [2024-12-05 21:44:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1768 transitions. [2024-12-05 21:44:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-05 21:44:43,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:43,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:44,575 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-05 21:44:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1622 states and 1925 transitions. [2024-12-05 21:44:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1925 transitions. [2024-12-05 21:44:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 21:44:47,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:47,878 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-05 21:44:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1647 states and 1951 transitions. [2024-12-05 21:44:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 1951 transitions. [2024-12-05 21:44:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 21:44:48,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:48,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:49,005 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-05 21:44:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1660 states and 1966 transitions. [2024-12-05 21:44:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 1966 transitions. [2024-12-05 21:44:49,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 21:44:49,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:49,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:49,816 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-05 21:44:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1663 states and 1970 transitions. [2024-12-05 21:44:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1970 transitions. [2024-12-05 21:44:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 21:44:50,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:50,658 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-05 21:44:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 1751 states and 2071 transitions. [2024-12-05 21:44:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2071 transitions. [2024-12-05 21:44:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-05 21:44:52,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:53,275 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-05 21:44:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 1825 states and 2147 transitions. [2024-12-05 21:44:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2147 transitions. [2024-12-05 21:44:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-05 21:44:54,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:54,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:54,970 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-05 21:44:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 1846 states and 2169 transitions. [2024-12-05 21:44:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2169 transitions. [2024-12-05 21:44:56,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-05 21:44:56,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:56,584 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-05 21:44:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 1848 states and 2171 transitions. [2024-12-05 21:44:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2171 transitions. [2024-12-05 21:44:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-05 21:44:56,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:56,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:57,082 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-05 21:44:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 1863 states and 2188 transitions. [2024-12-05 21:44:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2188 transitions. [2024-12-05 21:44:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-12-05 21:44:57,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:57,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:57,810 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-05 21:44:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 1900 states and 2233 transitions. [2024-12-05 21:44:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2233 transitions. [2024-12-05 21:44:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-05 21:44:59,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:59,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:44:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:44:59,392 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-05 21:44:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:44:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1911 states and 2245 transitions. [2024-12-05 21:44:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2245 transitions. [2024-12-05 21:44:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-05 21:44:59,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:44:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 21:45:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 1914 states and 2251 transitions. [2024-12-05 21:45:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2251 transitions. [2024-12-05 21:45:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-05 21:45:01,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 21:45:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 1917 states and 2254 transitions. [2024-12-05 21:45:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2254 transitions. [2024-12-05 21:45:01,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-05 21:45:01,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:01,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 190 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 21:45:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 1930 states and 2269 transitions. [2024-12-05 21:45:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2269 transitions. [2024-12-05 21:45:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 21:45:03,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:03,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:03,588 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-05 21:45:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 1944 states and 2285 transitions. [2024-12-05 21:45:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2285 transitions. [2024-12-05 21:45:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 21:45:04,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:04,428 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-05 21:45:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 1985 states and 2333 transitions. [2024-12-05 21:45:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2333 transitions. [2024-12-05 21:45:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-05 21:45:05,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:06,134 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-05 21:45:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2024 states and 2385 transitions. [2024-12-05 21:45:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2385 transitions. [2024-12-05 21:45:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 21:45:08,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:08,667 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-05 21:45:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2038 states and 2400 transitions. [2024-12-05 21:45:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2400 transitions. [2024-12-05 21:45:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 21:45:09,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-12-05 21:45:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2041 states and 2403 transitions. [2024-12-05 21:45:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2403 transitions. [2024-12-05 21:45:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-05 21:45:10,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:10,262 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-05 21:45:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2053 states and 2416 transitions. [2024-12-05 21:45:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2416 transitions. [2024-12-05 21:45:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-05 21:45:11,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:11,519 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-05 21:45:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2055 states and 2420 transitions. [2024-12-05 21:45:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2420 transitions. [2024-12-05 21:45:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 21:45:12,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:12,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:12,615 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-05 21:45:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2067 states and 2433 transitions. [2024-12-05 21:45:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2433 transitions. [2024-12-05 21:45:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 21:45:13,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:13,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:13,438 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-05 21:45:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2068 states and 2433 transitions. [2024-12-05 21:45:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2433 transitions. [2024-12-05 21:45:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 21:45:13,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:13,974 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-05 21:45:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2099 states and 2473 transitions. [2024-12-05 21:45:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2473 transitions. [2024-12-05 21:45:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 21:45:16,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:16,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-05 21:45:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2102 states and 2476 transitions. [2024-12-05 21:45:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2476 transitions. [2024-12-05 21:45:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-05 21:45:17,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:17,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:17,901 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-05 21:45:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2111 states and 2485 transitions. [2024-12-05 21:45:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2485 transitions. [2024-12-05 21:45:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-05 21:45:18,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:18,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:18,366 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-05 21:45:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2135 states and 2511 transitions. [2024-12-05 21:45:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2511 transitions. [2024-12-05 21:45:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 21:45:18,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:18,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:19,307 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-05 21:45:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2212 states and 2607 transitions. [2024-12-05 21:45:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 2607 transitions. [2024-12-05 21:45:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 21:45:23,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:23,699 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-05 21:45:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2216 states and 2611 transitions. [2024-12-05 21:45:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2611 transitions. [2024-12-05 21:45:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 21:45:24,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:24,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-12-05 21:45:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2219 states and 2614 transitions. [2024-12-05 21:45:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2614 transitions. [2024-12-05 21:45:24,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 21:45:24,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:24,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-12-05 21:45:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2222 states and 2617 transitions. [2024-12-05 21:45:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2617 transitions. [2024-12-05 21:45:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-05 21:45:24,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:25,206 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-05 21:45:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2225 states and 2620 transitions. [2024-12-05 21:45:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2620 transitions. [2024-12-05 21:45:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 21:45:25,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:25,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:25,659 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-05 21:45:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2236 states and 2633 transitions. [2024-12-05 21:45:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2633 transitions. [2024-12-05 21:45:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 21:45:27,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:27,611 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-05 21:45:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2292 states and 2695 transitions. [2024-12-05 21:45:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 2695 transitions. [2024-12-05 21:45:33,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 21:45:33,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:33,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:33,602 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-05 21:45:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2339 states and 2743 transitions. [2024-12-05 21:45:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 2743 transitions. [2024-12-05 21:45:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 21:45:37,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:37,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:37,816 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-05 21:45:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2354 states and 2758 transitions. [2024-12-05 21:45:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 2758 transitions. [2024-12-05 21:45:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 21:45:39,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:39,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:39,177 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-05 21:45:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2355 states and 2760 transitions. [2024-12-05 21:45:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2760 transitions. [2024-12-05 21:45:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 21:45:39,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:39,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:39,906 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-05 21:45:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2356 states and 2760 transitions. [2024-12-05 21:45:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2760 transitions. [2024-12-05 21:45:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-05 21:45:40,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:40,818 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-05 21:45:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2363 states and 2767 transitions. [2024-12-05 21:45:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 2767 transitions. [2024-12-05 21:45:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-05 21:45:40,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:40,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 253 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 21:45:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2364 states and 2768 transitions. [2024-12-05 21:45:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2768 transitions. [2024-12-05 21:45:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-05 21:45:41,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:41,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:41,977 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-05 21:45:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2395 states and 2801 transitions. [2024-12-05 21:45:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2801 transitions. [2024-12-05 21:45:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 21:45:44,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:44,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:45,096 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-05 21:45:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2398 states and 2805 transitions. [2024-12-05 21:45:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2805 transitions. [2024-12-05 21:45:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 21:45:45,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:45,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-05 21:45:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2409 states and 2822 transitions. [2024-12-05 21:45:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 2822 transitions. [2024-12-05 21:45:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 21:45:46,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:47,215 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-05 21:45:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2410 states and 2823 transitions. [2024-12-05 21:45:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2823 transitions. [2024-12-05 21:45:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 21:45:47,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:47,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:48,087 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-05 21:45:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2411 states and 2824 transitions. [2024-12-05 21:45:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2824 transitions. [2024-12-05 21:45:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 21:45:48,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:48,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:49,074 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-05 21:45:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2538 states and 2967 transitions. [2024-12-05 21:45:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 2967 transitions. [2024-12-05 21:45:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 21:45:54,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:54,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:55,284 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-05 21:45:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 2599 states and 3036 transitions. [2024-12-05 21:45:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3036 transitions. [2024-12-05 21:45:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 21:45:57,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:57,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:57,885 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-05 21:45:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 2604 states and 3042 transitions. [2024-12-05 21:45:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 3042 transitions. [2024-12-05 21:45:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-05 21:45:58,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:58,377 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-05 21:45:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:45:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 2605 states and 3042 transitions. [2024-12-05 21:45:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3042 transitions. [2024-12-05 21:45:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-05 21:45:58,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:45:58,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:45:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:45:59,032 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-05 21:46:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:46:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 2657 states and 3091 transitions. [2024-12-05 21:46:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3091 transitions. [2024-12-05 21:46:01,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-05 21:46:01,930 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 96 iterations. [2024-12-05 21:46:01,936 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-05 21:46:29,864 INFO L77 FloydHoareUtils]: At program point L102(lines 102 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-05 21:46:29,864 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-05 21:46:29,865 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-05 21:46:29,865 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-05 21:46:29,865 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-05 21:46:29,865 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-05 21:46:29,865 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-05 21:46:29,866 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-05 21:46:29,866 INFO L77 FloydHoareUtils]: At program point L139(lines 139 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-05 21:46:29,866 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-05 21:46:29,866 INFO L77 FloydHoareUtils]: At program point L107(lines 107 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-05 21:46:29,866 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-05 21:46:29,867 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-05 21:46:29,867 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-05 21:46:29,867 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-05 21:46:29,867 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-05 21:46:29,867 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-05 21:46:29,868 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-05 21:46:29,868 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-05 21:46:29,868 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-05 21:46:29,868 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-05 21:46:29,868 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-05 21:46:29,869 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-05 21:46:29,869 INFO L77 FloydHoareUtils]: At program point L112(lines 112 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-05 21:46:29,869 INFO L77 FloydHoareUtils]: At program point L575-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-12-05 21:46:29,869 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-05 21:46:29,869 INFO L77 FloydHoareUtils]: At program point L146(lines 146 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-05 21:46:29,869 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-05 21:46:29,869 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-05 21:46:29,870 INFO L77 FloydHoareUtils]: At program point L578-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-12-05 21:46:29,870 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-05 21:46:29,870 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-05 21:46:29,870 INFO L75 FloydHoareUtils]: For program point L579(line 579) no Hoare annotation was computed. [2024-12-05 21:46:29,870 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-05 21:46:29,870 INFO L77 FloydHoareUtils]: At program point L150(lines 150 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-05 21:46:29,870 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-05 21:46:29,870 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-05 21:46:29,871 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-05 21:46:29,871 INFO L77 FloydHoareUtils]: At program point L118(lines 118 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-05 21:46:29,871 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-05 21:46:29,871 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-05 21:46:29,871 INFO L77 FloydHoareUtils]: At program point L154(lines 154 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-05 21:46:29,871 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-05 21:46:29,871 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-05 21:46:29,872 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-05 21:46:29,872 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-05 21:46:29,872 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-05 21:46:29,872 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-05 21:46:29,872 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-05 21:46:29,872 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-05 21:46:29,872 INFO L77 FloydHoareUtils]: At program point L124(lines 124 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-05 21:46:29,872 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-05 21:46:29,872 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-05 21:46:29,873 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-05 21:46:29,873 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-05 21:46:29,873 INFO L77 FloydHoareUtils]: At program point L94(lines 94 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-05 21:46:29,873 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-05 21:46:29,873 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-05 21:46:29,873 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-05 21:46:29,873 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-05 21:46:29,873 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-05 21:46:29,874 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-05 21:46:29,874 INFO L77 FloydHoareUtils]: At program point L129(lines 129 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-05 21:46:29,874 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-05 21:46:29,874 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-05 21:46:29,874 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-05 21:46:29,874 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-05 21:46:29,874 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-05 21:46:29,875 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-05 21:46:29,875 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2024-12-05 21:46:29,875 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-05 21:46:29,875 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-05 21:46:29,875 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-05 21:46:29,875 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-05 21:46:29,875 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-05 21:46:29,876 INFO L77 FloydHoareUtils]: At program point L134(lines 134 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-05 21:46:29,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 09:46:29 ImpRootNode [2024-12-05 21:46:29,887 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 21:46:29,888 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 21:46:29,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 21:46:29,888 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 21:46:29,889 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:43:53" (3/4) ... [2024-12-05 21:46:29,891 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-05 21:46:29,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 118 nodes and edges [2024-12-05 21:46:29,905 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-12-05 21:46:29,906 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-05 21:46:29,907 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-05 21:46:30,019 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 21:46:30,020 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 21:46:30,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 21:46:30,021 INFO L158 Benchmark]: Toolchain (without parser) took 158331.60ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 91.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 568.6MB. Max. memory is 16.1GB. [2024-12-05 21:46:30,021 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:46:30,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.38ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 64.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-05 21:46:30,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.06ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 58.9MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 21:46:30,022 INFO L158 Benchmark]: Boogie Preprocessor took 47.55ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 54.8MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 21:46:30,022 INFO L158 Benchmark]: RCFGBuilder took 1233.13ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 54.8MB in the beginning and 132.8MB in the end (delta: -77.9MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-12-05 21:46:30,023 INFO L158 Benchmark]: CodeCheck took 156502.96ms. Allocated memory was 226.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 132.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 491.5MB. Max. memory is 16.1GB. [2024-12-05 21:46:30,023 INFO L158 Benchmark]: Witness Printer took 132.40ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 21:46:30,025 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: 128.5s, OverallIterations: 96, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 287156 SdHoareTripleChecker+Valid, 680.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286308 mSDsluCounter, 37288 SdHoareTripleChecker+Invalid, 584.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31635 mSDsCounter, 62144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 623739 IncrementalHoareTripleChecker+Invalid, 685883 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62144 mSolverCounterUnsat, 5653 mSDtfsCounter, 623739 mSolverCounterSat, 4.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129943 GetRequests, 121987 SyntacticMatches, 7040 SemanticMatches, 916 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602470 ImplicationChecksByTransitivity, 85.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 19379 NumberOfCodeBlocks, 19379 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 19284 ConstructedInterpolants, 0 QuantifiedInterpolants, 152092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 26 PerfectInterpolantSequences, 17948/22949 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: 579]: 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.27ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.38ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 64.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.06ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 58.9MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.55ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 54.8MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1233.13ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 54.8MB in the beginning and 132.8MB in the end (delta: -77.9MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * CodeCheck took 156502.96ms. Allocated memory was 226.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 132.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 491.5MB. Max. memory is 16.1GB. * Witness Printer took 132.40ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-05 21:46:30,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa452218-1ebc-4ac5-b662-3380eb6dbeff/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