./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/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_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f03a9521f9986f7627623e3bf6c079dbfbe3dc9d9c229ed8d14a2828a7d6850 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:25:55,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:25:55,135 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-11-25 03:25:55,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:25:55,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:25:55,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:25:55,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:25:55,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:25:55,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:25:55,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:25:55,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:25:55,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:25:55,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:25:55,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:25:55,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:25:55,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:25:55,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:25:55,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:25:55,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:25:55,192 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-25 03:25:55,192 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-25 03:25:55,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:25:55,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:25:55,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:25:55,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:25:55,193 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:25:55,193 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:25:55,193 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:25:55,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:25:55,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:25:55,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:25:55,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:25:55,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:25:55,194 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:25:55,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:25:55,194 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_1606391b-6010-4e14-985b-56612bd89b9d/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 ! overflow) ) 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 -> 2f03a9521f9986f7627623e3bf6c079dbfbe3dc9d9c229ed8d14a2828a7d6850 [2024-11-25 03:25:55,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:25:55,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:25:55,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:25:55,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:25:55,523 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:25:55,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c [2024-11-25 03:25:58,480 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/data/8ad5c9b7b/064204c9413e4854bc767b1121b72ae6/FLAG708ae1a66 [2024-11-25 03:25:58,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:25:58,730 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c [2024-11-25 03:25:58,737 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/data/8ad5c9b7b/064204c9413e4854bc767b1121b72ae6/FLAG708ae1a66 [2024-11-25 03:25:59,043 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/data/8ad5c9b7b/064204c9413e4854bc767b1121b72ae6 [2024-11-25 03:25:59,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:25:59,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:25:59,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:25:59,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:25:59,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:25:59,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516a7216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59, skipping insertion in model container [2024-11-25 03:25:59,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:25:59,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:25:59,279 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:25:59,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:25:59,327 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:25:59,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59 WrapperNode [2024-11-25 03:25:59,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:25:59,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:25:59,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:25:59,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:25:59,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,371 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-11-25 03:25:59,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:25:59,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:25:59,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:25:59,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:25:59,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:25:59,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:25:59,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:25:59,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:25:59,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:25:59,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:25:59,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:25:59,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:25:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-25 03:25:59,480 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-25 03:25:59,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:25:59,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:25:59,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:25:59,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:25:59,548 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:25:59,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:25:59,793 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-25 03:25:59,794 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:25:59,820 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:25:59,821 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-25 03:25:59,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:25:59 BoogieIcfgContainer [2024-11-25 03:25:59,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:25:59,822 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:25:59,823 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:25:59,832 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:25:59,832 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:25:59" (1/1) ... [2024-11-25 03:25:59,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:25:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:25:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 55 states and 63 transitions. [2024-11-25 03:25:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-11-25 03:25:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 03:25:59,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:25:59,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:00,114 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 03:26:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 58 states and 70 transitions. [2024-11-25 03:26:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-11-25 03:26:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 03:26:00,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:00,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:00,232 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 03:26:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 50 states and 57 transitions. [2024-11-25 03:26:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-25 03:26:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-25 03:26:00,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:00,419 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 03:26:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 49 states and 56 transitions. [2024-11-25 03:26:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-25 03:26:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 03:26:00,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:00,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:00,891 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 03:26:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 48 states and 55 transitions. [2024-11-25 03:26:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-25 03:26:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 03:26:01,289 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:01,385 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 03:26:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 47 states and 54 transitions. [2024-11-25 03:26:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-11-25 03:26:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 03:26:01,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:01,952 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 03:26:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 49 states and 56 transitions. [2024-11-25 03:26:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-25 03:26:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:26:02,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:02,176 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 03:26:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 52 states and 60 transitions. [2024-11-25 03:26:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-25 03:26:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 03:26:02,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:02,290 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 03:26:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 56 states and 66 transitions. [2024-11-25 03:26:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-25 03:26:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:26:02,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:02,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:02,623 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 03:26:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 61 states and 73 transitions. [2024-11-25 03:26:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-11-25 03:26:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 03:26:02,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:02,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:02,833 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 03:26:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 68 states and 84 transitions. [2024-11-25 03:26:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2024-11-25 03:26:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 03:26:03,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:03,146 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 03:26:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 69 states and 85 transitions. [2024-11-25 03:26:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2024-11-25 03:26:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 03:26:03,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:03,220 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 03:26:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 74 states and 94 transitions. [2024-11-25 03:26:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2024-11-25 03:26:03,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 03:26:03,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:03,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:03,583 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 03:26:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 79 states and 105 transitions. [2024-11-25 03:26:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2024-11-25 03:26:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 03:26:03,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:03,884 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 03:26:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 85 states and 116 transitions. [2024-11-25 03:26:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2024-11-25 03:26:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 03:26:04,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:04,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:04,038 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 03:26:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 86 states and 117 transitions. [2024-11-25 03:26:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-25 03:26:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 03:26:04,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:04,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:04,094 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 03:26:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 94 states and 130 transitions. [2024-11-25 03:26:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-11-25 03:26:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 03:26:04,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:04,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:04,389 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 03:26:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 98 states and 135 transitions. [2024-11-25 03:26:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-25 03:26:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 03:26:04,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:26:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 99 states and 137 transitions. [2024-11-25 03:26:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2024-11-25 03:26:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 03:26:04,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:26:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 100 states and 139 transitions. [2024-11-25 03:26:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-11-25 03:26:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 03:26:04,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:04,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:26:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 101 states and 141 transitions. [2024-11-25 03:26:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-11-25 03:26:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 03:26:04,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:04,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 03:26:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 103 states and 144 transitions. [2024-11-25 03:26:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2024-11-25 03:26:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 03:26:04,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-25 03:26:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 104 states and 145 transitions. [2024-11-25 03:26:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2024-11-25 03:26:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 03:26:05,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:26:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 117 states and 162 transitions. [2024-11-25 03:26:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 162 transitions. [2024-11-25 03:26:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 03:26:05,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:26:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 121 states and 173 transitions. [2024-11-25 03:26:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-11-25 03:26:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-25 03:26:06,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 03:26:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 124 states and 178 transitions. [2024-11-25 03:26:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2024-11-25 03:26:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-25 03:26:07,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:07,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 03:26:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 127 states and 183 transitions. [2024-11-25 03:26:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2024-11-25 03:26:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-25 03:26:07,404 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:26:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 130 states and 187 transitions. [2024-11-25 03:26:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2024-11-25 03:26:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 03:26:07,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-25 03:26:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 134 states and 192 transitions. [2024-11-25 03:26:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 192 transitions. [2024-11-25 03:26:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 03:26:08,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:08,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-25 03:26:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 137 states and 196 transitions. [2024-11-25 03:26:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 196 transitions. [2024-11-25 03:26:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 03:26:08,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 03:26:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 138 states and 200 transitions. [2024-11-25 03:26:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 200 transitions. [2024-11-25 03:26:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:26:08,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:08,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 03:26:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 141 states and 205 transitions. [2024-11-25 03:26:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 205 transitions. [2024-11-25 03:26:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:26:08,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 03:26:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 142 states and 206 transitions. [2024-11-25 03:26:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 206 transitions. [2024-11-25 03:26:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 03:26:08,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:08,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 03:26:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 143 states and 207 transitions. [2024-11-25 03:26:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 207 transitions. [2024-11-25 03:26:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:26:08,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:08,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:26:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 157 states and 223 transitions. [2024-11-25 03:26:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 223 transitions. [2024-11-25 03:26:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-25 03:26:09,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:09,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-25 03:26:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 160 states and 233 transitions. [2024-11-25 03:26:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 233 transitions. [2024-11-25 03:26:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-25 03:26:10,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:10,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 03:26:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 162 states and 236 transitions. [2024-11-25 03:26:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2024-11-25 03:26:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-25 03:26:11,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 03:26:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 164 states and 239 transitions. [2024-11-25 03:26:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 239 transitions. [2024-11-25 03:26:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-25 03:26:11,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 03:26:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 166 states and 241 transitions. [2024-11-25 03:26:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 241 transitions. [2024-11-25 03:26:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-25 03:26:11,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 03:26:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 169 states and 244 transitions. [2024-11-25 03:26:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 244 transitions. [2024-11-25 03:26:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-25 03:26:12,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:12,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:26:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 183 states and 260 transitions. [2024-11-25 03:26:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 260 transitions. [2024-11-25 03:26:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-25 03:26:12,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:26:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 197 states and 276 transitions. [2024-11-25 03:26:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 276 transitions. [2024-11-25 03:26:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-25 03:26:13,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:26:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 211 states and 292 transitions. [2024-11-25 03:26:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2024-11-25 03:26:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-25 03:26:14,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:14,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 26 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:26:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 225 states and 308 transitions. [2024-11-25 03:26:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 308 transitions. [2024-11-25 03:26:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 03:26:15,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 31 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:26:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 239 states and 323 transitions. [2024-11-25 03:26:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2024-11-25 03:26:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-25 03:26:16,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 245 states and 336 transitions. [2024-11-25 03:26:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 336 transitions. [2024-11-25 03:26:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-25 03:26:17,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-25 03:26:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 246 states and 337 transitions. [2024-11-25 03:26:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 337 transitions. [2024-11-25 03:26:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-25 03:26:18,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:18,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-25 03:26:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 248 states and 339 transitions. [2024-11-25 03:26:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 339 transitions. [2024-11-25 03:26:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-25 03:26:19,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:19,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 249 states and 339 transitions. [2024-11-25 03:26:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 339 transitions. [2024-11-25 03:26:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 03:26:19,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-11-25 03:26:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 251 states and 341 transitions. [2024-11-25 03:26:20,404 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 341 transitions. [2024-11-25 03:26:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-25 03:26:20,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 261 states and 354 transitions. [2024-11-25 03:26:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 354 transitions. [2024-11-25 03:26:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-25 03:26:21,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:21,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-11-25 03:26:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 262 states and 355 transitions. [2024-11-25 03:26:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 355 transitions. [2024-11-25 03:26:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-25 03:26:22,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:22,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 116 proven. 1 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 263 states and 360 transitions. [2024-11-25 03:26:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 360 transitions. [2024-11-25 03:26:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-25 03:26:22,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-11-25 03:26:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 265 states and 363 transitions. [2024-11-25 03:26:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 363 transitions. [2024-11-25 03:26:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-25 03:26:23,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-11-25 03:26:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 269 states and 368 transitions. [2024-11-25 03:26:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 368 transitions. [2024-11-25 03:26:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-25 03:26:23,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-25 03:26:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 274 states and 374 transitions. [2024-11-25 03:26:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 374 transitions. [2024-11-25 03:26:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 03:26:24,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-11-25 03:26:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 279 states and 382 transitions. [2024-11-25 03:26:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 382 transitions. [2024-11-25 03:26:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-25 03:26:25,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:25,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2024-11-25 03:26:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 279 states and 381 transitions. [2024-11-25 03:26:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 381 transitions. [2024-11-25 03:26:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 03:26:25,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-25 03:26:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 281 states and 382 transitions. [2024-11-25 03:26:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 382 transitions. [2024-11-25 03:26:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-25 03:26:26,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 206 proven. 13 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 292 states and 397 transitions. [2024-11-25 03:26:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 397 transitions. [2024-11-25 03:26:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-25 03:26:27,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 206 proven. 13 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:28,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 296 states and 400 transitions. [2024-11-25 03:26:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 400 transitions. [2024-11-25 03:26:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-25 03:26:28,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2024-11-25 03:26:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 302 states and 409 transitions. [2024-11-25 03:26:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 409 transitions. [2024-11-25 03:26:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-25 03:26:29,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:29,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2024-11-25 03:26:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 298 states and 403 transitions. [2024-11-25 03:26:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 403 transitions. [2024-11-25 03:26:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:26:30,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:30,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2024-11-25 03:26:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 299 states and 404 transitions. [2024-11-25 03:26:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 404 transitions. [2024-11-25 03:26:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:26:31,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 223 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-11-25 03:26:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 326 states and 453 transitions. [2024-11-25 03:26:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 453 transitions. [2024-11-25 03:26:34,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:26:34,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:34,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 223 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-11-25 03:26:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 330 states and 456 transitions. [2024-11-25 03:26:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 456 transitions. [2024-11-25 03:26:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:26:35,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-25 03:26:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 335 states and 465 transitions. [2024-11-25 03:26:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 465 transitions. [2024-11-25 03:26:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:26:36,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:36,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-25 03:26:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 336 states and 467 transitions. [2024-11-25 03:26:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 467 transitions. [2024-11-25 03:26:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:26:37,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-11-25 03:26:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 368 states and 518 transitions. [2024-11-25 03:26:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 518 transitions. [2024-11-25 03:26:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-25 03:26:40,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:40,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-25 03:26:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:41,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 372 states and 525 transitions. [2024-11-25 03:26:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 525 transitions. [2024-11-25 03:26:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-25 03:26:41,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:41,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-25 03:26:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 373 states and 527 transitions. [2024-11-25 03:26:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 527 transitions. [2024-11-25 03:26:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 03:26:41,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-25 03:26:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 375 states and 529 transitions. [2024-11-25 03:26:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 529 transitions. [2024-11-25 03:26:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 03:26:42,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2024-11-25 03:26:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 377 states and 531 transitions. [2024-11-25 03:26:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 531 transitions. [2024-11-25 03:26:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-25 03:26:43,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 272 proven. 16 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 391 states and 547 transitions. [2024-11-25 03:26:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 547 transitions. [2024-11-25 03:26:44,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 03:26:44,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-11-25 03:26:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 402 states and 564 transitions. [2024-11-25 03:26:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 564 transitions. [2024-11-25 03:26:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 03:26:47,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:47,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-11-25 03:26:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 406 states and 567 transitions. [2024-11-25 03:26:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 567 transitions. [2024-11-25 03:26:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 03:26:47,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2024-11-25 03:26:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 407 states and 568 transitions. [2024-11-25 03:26:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 568 transitions. [2024-11-25 03:26:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 03:26:48,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:48,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-25 03:26:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 416 states and 581 transitions. [2024-11-25 03:26:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 581 transitions. [2024-11-25 03:26:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 03:26:50,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:50,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-25 03:26:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 420 states and 584 transitions. [2024-11-25 03:26:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 584 transitions. [2024-11-25 03:26:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-25 03:26:51,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-25 03:26:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 433 states and 601 transitions. [2024-11-25 03:26:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 601 transitions. [2024-11-25 03:26:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-25 03:26:53,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2024-11-25 03:26:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 437 states and 605 transitions. [2024-11-25 03:26:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 605 transitions. [2024-11-25 03:26:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-25 03:26:54,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-11-25 03:26:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 440 states and 608 transitions. [2024-11-25 03:26:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2024-11-25 03:26:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-25 03:26:54,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 384 proven. 45 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 454 states and 624 transitions. [2024-11-25 03:26:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 624 transitions. [2024-11-25 03:26:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 03:26:55,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 496 proven. 88 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 468 states and 640 transitions. [2024-11-25 03:26:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 640 transitions. [2024-11-25 03:26:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-25 03:26:56,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:56,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 608 proven. 145 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 482 states and 656 transitions. [2024-11-25 03:26:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 656 transitions. [2024-11-25 03:26:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 03:26:58,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1293 backedges. 720 proven. 216 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:26:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:26:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 496 states and 672 transitions. [2024-11-25 03:26:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 672 transitions. [2024-11-25 03:26:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-25 03:26:59,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:26:59,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:26:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:26:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 832 proven. 301 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-25 03:27:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 510 states and 687 transitions. [2024-11-25 03:27:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 687 transitions. [2024-11-25 03:27:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-25 03:27:00,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:00,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 42 proven. 902 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-11-25 03:27:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 511 states and 689 transitions. [2024-11-25 03:27:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 689 transitions. [2024-11-25 03:27:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-25 03:27:01,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:01,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2024-11-25 03:27:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 542 states and 746 transitions. [2024-11-25 03:27:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 746 transitions. [2024-11-25 03:27:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-25 03:27:07,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2024-11-25 03:27:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 546 states and 749 transitions. [2024-11-25 03:27:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 749 transitions. [2024-11-25 03:27:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 03:27:08,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 0 proven. 461 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-11-25 03:27:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 553 states and 765 transitions. [2024-11-25 03:27:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 765 transitions. [2024-11-25 03:27:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 03:27:10,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:10,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2131 trivial. 0 not checked. [2024-11-25 03:27:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 555 states and 766 transitions. [2024-11-25 03:27:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 766 transitions. [2024-11-25 03:27:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 03:27:11,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:11,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2131 trivial. 0 not checked. [2024-11-25 03:27:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 556 states and 769 transitions. [2024-11-25 03:27:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 769 transitions. [2024-11-25 03:27:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 03:27:12,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:12,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2131 trivial. 0 not checked. [2024-11-25 03:27:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 557 states and 771 transitions. [2024-11-25 03:27:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 771 transitions. [2024-11-25 03:27:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-25 03:27:13,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2024-11-25 03:27:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 562 states and 780 transitions. [2024-11-25 03:27:14,652 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 780 transitions. [2024-11-25 03:27:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-25 03:27:14,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2024-11-25 03:27:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 567 states and 789 transitions. [2024-11-25 03:27:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 789 transitions. [2024-11-25 03:27:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-25 03:27:16,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2024-11-25 03:27:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 568 states and 793 transitions. [2024-11-25 03:27:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 793 transitions. [2024-11-25 03:27:17,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-25 03:27:17,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:17,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2024-11-25 03:27:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 569 states and 795 transitions. [2024-11-25 03:27:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 795 transitions. [2024-11-25 03:27:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-25 03:27:18,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2024-11-25 03:27:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 570 states and 797 transitions. [2024-11-25 03:27:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 797 transitions. [2024-11-25 03:27:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-25 03:27:18,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2140 trivial. 0 not checked. [2024-11-25 03:27:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 572 states and 798 transitions. [2024-11-25 03:27:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 798 transitions. [2024-11-25 03:27:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-25 03:27:19,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:19,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2140 trivial. 0 not checked. [2024-11-25 03:27:20,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 573 states and 798 transitions. [2024-11-25 03:27:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 798 transitions. [2024-11-25 03:27:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-25 03:27:20,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:20,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2157 trivial. 0 not checked. [2024-11-25 03:27:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 575 states and 799 transitions. [2024-11-25 03:27:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 799 transitions. [2024-11-25 03:27:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-25 03:27:21,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2157 trivial. 0 not checked. [2024-11-25 03:27:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 576 states and 799 transitions. [2024-11-25 03:27:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 799 transitions. [2024-11-25 03:27:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-25 03:27:21,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:21,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2191 backedges. 551 proven. 16 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 590 states and 817 transitions. [2024-11-25 03:27:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 817 transitions. [2024-11-25 03:27:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-25 03:27:24,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2191 backedges. 551 proven. 16 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 594 states and 820 transitions. [2024-11-25 03:27:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 820 transitions. [2024-11-25 03:27:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-25 03:27:24,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2308 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 2061 trivial. 0 not checked. [2024-11-25 03:27:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 594 states and 819 transitions. [2024-11-25 03:27:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 819 transitions. [2024-11-25 03:27:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-25 03:27:25,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:25,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2308 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 2061 trivial. 0 not checked. [2024-11-25 03:27:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 594 states and 818 transitions. [2024-11-25 03:27:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 818 transitions. [2024-11-25 03:27:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-25 03:27:26,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2348 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2024-11-25 03:27:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 607 states and 835 transitions. [2024-11-25 03:27:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 835 transitions. [2024-11-25 03:27:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-25 03:27:29,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2348 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2024-11-25 03:27:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 612 states and 839 transitions. [2024-11-25 03:27:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 839 transitions. [2024-11-25 03:27:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-25 03:27:30,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2382 trivial. 0 not checked. [2024-11-25 03:27:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 616 states and 844 transitions. [2024-11-25 03:27:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 844 transitions. [2024-11-25 03:27:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-25 03:27:31,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:31,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2382 trivial. 0 not checked. [2024-11-25 03:27:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 618 states and 845 transitions. [2024-11-25 03:27:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 845 transitions. [2024-11-25 03:27:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-25 03:27:32,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:32,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 681 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2024-11-25 03:27:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 621 states and 849 transitions. [2024-11-25 03:27:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 849 transitions. [2024-11-25 03:27:33,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-25 03:27:33,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:33,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2382 trivial. 0 not checked. [2024-11-25 03:27:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 621 states and 848 transitions. [2024-11-25 03:27:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 848 transitions. [2024-11-25 03:27:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-25 03:27:34,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:34,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 1678 trivial. 0 not checked. [2024-11-25 03:27:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 624 states and 851 transitions. [2024-11-25 03:27:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 851 transitions. [2024-11-25 03:27:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-25 03:27:34,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 1678 trivial. 0 not checked. [2024-11-25 03:27:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 627 states and 854 transitions. [2024-11-25 03:27:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 854 transitions. [2024-11-25 03:27:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-25 03:27:35,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked. [2024-11-25 03:27:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 627 states and 853 transitions. [2024-11-25 03:27:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 853 transitions. [2024-11-25 03:27:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-25 03:27:36,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 776 proven. 45 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 641 states and 871 transitions. [2024-11-25 03:27:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 871 transitions. [2024-11-25 03:27:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-25 03:27:38,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:38,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 776 proven. 45 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 645 states and 874 transitions. [2024-11-25 03:27:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 874 transitions. [2024-11-25 03:27:39,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 03:27:39,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2713 backedges. 1001 proven. 88 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 659 states and 892 transitions. [2024-11-25 03:27:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 892 transitions. [2024-11-25 03:27:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-25 03:27:41,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:41,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2713 backedges. 1001 proven. 88 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 663 states and 895 transitions. [2024-11-25 03:27:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 895 transitions. [2024-11-25 03:27:42,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-25 03:27:42,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:42,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 1226 proven. 145 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 677 states and 913 transitions. [2024-11-25 03:27:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 913 transitions. [2024-11-25 03:27:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-25 03:27:44,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 1226 proven. 145 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 681 states and 916 transitions. [2024-11-25 03:27:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 916 transitions. [2024-11-25 03:27:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-25 03:27:45,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:45,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 1451 proven. 216 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 695 states and 934 transitions. [2024-11-25 03:27:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 934 transitions. [2024-11-25 03:27:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-25 03:27:47,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 1451 proven. 216 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 699 states and 937 transitions. [2024-11-25 03:27:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 937 transitions. [2024-11-25 03:27:49,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-25 03:27:49,016 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 1676 proven. 301 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 713 states and 953 transitions. [2024-11-25 03:27:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 953 transitions. [2024-11-25 03:27:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-25 03:27:51,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 1676 proven. 301 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-25 03:27:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:27:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 717 states and 956 transitions. [2024-11-25 03:27:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 956 transitions. [2024-11-25 03:27:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-25 03:27:52,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:27:52,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:27:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:27:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 1000 proven. 1768 refuted. 0 times theorem prover too weak. 1157 trivial. 0 not checked. [2024-11-25 03:28:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:28:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 828 states and 1090 transitions. [2024-11-25 03:28:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1090 transitions. [2024-11-25 03:28:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-25 03:28:06,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:28:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:28:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:28:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 1000 proven. 1768 refuted. 0 times theorem prover too weak. 1157 trivial. 0 not checked. [2024-11-25 03:28:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:28:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 832 states and 1093 transitions. [2024-11-25 03:28:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1093 transitions. [2024-11-25 03:28:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-25 03:28:07,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:28:07,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:28:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:28:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 2535 proven. 99 refuted. 0 times theorem prover too weak. 1629 trivial. 0 not checked. [2024-11-25 03:28:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:28:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 429 states and 501 transitions. [2024-11-25 03:28:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 501 transitions. [2024-11-25 03:28:08,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 03:28:08,595 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 129 iterations. [2024-11-25 03:28:08,606 INFO L726 CodeCheckObserver]: All specifications hold 18 specifications checked. All of them hold [2024-11-25 03:28:23,313 INFO L77 FloydHoareUtils]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2024-11-25 03:28:23,313 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line 4) the Hoare annotation is: true [2024-11-25 03:28:23,313 INFO L77 FloydHoareUtils]: At program point L64(line 64) the Hoare annotation is: true [2024-11-25 03:28:23,313 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-25 03:28:23,313 INFO L77 FloydHoareUtils]: At program point L64-1(line 64) the Hoare annotation is: true [2024-11-25 03:28:23,313 INFO L77 FloydHoareUtils]: At program point L48(line 48) the Hoare annotation is: true [2024-11-25 03:28:23,314 INFO L77 FloydHoareUtils]: At program point L48-1(line 48) the Hoare annotation is: true [2024-11-25 03:28:23,314 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2024-11-25 03:28:23,314 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-11-25 03:28:23,314 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 13 102) the Hoare annotation is: true [2024-11-25 03:28:23,315 INFO L77 FloydHoareUtils]: At program point L40(lines 39 89) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,315 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-11-25 03:28:23,315 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-25 03:28:23,315 INFO L75 FloydHoareUtils]: For program point L94(line 94) no Hoare annotation was computed. [2024-11-25 03:28:23,315 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-11-25 03:28:23,315 INFO L75 FloydHoareUtils]: For program point L94-1(line 94) no Hoare annotation was computed. [2024-11-25 03:28:23,315 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 94) no Hoare annotation was computed. [2024-11-25 03:28:23,316 INFO L77 FloydHoareUtils]: At program point L53(line 53) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,316 INFO L77 FloydHoareUtils]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse18 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse17 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse14 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse15 (< 3 |ULTIMATE.start_main_~main__j~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse13 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse20 (<= 0 (+ 2147483649 |ULTIMATE.start_main_~main__j~0#1|))) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse8 (<= 1 |ULTIMATE.start_main_~main__j~0#1|) .cse9 .cse10 .cse13 .cse2) (and .cse8 .cse9 .cse14 .cse10 .cse2 .cse15) (and .cse16 .cse1 .cse17 .cse2 .cse4) (and .cse8 .cse9 .cse18 .cse10 .cse19 .cse2) (and .cse1 .cse18 .cse19 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse14 .cse7 .cse2 .cse15) (and .cse1 .cse7 .cse13 .cse2 .cse20) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse18 .cse7 .cse19 .cse2) (and .cse16 .cse1 .cse17 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse16 .cse9 .cse17 .cse10 .cse2) (and .cse1 .cse14 .cse2 .cse4 .cse15) (and .cse1 .cse13 .cse2 .cse20 .cse4))) [2024-11-25 03:28:23,317 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-11-25 03:28:23,317 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 53) no Hoare annotation was computed. [2024-11-25 03:28:23,317 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-25 03:28:23,317 INFO L77 FloydHoareUtils]: At program point L33(lines 33 89) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-11-25 03:28:23,317 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 03:28:23,318 INFO L77 FloydHoareUtils]: At program point L62(lines 62 70) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,318 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-11-25 03:28:23,318 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 94) no Hoare annotation was computed. [2024-11-25 03:28:23,318 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-11-25 03:28:23,319 INFO L77 FloydHoareUtils]: At program point L46(lines 46 87) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,319 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 53) no Hoare annotation was computed. [2024-11-25 03:28:23,319 INFO L77 FloydHoareUtils]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse1 (< 0 (+ |ULTIMATE.start_main_~main__nlen~0#1| 2147483648)))) (or (and (<= |ULTIMATE.start_main_~main__i~0#1| 1) .cse0 (<= 1 |ULTIMATE.start_main_~main__i~0#1|) .cse1) (and .cse0 (= |ULTIMATE.start_main_~main__i~0#1| 0) .cse1) (and (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|)) (< |ULTIMATE.start_main_~main__i~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648)) .cse1) (and (< 1 |ULTIMATE.start_main_~main__i~0#1|) (<= |ULTIMATE.start_main_~main__i~0#1| 2147483646) .cse0 .cse1))) [2024-11-25 03:28:23,319 INFO L77 FloydHoareUtils]: At program point L75-1(line 75) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse1 (< 0 (+ |ULTIMATE.start_main_~main__nlen~0#1| 2147483648)))) (or (and .cse0 (= |ULTIMATE.start_main_~main__i~0#1| 0) .cse1) (and (<= |ULTIMATE.start_main_~main__i~0#1| 1) (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ |ULTIMATE.start_main_~main__i~0#1| 2147483646)) (<= 0 (+ 2147483649 |ULTIMATE.start_main_~main__i~0#1|)) .cse1) (and (< 1 |ULTIMATE.start_main_~main__i~0#1|) (<= |ULTIMATE.start_main_~main__i~0#1| 2147483646) .cse0 .cse1))) [2024-11-25 03:28:23,319 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 03:28:23,319 INFO L77 FloydHoareUtils]: At program point $Ultimate##10(lines 55 86) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse1 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse4 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse5 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse3 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse3) (and .cse4 .cse5 (= |ULTIMATE.start_main_~main__i~0#1| 0) .cse3) (and .cse0 (<= 1 |ULTIMATE.start_main_~main__j~0#1|) .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse3 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)))) [2024-11-25 03:28:23,320 INFO L77 FloydHoareUtils]: At program point $Ultimate##2(lines 23 101) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0)) [2024-11-25 03:28:23,320 INFO L77 FloydHoareUtils]: At program point L30(line 30) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-11-25 03:28:23,320 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-25 03:28:23,320 INFO L77 FloydHoareUtils]: At program point L30-1(line 30) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-11-25 03:28:23,320 INFO L77 FloydHoareUtils]: At program point L30-2(line 30) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-11-25 03:28:23,320 INFO L77 FloydHoareUtils]: At program point L30-3(line 30) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-11-25 03:28:23,321 INFO L77 FloydHoareUtils]: At program point L59(line 59) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,321 INFO L77 FloydHoareUtils]: At program point L26(lines 26 96) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-11-25 03:28:23,321 INFO L77 FloydHoareUtils]: At program point L59-1(line 59) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,322 INFO L77 FloydHoareUtils]: At program point L59-2(line 59) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,322 INFO L77 FloydHoareUtils]: At program point L59-3(line 59) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,322 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2024-11-25 03:28:23,323 INFO L77 FloydHoareUtils]: At program point L76(lines 76 85) the Hoare annotation is: (let ((.cse0 (< 0 (+ |ULTIMATE.start_main_~main__nlen~0#1| 2147483648)))) (or (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~main__i~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|)) (< |ULTIMATE.start_main_~main__i~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648)) .cse0))) [2024-11-25 03:28:23,323 INFO L77 FloydHoareUtils]: At program point L43(line 43) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,323 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-11-25 03:28:23,324 INFO L77 FloydHoareUtils]: At program point L43-1(line 43) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,324 INFO L77 FloydHoareUtils]: At program point L43-2(line 43) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,324 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-11-25 03:28:23,324 INFO L77 FloydHoareUtils]: At program point L43-3(line 43) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-11-25 03:28:23,324 INFO L77 FloydHoareUtils]: At program point L35(line 35) the Hoare annotation is: true [2024-11-25 03:28:23,325 INFO L77 FloydHoareUtils]: At program point L35-1(line 35) the Hoare annotation is: true [2024-11-25 03:28:23,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:28:23 ImpRootNode [2024-11-25 03:28:23,367 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:28:23,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:28:23,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:28:23,372 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:28:23,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:25:59" (3/4) ... [2024-11-25 03:28:23,375 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 03:28:23,379 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2024-11-25 03:28:23,386 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-25 03:28:23,387 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-25 03:28:23,387 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-25 03:28:23,388 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 03:28:23,486 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:28:23,486 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:28:23,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:28:23,487 INFO L158 Benchmark]: Toolchain (without parser) took 144440.83ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 95.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 378.0MB. Max. memory is 16.1GB. [2024-11-25 03:28:23,488 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:28:23,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.38ms. Allocated memory is still 117.4MB. Free memory was 94.7MB in the beginning and 83.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:28:23,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.73ms. Allocated memory is still 117.4MB. Free memory was 83.7MB in the beginning and 82.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:28:23,489 INFO L158 Benchmark]: Boogie Preprocessor took 28.86ms. Allocated memory is still 117.4MB. Free memory was 82.5MB in the beginning and 81.9MB in the end (delta: 602.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:28:23,489 INFO L158 Benchmark]: RCFGBuilder took 420.39ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 67.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 03:28:23,489 INFO L158 Benchmark]: CodeCheck took 143545.02ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 67.8MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 344.5MB. Max. memory is 16.1GB. [2024-11-25 03:28:23,490 INFO L158 Benchmark]: Witness Printer took 118.93ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:28:23,491 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 2 procedures, 55 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 128.7s, OverallIterations: 129, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107994 SdHoareTripleChecker+Valid, 269.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104949 mSDsluCounter, 62844 SdHoareTripleChecker+Invalid, 231.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46927 mSDsCounter, 18826 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199728 IncrementalHoareTripleChecker+Invalid, 218554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18826 mSolverCounterUnsat, 15917 mSDtfsCounter, 199728 mSolverCounterSat, 5.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127219 GetRequests, 117600 SyntacticMatches, 8613 SemanticMatches, 1006 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668677 ImplicationChecksByTransitivity, 104.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 19806 NumberOfCodeBlocks, 19806 NumberOfCodeBlocksAsserted, 128 NumberOfCheckSat, 19678 ConstructedInterpolants, 0 QuantifiedInterpolants, 48380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 128 InterpolantComputations, 87 PerfectInterpolantSequences, 124093/134615 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((main__nlen <= 2147483647) && (main__i == 0)) - InvariantResult [Line: 55]: Location Invariant Derived location invariant: ((((((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__i < 1)) && (0 <= (main__i + 2147483648))) && (main__j == 0)) && (((long long) main__i + 1) <= main__nlen)) || ((((0 <= (main__j + 2147483648)) && (main__nlen <= 2147483647)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= ((long long) 2147483645 + main__i)) && (1 <= main__j)) && (main__i < 1)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen))) || ((((0 <= (main__j + 2147483648)) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((1 < main__j) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (main__j <= 2)) && (1 <= main__i)) || (((((5 < main__j) && (main__nlen <= 2147483647)) && (main__j <= 6)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) || (((((1 < main__j) && (main__nlen <= 2147483647)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen)) && (main__j <= 2))) || (((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__i < 1)) && (0 <= (main__i + 2147483648))) && (main__j == 0)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= 2147483647) && (main__j <= 5)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen)) && (4 < main__j))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__i < 1)) && (main__j <= 5)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen)) && (4 < main__j))) || (((((0 <= (main__j + 2147483648)) && (main__nlen <= 2147483647)) && (main__j < 1)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (1 <= main__j)) && (main__i < 1)) && (0 <= (main__i + 2147483648))) && (main__j <= 1)) && (((long long) main__i + 1) <= main__nlen))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__i < 1)) && (main__j <= 4)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen)) && (3 < main__j))) || (((((1 <= main__j) && (main__nlen <= 2147483647)) && (main__i == 0)) && (main__j <= 1)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__j <= 3) && (main__nlen <= 2147483647)) && (2 < main__j)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__i < 1)) && (6 < main__j)) && (0 <= (main__i + 2147483648))) && (main__j <= 7)) && (((long long) main__i + 1) <= main__nlen))) || (((((0 <= (main__j + 2147483648)) && (main__nlen <= 2147483647)) && (main__j < 1)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= 2147483647) && (6 < main__j)) && (main__j <= 7)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) || (((((1 <= main__j) && (main__nlen <= 2147483647)) && (main__j <= 1)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) || (((((5 < main__j) && (main__nlen <= 2147483647)) && (main__i == 0)) && (main__j <= 6)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= 2147483647) && (main__j <= 4)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen)) && (3 < main__j))) || (((((main__nlen <= 2147483647) && (main__j <= 5)) && (((long long) main__i + 1) <= main__nlen)) && (4 < main__j)) && (1 <= main__i))) || ((((((5 < main__j) && (main__nlen <= ((long long) 2147483645 + main__i))) && (main__i < 1)) && (main__j <= 6)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= 2147483647) && (6 < main__j)) && (main__i == 0)) && (main__j <= 7)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__j <= 3) && (main__nlen <= 2147483647)) && (2 < main__j)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (1 < main__j)) && (main__i < 1)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen)) && (main__j <= 2))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__j <= 3)) && (main__i < 1)) && (2 < main__j)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= 2147483647) && (main__j <= 4)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i)) && (3 < main__j))) - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error. Ensures: ((__return_main == \old(__return_main)) && (__return_100 == \old(__return_100))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.38ms. Allocated memory is still 117.4MB. Free memory was 94.7MB in the beginning and 83.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.73ms. Allocated memory is still 117.4MB. Free memory was 83.7MB in the beginning and 82.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.86ms. Allocated memory is still 117.4MB. Free memory was 82.5MB in the beginning and 81.9MB in the end (delta: 602.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 420.39ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 67.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 143545.02ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 67.8MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 344.5MB. Max. memory is 16.1GB. * Witness Printer took 118.93ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 03:28:23,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1606391b-6010-4e14-985b-56612bd89b9d/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE