./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label52.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_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label52.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 154ac9acbf8e778ffeff948005b87fc69e3c98abb9ee270449be2709279a3946 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 02:53:53,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 02:53:53,143 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 02:53:53,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 02:53:53,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 02:53:53,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 02:53:53,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 02:53:53,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 02:53:53,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 02:53:53,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 02:53:53,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 02:53:53,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 02:53:53,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 02:53:53,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 02:53:53,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 02:53:53,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 02:53:53,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 02:53:53,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 02:53:53,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 02:53:53,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 02:53:53,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 02:53:53,184 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 02:53:53,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 02:53:53,185 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 02:53:53,185 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 02:53:53,185 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 02:53:53,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 02:53:53,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:53:53,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 02:53:53,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 02:53:53,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 02:53:53,190 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 02:53:53,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 02:53:53,190 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_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 154ac9acbf8e778ffeff948005b87fc69e3c98abb9ee270449be2709279a3946 [2024-11-25 02:53:53,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 02:53:53,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 02:53:53,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 02:53:53,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 02:53:53,554 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 02:53:53,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem02_label52.c [2024-11-25 02:53:56,561 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/data/518148843/a94ed2e0a8e843e184ec260cd5a4173f/FLAG7403b0dba [2024-11-25 02:53:56,969 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 02:53:56,970 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/sv-benchmarks/c/eca-rers2012/Problem02_label52.c [2024-11-25 02:53:56,985 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/data/518148843/a94ed2e0a8e843e184ec260cd5a4173f/FLAG7403b0dba [2024-11-25 02:53:57,001 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/data/518148843/a94ed2e0a8e843e184ec260cd5a4173f [2024-11-25 02:53:57,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 02:53:57,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 02:53:57,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 02:53:57,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 02:53:57,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 02:53:57,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4d8bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57, skipping insertion in model container [2024-11-25 02:53:57,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 02:53:57,430 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_73e9c095-a474-417b-b320-a58e44435b33/sv-benchmarks/c/eca-rers2012/Problem02_label52.c[17244,17257] [2024-11-25 02:53:57,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:53:57,503 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 02:53:57,632 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_73e9c095-a474-417b-b320-a58e44435b33/sv-benchmarks/c/eca-rers2012/Problem02_label52.c[17244,17257] [2024-11-25 02:53:57,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:53:57,679 INFO L204 MainTranslator]: Completed translation [2024-11-25 02:53:57,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57 WrapperNode [2024-11-25 02:53:57,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 02:53:57,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 02:53:57,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 02:53:57,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 02:53:57,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,768 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-25 02:53:57,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 02:53:57,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 02:53:57,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 02:53:57,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 02:53:57,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 02:53:57,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 02:53:57,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 02:53:57,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 02:53:57,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:53:57" (1/1) ... [2024-11-25 02:53:57,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:53:57,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 02:53:57,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 02:53:57,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 02:53:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 02:53:57,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 02:53:57,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 02:53:57,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 02:53:58,023 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 02:53:58,026 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 02:53:59,564 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-25 02:53:59,564 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 02:53:59,950 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 02:53:59,951 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 02:53:59,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:53:59 BoogieIcfgContainer [2024-11-25 02:53:59,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 02:53:59,954 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 02:53:59,954 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 02:53:59,983 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 02:53:59,983 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:53:59" (1/1) ... [2024-11-25 02:53:59,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 02:54:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-25 02:54:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-25 02:54:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 02:54:00,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:00,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-11-25 02:54:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-25 02:54:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-25 02:54:01,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:01,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-11-25 02:54:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-11-25 02:54:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 02:54:02,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-11-25 02:54:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-11-25 02:54:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-25 02:54:03,289 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:03,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-11-25 02:54:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-11-25 02:54:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 02:54:03,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:54:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-11-25 02:54:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-11-25 02:54:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-25 02:54:03,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-11-25 02:54:04,116 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-11-25 02:54:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 02:54:04,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:04,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-11-25 02:54:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-11-25 02:54:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 02:54:04,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-11-25 02:54:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-11-25 02:54:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-25 02:54:04,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:04,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 386 states and 495 transitions. [2024-11-25 02:54:06,585 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 495 transitions. [2024-11-25 02:54:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 02:54:06,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:06,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 410 states and 522 transitions. [2024-11-25 02:54:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 522 transitions. [2024-11-25 02:54:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 02:54:07,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:07,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 02:54:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 428 states and 542 transitions. [2024-11-25 02:54:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 542 transitions. [2024-11-25 02:54:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 02:54:07,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 442 states and 557 transitions. [2024-11-25 02:54:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2024-11-25 02:54:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-25 02:54:07,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:07,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 449 states and 564 transitions. [2024-11-25 02:54:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 564 transitions. [2024-11-25 02:54:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-25 02:54:08,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:08,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-25 02:54:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 455 states and 572 transitions. [2024-11-25 02:54:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 572 transitions. [2024-11-25 02:54:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 02:54:08,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 462 states and 579 transitions. [2024-11-25 02:54:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 579 transitions. [2024-11-25 02:54:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 02:54:08,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:08,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 54 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 484 states and 607 transitions. [2024-11-25 02:54:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 607 transitions. [2024-11-25 02:54:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-25 02:54:09,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-25 02:54:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 499 states and 625 transitions. [2024-11-25 02:54:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 625 transitions. [2024-11-25 02:54:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-25 02:54:09,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:54:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 530 states and 658 transitions. [2024-11-25 02:54:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 658 transitions. [2024-11-25 02:54:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-25 02:54:10,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:10,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:54:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 554 states and 686 transitions. [2024-11-25 02:54:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 686 transitions. [2024-11-25 02:54:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-25 02:54:10,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:10,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:54:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 557 states and 689 transitions. [2024-11-25 02:54:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 689 transitions. [2024-11-25 02:54:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-25 02:54:11,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:11,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 636 states and 775 transitions. [2024-11-25 02:54:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 775 transitions. [2024-11-25 02:54:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-25 02:54:12,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:12,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:54:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 653 states and 791 transitions. [2024-11-25 02:54:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 791 transitions. [2024-11-25 02:54:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 02:54:12,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:54:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 684 states and 828 transitions. [2024-11-25 02:54:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 828 transitions. [2024-11-25 02:54:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-25 02:54:13,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 02:54:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 708 states and 854 transitions. [2024-11-25 02:54:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 854 transitions. [2024-11-25 02:54:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-25 02:54:13,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:13,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 02:54:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 717 states and 864 transitions. [2024-11-25 02:54:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 864 transitions. [2024-11-25 02:54:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-25 02:54:14,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:54:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 736 states and 883 transitions. [2024-11-25 02:54:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 883 transitions. [2024-11-25 02:54:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-25 02:54:14,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:14,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-25 02:54:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 739 states and 886 transitions. [2024-11-25 02:54:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 886 transitions. [2024-11-25 02:54:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 02:54:14,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:54:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 765 states and 917 transitions. [2024-11-25 02:54:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 917 transitions. [2024-11-25 02:54:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 02:54:15,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:15,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:54:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 796 states and 952 transitions. [2024-11-25 02:54:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 952 transitions. [2024-11-25 02:54:15,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 02:54:15,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:15,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:54:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 803 states and 959 transitions. [2024-11-25 02:54:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 959 transitions. [2024-11-25 02:54:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 02:54:16,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:16,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 846 states and 1007 transitions. [2024-11-25 02:54:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1007 transitions. [2024-11-25 02:54:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-25 02:54:17,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:54:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 849 states and 1010 transitions. [2024-11-25 02:54:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1010 transitions. [2024-11-25 02:54:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-25 02:54:17,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:17,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 02:54:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 858 states and 1019 transitions. [2024-11-25 02:54:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1019 transitions. [2024-11-25 02:54:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 02:54:17,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:17,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 02:54:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 895 states and 1058 transitions. [2024-11-25 02:54:18,554 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1058 transitions. [2024-11-25 02:54:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-25 02:54:18,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:18,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-25 02:54:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 897 states and 1061 transitions. [2024-11-25 02:54:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1061 transitions. [2024-11-25 02:54:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-25 02:54:19,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-25 02:54:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 898 states and 1061 transitions. [2024-11-25 02:54:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1061 transitions. [2024-11-25 02:54:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-25 02:54:19,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:19,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 924 states and 1090 transitions. [2024-11-25 02:54:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1090 transitions. [2024-11-25 02:54:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 02:54:20,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-25 02:54:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 925 states and 1090 transitions. [2024-11-25 02:54:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1090 transitions. [2024-11-25 02:54:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 02:54:20,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 116 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-25 02:54:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 994 states and 1167 transitions. [2024-11-25 02:54:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1167 transitions. [2024-11-25 02:54:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-25 02:54:22,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:22,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-25 02:54:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1007 states and 1180 transitions. [2024-11-25 02:54:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1180 transitions. [2024-11-25 02:54:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-25 02:54:23,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-25 02:54:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1092 states and 1272 transitions. [2024-11-25 02:54:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1272 transitions. [2024-11-25 02:54:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 02:54:24,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-25 02:54:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1163 states and 1350 transitions. [2024-11-25 02:54:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1350 transitions. [2024-11-25 02:54:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-25 02:54:27,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-25 02:54:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1196 states and 1387 transitions. [2024-11-25 02:54:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1387 transitions. [2024-11-25 02:54:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 02:54:28,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-25 02:54:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1197 states and 1387 transitions. [2024-11-25 02:54:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1387 transitions. [2024-11-25 02:54:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:54:28,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 212 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-25 02:54:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1279 states and 1480 transitions. [2024-11-25 02:54:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1480 transitions. [2024-11-25 02:54:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 02:54:31,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 183 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1330 states and 1533 transitions. [2024-11-25 02:54:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1533 transitions. [2024-11-25 02:54:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 02:54:32,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 183 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:54:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1343 states and 1545 transitions. [2024-11-25 02:54:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1545 transitions. [2024-11-25 02:54:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 02:54:32,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:32,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-25 02:54:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1386 states and 1592 transitions. [2024-11-25 02:54:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1592 transitions. [2024-11-25 02:54:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-25 02:54:33,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-25 02:54:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1464 states and 1673 transitions. [2024-11-25 02:54:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1673 transitions. [2024-11-25 02:54:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-25 02:54:35,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-25 02:54:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1467 states and 1675 transitions. [2024-11-25 02:54:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1675 transitions. [2024-11-25 02:54:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-25 02:54:36,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 167 proven. 4 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-25 02:54:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1486 states and 1697 transitions. [2024-11-25 02:54:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1697 transitions. [2024-11-25 02:54:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-25 02:54:37,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:37,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-25 02:54:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1494 states and 1705 transitions. [2024-11-25 02:54:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1705 transitions. [2024-11-25 02:54:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-25 02:54:38,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-25 02:54:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1620 states and 1840 transitions. [2024-11-25 02:54:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1840 transitions. [2024-11-25 02:54:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-25 02:54:41,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 310 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-25 02:54:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1640 states and 1859 transitions. [2024-11-25 02:54:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1859 transitions. [2024-11-25 02:54:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-11-25 02:54:42,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-25 02:54:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1651 states and 1873 transitions. [2024-11-25 02:54:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 1873 transitions. [2024-11-25 02:54:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-25 02:54:42,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:42,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-25 02:54:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1676 states and 1903 transitions. [2024-11-25 02:54:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 1903 transitions. [2024-11-25 02:54:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-25 02:54:43,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:43,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-25 02:54:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1693 states and 1920 transitions. [2024-11-25 02:54:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1920 transitions. [2024-11-25 02:54:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-25 02:54:44,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-25 02:54:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1769 states and 2003 transitions. [2024-11-25 02:54:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2003 transitions. [2024-11-25 02:54:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-25 02:54:47,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:47,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 358 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-25 02:54:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1802 states and 2035 transitions. [2024-11-25 02:54:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2035 transitions. [2024-11-25 02:54:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-25 02:54:48,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:48,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 02:54:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1805 states and 2037 transitions. [2024-11-25 02:54:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2037 transitions. [2024-11-25 02:54:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-25 02:54:49,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 02:54:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 1808 states and 2039 transitions. [2024-11-25 02:54:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2039 transitions. [2024-11-25 02:54:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-25 02:54:50,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-11-25 02:54:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 1810 states and 2043 transitions. [2024-11-25 02:54:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2043 transitions. [2024-11-25 02:54:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-25 02:54:50,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:50,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-25 02:54:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 1817 states and 2050 transitions. [2024-11-25 02:54:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2050 transitions. [2024-11-25 02:54:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-25 02:54:51,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:54:51,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:54:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:54:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-25 02:54:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:54:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1480 states and 1676 transitions. [2024-11-25 02:54:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1676 transitions. [2024-11-25 02:54:51,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 02:54:51,884 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 65 iterations. [2024-11-25 02:54:51,900 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 02:54:59,865 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,865 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,865 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,866 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,866 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,866 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,866 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,866 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,867 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,867 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,867 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,867 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,867 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,868 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,868 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,868 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,868 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,868 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,869 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,869 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,869 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,869 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,870 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,870 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,870 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,870 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,870 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 02:54:59,870 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,870 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,871 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,871 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,871 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,871 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,871 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,871 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,871 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,871 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 494) no Hoare annotation was computed. [2024-11-25 02:54:59,872 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,872 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,872 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,872 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,872 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,873 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,873 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,873 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,873 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,873 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,874 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,874 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,874 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,874 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,874 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,874 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,875 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,875 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,875 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-25 02:54:59,875 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,875 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,875 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,876 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,876 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,876 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,876 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,876 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,876 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,877 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,877 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,877 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,877 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,877 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,877 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,878 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,878 INFO L77 FloydHoareUtils]: At program point L490-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-11-25 02:54:59,878 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,878 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,878 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 02:54:59,878 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,878 INFO L77 FloydHoareUtils]: At program point L493-1(lines 39 608) the Hoare annotation is: (or (<= 10 ~a28~0) (not (= ~a11~0 1)) (<= ~a28~0 7)) [2024-11-25 02:54:59,878 INFO L75 FloydHoareUtils]: For program point L494(line 494) no Hoare annotation was computed. [2024-11-25 02:54:59,878 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,879 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,879 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,879 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,879 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,879 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (or (<= 10 ~a28~0) (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2) (and (= ~a17~0 8) .cse1 .cse0 .cse2) (not (= ~a11~0 1)) (<= ~a28~0 7))) [2024-11-25 02:54:59,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 02:54:59 ImpRootNode [2024-11-25 02:54:59,897 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 02:54:59,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 02:54:59,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 02:54:59,898 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 02:54:59,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:53:59" (3/4) ... [2024-11-25 02:54:59,901 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 02:54:59,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-11-25 02:54:59,916 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-25 02:54:59,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-25 02:54:59,918 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 02:55:00,051 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 02:55:00,052 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 02:55:00,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 02:55:00,053 INFO L158 Benchmark]: Toolchain (without parser) took 63048.11ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 91.1MB in the beginning and 373.5MB in the end (delta: -282.3MB). Peak memory consumption was 436.2MB. Max. memory is 16.1GB. [2024-11-25 02:55:00,053 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:55:00,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 674.23ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 65.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 02:55:00,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.94ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 60.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:55:00,054 INFO L158 Benchmark]: Boogie Preprocessor took 68.76ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 55.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:55:00,054 INFO L158 Benchmark]: RCFGBuilder took 2112.86ms. Allocated memory is still 117.4MB. Free memory was 55.9MB in the beginning and 28.2MB in the end (delta: 27.7MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-11-25 02:55:00,055 INFO L158 Benchmark]: CodeCheck took 59942.49ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 28.2MB in the beginning and 385.9MB in the end (delta: -357.8MB). Peak memory consumption was 367.5MB. Max. memory is 16.1GB. [2024-11-25 02:55:00,055 INFO L158 Benchmark]: Witness Printer took 155.04ms. Allocated memory is still 838.9MB. Free memory was 385.9MB in the beginning and 373.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:55:00,057 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.9s, OverallIterations: 65, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115335 SdHoareTripleChecker+Valid, 369.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114767 mSDsluCounter, 16163 SdHoareTripleChecker+Invalid, 310.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13597 mSDsCounter, 35153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 255795 IncrementalHoareTripleChecker+Invalid, 290948 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35153 mSolverCounterUnsat, 2566 mSDtfsCounter, 255795 mSolverCounterSat, 4.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77202 GetRequests, 75298 SyntacticMatches, 1466 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106239 ImplicationChecksByTransitivity, 26.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 11593 NumberOfCodeBlocks, 11593 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 11529 ConstructedInterpolants, 0 QuantifiedInterpolants, 35465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 54 PerfectInterpolantSequences, 10904/11202 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: 494]: 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: 39]: Location Invariant Derived location invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((10 <= a28) || (((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (a11 != 1)) || (a28 <= 7)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.87ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 674.23ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 65.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.94ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 60.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.76ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 55.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2112.86ms. Allocated memory is still 117.4MB. Free memory was 55.9MB in the beginning and 28.2MB in the end (delta: 27.7MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * CodeCheck took 59942.49ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 28.2MB in the beginning and 385.9MB in the end (delta: -357.8MB). Peak memory consumption was 367.5MB. Max. memory is 16.1GB. * Witness Printer took 155.04ms. Allocated memory is still 838.9MB. Free memory was 385.9MB in the beginning and 373.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 02:55:00,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73e9c095-a474-417b-b320-a58e44435b33/bin/ukojak-verify-ENZ3QT5qd3/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