./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/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_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk --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.2.5-dev-a016563 [2024-11-09 00:22:21,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:22:21,138 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-11-09 00:22:21,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:22:21,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:22:21,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:22:21,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:22:21,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:22:21,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:22:21,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:22:21,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:22:21,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:22:21,191 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:22:21,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:22:21,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:22:21,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:22:21,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:22:21,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:22:21,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:22:21,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:22:21,197 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 00:22:21,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 00:22:21,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:22:21,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:22:21,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:22:21,202 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:22:21,203 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:22:21,203 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:22:21,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:22:21,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:22:21,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:22:21,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:22:21,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:22:21,206 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:22:21,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:22:21,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk 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-09 00:22:21,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:22:21,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:22:21,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:22:21,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:22:21,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:22:21,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c Unable to find full path for "g++" [2024-11-09 00:22:23,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:22:23,761 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:22:23,762 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c [2024-11-09 00:22:23,768 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/data/4d5c7aed5/63b81a09d45f40bb974172354227b0f8/FLAG00f6e5d99 [2024-11-09 00:22:23,780 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/data/4d5c7aed5/63b81a09d45f40bb974172354227b0f8 [2024-11-09 00:22:23,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:22:23,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:22:23,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:22:23,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:22:23,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:22:23,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:22:23" (1/1) ... [2024-11-09 00:22:23,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e95ddaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:23, skipping insertion in model container [2024-11-09 00:22:23,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:22:23" (1/1) ... [2024-11-09 00:22:23,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:22:24,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:22:24,095 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:22:24,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:22:24,149 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:22:24,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24 WrapperNode [2024-11-09 00:22:24,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:22:24,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:22:24,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:22:24,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:22:24,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,188 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-11-09 00:22:24,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:22:24,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:22:24,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:22:24,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:22:24,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:22:24,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:22:24,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:22:24,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:22:24,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:22:24,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:22:24,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:22:24,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:22:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 00:22:24,291 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 00:22:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:22:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:22:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:22:24,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:22:24,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:22:24,349 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:22:24,551 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-09 00:22:24,551 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:22:24,594 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:22:24,594 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 00:22:24,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:22:24 BoogieIcfgContainer [2024-11-09 00:22:24,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:22:24,595 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:22:24,597 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:22:24,609 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:22:24,609 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:22:24" (1/1) ... [2024-11-09 00:22:24,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:22:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 55 states and 63 transitions. [2024-11-09 00:22:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-11-09 00:22:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:22:24,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:24,931 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-09 00:22:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 58 states and 70 transitions. [2024-11-09 00:22:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-11-09 00:22:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:22:25,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:25,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:25,148 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-09 00:22:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 50 states and 57 transitions. [2024-11-09 00:22:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-09 00:22:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:22:25,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:25,379 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-09 00:22:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 49 states and 56 transitions. [2024-11-09 00:22:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-09 00:22:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 00:22:25,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:25,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:25,747 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-09 00:22:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 48 states and 55 transitions. [2024-11-09 00:22:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-09 00:22:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:22:26,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:26,214 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-09 00:22:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 47 states and 54 transitions. [2024-11-09 00:22:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-11-09 00:22:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:22:26,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:26,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:26,861 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-09 00:22:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 49 states and 56 transitions. [2024-11-09 00:22:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-09 00:22:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:22:27,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:27,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:27,101 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-09 00:22:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 52 states and 60 transitions. [2024-11-09 00:22:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-09 00:22:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:22:27,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:27,243 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-09 00:22:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 56 states and 66 transitions. [2024-11-09 00:22:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-09 00:22:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:22:27,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:27,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:27,553 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-09 00:22:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 61 states and 73 transitions. [2024-11-09 00:22:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-11-09 00:22:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:22:27,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:27,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:27,775 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-09 00:22:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 68 states and 84 transitions. [2024-11-09 00:22:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2024-11-09 00:22:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:22:28,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:28,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:28,041 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-09 00:22:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 69 states and 85 transitions. [2024-11-09 00:22:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2024-11-09 00:22:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:22:28,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:28,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:28,080 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-09 00:22:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 74 states and 94 transitions. [2024-11-09 00:22:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2024-11-09 00:22:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:22:28,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:28,375 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-09 00:22:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 79 states and 105 transitions. [2024-11-09 00:22:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2024-11-09 00:22:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 00:22:28,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:28,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:28,642 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-09 00:22:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 85 states and 116 transitions. [2024-11-09 00:22:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2024-11-09 00:22:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 00:22:28,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:28,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:28,808 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-09 00:22:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 86 states and 117 transitions. [2024-11-09 00:22:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-09 00:22:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:22:28,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:28,871 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-09 00:22:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 94 states and 130 transitions. [2024-11-09 00:22:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-11-09 00:22:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:22:29,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:29,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:29,130 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-09 00:22:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 98 states and 135 transitions. [2024-11-09 00:22:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-09 00:22:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:22:29,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:29,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:22:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 99 states and 137 transitions. [2024-11-09 00:22:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2024-11-09 00:22:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 00:22:29,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:29,486 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-09 00:22:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 100 states and 139 transitions. [2024-11-09 00:22:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-11-09 00:22:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 00:22:29,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:29,575 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-09 00:22:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 101 states and 141 transitions. [2024-11-09 00:22:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-11-09 00:22:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 00:22:29,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:29,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:29,644 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-09 00:22:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 103 states and 144 transitions. [2024-11-09 00:22:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2024-11-09 00:22:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 00:22:29,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:29,746 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-09 00:22:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 104 states and 145 transitions. [2024-11-09 00:22:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2024-11-09 00:22:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:22:29,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:29,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:29,889 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-09 00:22:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 117 states and 162 transitions. [2024-11-09 00:22:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 162 transitions. [2024-11-09 00:22:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 00:22:30,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:30,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:30,623 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-09 00:22:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 121 states and 173 transitions. [2024-11-09 00:22:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-11-09 00:22:31,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 00:22:31,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:31,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:31,235 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-09 00:22:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 124 states and 178 transitions. [2024-11-09 00:22:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2024-11-09 00:22:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 00:22:31,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:31,795 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-09 00:22:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 127 states and 183 transitions. [2024-11-09 00:22:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2024-11-09 00:22:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:22:32,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:32,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:32,141 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-09 00:22:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 130 states and 187 transitions. [2024-11-09 00:22:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2024-11-09 00:22:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 00:22:32,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:32,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:32,480 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-09 00:22:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 134 states and 192 transitions. [2024-11-09 00:22:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 192 transitions. [2024-11-09 00:22:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 00:22:32,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:32,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:32,979 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-09 00:22:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 135 states and 196 transitions. [2024-11-09 00:22:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2024-11-09 00:22:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 00:22:33,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:33,101 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-09 00:22:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 138 states and 200 transitions. [2024-11-09 00:22:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 200 transitions. [2024-11-09 00:22:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:22:33,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:33,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:33,189 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-09 00:22:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 141 states and 205 transitions. [2024-11-09 00:22:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 205 transitions. [2024-11-09 00:22:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:22:33,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:33,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:33,292 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-09 00:22:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 142 states and 206 transitions. [2024-11-09 00:22:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 206 transitions. [2024-11-09 00:22:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:22:33,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:33,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:33,497 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-09 00:22:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 143 states and 207 transitions. [2024-11-09 00:22:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 207 transitions. [2024-11-09 00:22:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:22:33,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:33,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:33,751 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-09 00:22:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 157 states and 223 transitions. [2024-11-09 00:22:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 223 transitions. [2024-11-09 00:22:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 00:22:34,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:34,541 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-09 00:22:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 160 states and 233 transitions. [2024-11-09 00:22:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 233 transitions. [2024-11-09 00:22:35,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 00:22:35,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:35,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:35,662 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-09 00:22:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 162 states and 237 transitions. [2024-11-09 00:22:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2024-11-09 00:22:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 00:22:35,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:35,893 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-09 00:22:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 162 states and 236 transitions. [2024-11-09 00:22:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2024-11-09 00:22:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 00:22:36,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:36,324 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-09 00:22:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 164 states and 238 transitions. [2024-11-09 00:22:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2024-11-09 00:22:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 00:22:36,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:36,522 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-09 00:22:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 167 states and 241 transitions. [2024-11-09 00:22:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 241 transitions. [2024-11-09 00:22:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 00:22:36,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:36,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:36,900 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-09 00:22:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 181 states and 257 transitions. [2024-11-09 00:22:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2024-11-09 00:22:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:22:37,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:37,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:37,609 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-09 00:22:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 195 states and 273 transitions. [2024-11-09 00:22:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 273 transitions. [2024-11-09 00:22:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 00:22:38,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:38,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:38,413 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-09 00:22:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 209 states and 289 transitions. [2024-11-09 00:22:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 289 transitions. [2024-11-09 00:22:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 00:22:39,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:39,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:39,329 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-09 00:22:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 223 states and 305 transitions. [2024-11-09 00:22:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 305 transitions. [2024-11-09 00:22:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 00:22:40,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:40,322 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-09 00:22:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 237 states and 320 transitions. [2024-11-09 00:22:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 320 transitions. [2024-11-09 00:22:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 00:22:40,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:40,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:41,142 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-09 00:22:42,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 243 states and 333 transitions. [2024-11-09 00:22:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 333 transitions. [2024-11-09 00:22:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 00:22:42,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:42,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:42,423 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-09 00:22:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 244 states and 334 transitions. [2024-11-09 00:22:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 334 transitions. [2024-11-09 00:22:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 00:22:43,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:43,102 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-09 00:22:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 246 states and 336 transitions. [2024-11-09 00:22:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 336 transitions. [2024-11-09 00:22:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 00:22:43,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:43,627 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-09 00:22:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 247 states and 336 transitions. [2024-11-09 00:22:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 336 transitions. [2024-11-09 00:22:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 00:22:43,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:43,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:43,905 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-09 00:22:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 249 states and 338 transitions. [2024-11-09 00:22:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 338 transitions. [2024-11-09 00:22:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 00:22:44,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:44,901 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-09 00:22:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 259 states and 351 transitions. [2024-11-09 00:22:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 351 transitions. [2024-11-09 00:22:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 00:22:46,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:46,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:46,062 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-09 00:22:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 260 states and 352 transitions. [2024-11-09 00:22:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 352 transitions. [2024-11-09 00:22:46,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 00:22:46,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:46,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:46,777 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-09 00:22:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 261 states and 357 transitions. [2024-11-09 00:22:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2024-11-09 00:22:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 00:22:47,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:47,094 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-09 00:22:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 263 states and 360 transitions. [2024-11-09 00:22:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 360 transitions. [2024-11-09 00:22:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 00:22:47,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:47,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:47,676 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-09 00:22:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 267 states and 365 transitions. [2024-11-09 00:22:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 365 transitions. [2024-11-09 00:22:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 00:22:48,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:48,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:48,100 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-09 00:22:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 272 states and 371 transitions. [2024-11-09 00:22:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 371 transitions. [2024-11-09 00:22:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 00:22:48,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:48,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:48,594 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-09 00:22:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 277 states and 379 transitions. [2024-11-09 00:22:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 379 transitions. [2024-11-09 00:22:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 00:22:49,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:49,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:49,579 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-09 00:22:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 277 states and 378 transitions. [2024-11-09 00:22:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 378 transitions. [2024-11-09 00:22:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 00:22:50,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:50,153 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-09 00:22:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 279 states and 379 transitions. [2024-11-09 00:22:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 379 transitions. [2024-11-09 00:22:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 00:22:50,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:50,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:50,590 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-09 00:22:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 290 states and 394 transitions. [2024-11-09 00:22:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 394 transitions. [2024-11-09 00:22:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 00:22:52,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:52,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:52,366 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-09 00:22:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 294 states and 397 transitions. [2024-11-09 00:22:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 397 transitions. [2024-11-09 00:22:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 00:22:52,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:52,864 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-09 00:22:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 300 states and 406 transitions. [2024-11-09 00:22:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 406 transitions. [2024-11-09 00:22:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 00:22:54,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:54,794 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-09 00:22:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 296 states and 400 transitions. [2024-11-09 00:22:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 400 transitions. [2024-11-09 00:22:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 00:22:55,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:55,249 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-09 00:22:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 297 states and 401 transitions. [2024-11-09 00:22:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 401 transitions. [2024-11-09 00:22:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 00:22:56,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,388 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-09 00:22:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 324 states and 450 transitions. [2024-11-09 00:22:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 450 transitions. [2024-11-09 00:22:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 00:22:59,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:59,965 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-09 00:23:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 328 states and 453 transitions. [2024-11-09 00:23:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 453 transitions. [2024-11-09 00:23:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:23:00,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:00,431 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-09 00:23:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 334 states and 464 transitions. [2024-11-09 00:23:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 464 transitions. [2024-11-09 00:23:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:23:01,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:01,966 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-09 00:23:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 366 states and 515 transitions. [2024-11-09 00:23:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 515 transitions. [2024-11-09 00:23:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 00:23:04,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:04,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:04,711 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-09 00:23:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 370 states and 522 transitions. [2024-11-09 00:23:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 522 transitions. [2024-11-09 00:23:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 00:23:05,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:05,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:05,581 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-09 00:23:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 371 states and 524 transitions. [2024-11-09 00:23:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 524 transitions. [2024-11-09 00:23:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:23:06,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:06,082 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-09 00:23:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 373 states and 526 transitions. [2024-11-09 00:23:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 526 transitions. [2024-11-09 00:23:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:23:06,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:06,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:06,884 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-09 00:23:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 375 states and 528 transitions. [2024-11-09 00:23:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 528 transitions. [2024-11-09 00:23:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 00:23:07,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,666 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-09 00:23:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 389 states and 544 transitions. [2024-11-09 00:23:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 544 transitions. [2024-11-09 00:23:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:23:08,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:08,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,846 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-09 00:23:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 400 states and 561 transitions. [2024-11-09 00:23:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 561 transitions. [2024-11-09 00:23:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:23:11,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:11,777 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-09 00:23:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 404 states and 564 transitions. [2024-11-09 00:23:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 564 transitions. [2024-11-09 00:23:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:23:12,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:12,293 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-09 00:23:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 407 states and 568 transitions. [2024-11-09 00:23:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 568 transitions. [2024-11-09 00:23:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:23:13,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:13,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:13,942 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-09 00:23:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 416 states and 581 transitions. [2024-11-09 00:23:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 581 transitions. [2024-11-09 00:23:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:23:15,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:16,004 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-09 00:23:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 420 states and 584 transitions. [2024-11-09 00:23:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 584 transitions. [2024-11-09 00:23:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 00:23:16,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:16,624 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-09 00:23:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 424 states and 589 transitions. [2024-11-09 00:23:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 589 transitions. [2024-11-09 00:23:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 00:23:17,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:17,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:17,699 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-09 00:23:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 437 states and 604 transitions. [2024-11-09 00:23:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 604 transitions. [2024-11-09 00:23:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-09 00:23:18,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:18,753 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-09 00:23:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 440 states and 607 transitions. [2024-11-09 00:23:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 607 transitions. [2024-11-09 00:23:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 00:23:19,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:19,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:19,315 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-09 00:23:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 454 states and 623 transitions. [2024-11-09 00:23:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 623 transitions. [2024-11-09 00:23:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-09 00:23:20,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:20,489 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-09 00:23:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 468 states and 639 transitions. [2024-11-09 00:23:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 639 transitions. [2024-11-09 00:23:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-09 00:23:21,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:21,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:21,879 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-09 00:23:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 482 states and 655 transitions. [2024-11-09 00:23:23,098 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 655 transitions. [2024-11-09 00:23:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 00:23:23,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:23,361 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-09 00:23:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 496 states and 671 transitions. [2024-11-09 00:23:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 671 transitions. [2024-11-09 00:23:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-09 00:23:24,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:24,659 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-09 00:23:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 510 states and 686 transitions. [2024-11-09 00:23:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 686 transitions. [2024-11-09 00:23:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:23:25,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:26,073 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-09 00:23:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 511 states and 688 transitions. [2024-11-09 00:23:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 688 transitions. [2024-11-09 00:23:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-09 00:23:26,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:26,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:27,199 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-09 00:23:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 542 states and 745 transitions. [2024-11-09 00:23:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 745 transitions. [2024-11-09 00:23:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-09 00:23:32,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:33,023 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-09 00:23:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 546 states and 748 transitions. [2024-11-09 00:23:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 748 transitions. [2024-11-09 00:23:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-09 00:23:33,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:33,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:33,981 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-09 00:23:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 553 states and 764 transitions. [2024-11-09 00:23:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 764 transitions. [2024-11-09 00:23:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-09 00:23:35,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:35,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:35,993 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-09 00:23:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 555 states and 765 transitions. [2024-11-09 00:23:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 765 transitions. [2024-11-09 00:23:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-09 00:23:36,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:36,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:37,080 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-09 00:23:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 557 states and 770 transitions. [2024-11-09 00:23:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 770 transitions. [2024-11-09 00:23:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-09 00:23:38,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:38,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:39,008 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-09 00:23:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 561 states and 777 transitions. [2024-11-09 00:23:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 777 transitions. [2024-11-09 00:23:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-09 00:23:40,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:40,254 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-09 00:23:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 566 states and 786 transitions. [2024-11-09 00:23:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 786 transitions. [2024-11-09 00:23:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-09 00:23:42,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:42,630 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-09 00:23:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 567 states and 788 transitions. [2024-11-09 00:23:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 788 transitions. [2024-11-09 00:23:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-09 00:23:43,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:43,392 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-09 00:23:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 569 states and 794 transitions. [2024-11-09 00:23:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 794 transitions. [2024-11-09 00:23:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-09 00:23:44,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:45,069 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-09 00:23:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 570 states and 796 transitions. [2024-11-09 00:23:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 796 transitions. [2024-11-09 00:23:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-09 00:23:45,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:45,456 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-09 00:23:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 572 states and 797 transitions. [2024-11-09 00:23:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 797 transitions. [2024-11-09 00:23:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-09 00:23:46,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:46,249 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-09 00:23:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 573 states and 797 transitions. [2024-11-09 00:23:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 797 transitions. [2024-11-09 00:23:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-09 00:23:47,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:47,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:47,278 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-09 00:23:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 575 states and 798 transitions. [2024-11-09 00:23:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 798 transitions. [2024-11-09 00:23:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-09 00:23:48,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:48,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:48,167 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-09 00:23:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 576 states and 798 transitions. [2024-11-09 00:23:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 798 transitions. [2024-11-09 00:23:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-09 00:23:48,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:49,042 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-09 00:23:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 590 states and 816 transitions. [2024-11-09 00:23:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 816 transitions. [2024-11-09 00:23:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-09 00:23:51,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:51,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:51,494 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-09 00:23:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 594 states and 819 transitions. [2024-11-09 00:23:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 819 transitions. [2024-11-09 00:23:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-09 00:23:52,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:52,284 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-09 00:23:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 594 states and 818 transitions. [2024-11-09 00:23:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 818 transitions. [2024-11-09 00:23:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-09 00:23:53,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:53,186 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-09 00:23:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 594 states and 817 transitions. [2024-11-09 00:23:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 817 transitions. [2024-11-09 00:23:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-09 00:23:54,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:54,169 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-09 00:23:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 607 states and 834 transitions. [2024-11-09 00:23:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 834 transitions. [2024-11-09 00:23:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-09 00:23:57,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:57,351 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-09 00:23:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 608 states and 835 transitions. [2024-11-09 00:23:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 835 transitions. [2024-11-09 00:23:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-09 00:23:57,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:58,053 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-09 00:23:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 612 states and 838 transitions. [2024-11-09 00:23:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 838 transitions. [2024-11-09 00:23:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-09 00:23:58,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:59,061 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-09 00:24:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 615 states and 842 transitions. [2024-11-09 00:24:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 842 transitions. [2024-11-09 00:24:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-09 00:24:00,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:00,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:00,198 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-09 00:24:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 617 states and 843 transitions. [2024-11-09 00:24:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 843 transitions. [2024-11-09 00:24:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-09 00:24:01,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:01,436 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-09 00:24:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 617 states and 842 transitions. [2024-11-09 00:24:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 842 transitions. [2024-11-09 00:24:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-09 00:24:02,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:02,521 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-09 00:24:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 620 states and 845 transitions. [2024-11-09 00:24:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 845 transitions. [2024-11-09 00:24:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-09 00:24:03,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:03,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:03,180 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-09 00:24:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 623 states and 848 transitions. [2024-11-09 00:24:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 848 transitions. [2024-11-09 00:24:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-09 00:24:04,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:04,090 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-09 00:24:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 623 states and 847 transitions. [2024-11-09 00:24:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 847 transitions. [2024-11-09 00:24:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-09 00:24:04,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:04,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:04,717 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-09 00:24:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 637 states and 865 transitions. [2024-11-09 00:24:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 865 transitions. [2024-11-09 00:24:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-09 00:24:06,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:06,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:06,866 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-09 00:24:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 641 states and 868 transitions. [2024-11-09 00:24:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 868 transitions. [2024-11-09 00:24:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-09 00:24:07,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:07,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:07,758 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-09 00:24:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 655 states and 886 transitions. [2024-11-09 00:24:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 886 transitions. [2024-11-09 00:24:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-09 00:24:09,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:10,182 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-09 00:24:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 659 states and 889 transitions. [2024-11-09 00:24:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 889 transitions. [2024-11-09 00:24:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-09 00:24:11,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:11,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:11,216 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-09 00:24:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 673 states and 907 transitions. [2024-11-09 00:24:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 907 transitions. [2024-11-09 00:24:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-09 00:24:13,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:13,761 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-09 00:24:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 677 states and 910 transitions. [2024-11-09 00:24:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 910 transitions. [2024-11-09 00:24:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-09 00:24:14,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:14,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:14,846 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-09 00:24:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 691 states and 928 transitions. [2024-11-09 00:24:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 928 transitions. [2024-11-09 00:24:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-09 00:24:17,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:17,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:17,460 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-09 00:24:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 695 states and 931 transitions. [2024-11-09 00:24:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 931 transitions. [2024-11-09 00:24:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-09 00:24:18,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:18,570 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-09 00:24:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 709 states and 947 transitions. [2024-11-09 00:24:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 947 transitions. [2024-11-09 00:24:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-09 00:24:20,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:20,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:20,775 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-09 00:24:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 713 states and 950 transitions. [2024-11-09 00:24:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 950 transitions. [2024-11-09 00:24:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-09 00:24:21,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:21,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:22,068 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-09 00:24:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 828 states and 1087 transitions. [2024-11-09 00:24:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1087 transitions. [2024-11-09 00:24:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-09 00:24:36,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:36,870 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-09 00:24:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 429 states and 501 transitions. [2024-11-09 00:24:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 501 transitions. [2024-11-09 00:24:37,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:24:37,548 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 126 iterations. [2024-11-09 00:24:37,558 INFO L729 CodeCheckObserver]: All specifications hold 18 specifications checked. All of them hold [2024-11-09 00:24:53,087 INFO L77 FloydHoareUtils]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2024-11-09 00:24:53,087 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line 4) the Hoare annotation is: true [2024-11-09 00:24:53,087 INFO L77 FloydHoareUtils]: At program point L64(line 64) the Hoare annotation is: true [2024-11-09 00:24:53,088 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-09 00:24:53,088 INFO L77 FloydHoareUtils]: At program point L64-1(line 64) the Hoare annotation is: true [2024-11-09 00:24:53,088 INFO L77 FloydHoareUtils]: At program point L48(line 48) the Hoare annotation is: true [2024-11-09 00:24:53,088 INFO L77 FloydHoareUtils]: At program point L48-1(line 48) the Hoare annotation is: true [2024-11-09 00:24:53,088 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2024-11-09 00:24:53,088 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-11-09 00:24:53,089 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 13 102) the Hoare annotation is: true [2024-11-09 00:24:53,089 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-09 00:24:53,090 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-11-09 00:24:53,090 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-09 00:24:53,090 INFO L75 FloydHoareUtils]: For program point L94(line 94) no Hoare annotation was computed. [2024-11-09 00:24:53,090 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-11-09 00:24:53,090 INFO L75 FloydHoareUtils]: For program point L94-1(line 94) no Hoare annotation was computed. [2024-11-09 00:24:53,090 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 94) no Hoare annotation was computed. [2024-11-09 00:24:53,091 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-09 00:24:53,091 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-09 00:24:53,091 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-11-09 00:24:53,091 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 53) no Hoare annotation was computed. [2024-11-09 00:24:53,092 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-09 00:24:53,092 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-09 00:24:53,092 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:24:53,093 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-09 00:24:53,093 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-11-09 00:24:53,093 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 94) no Hoare annotation was computed. [2024-11-09 00:24:53,094 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-11-09 00:24:53,094 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-09 00:24:53,094 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 53) no Hoare annotation was computed. [2024-11-09 00:24:53,095 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-09 00:24:53,095 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-09 00:24:53,095 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:24:53,095 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-09 00:24:53,095 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-09 00:24:53,096 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-09 00:24:53,096 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-09 00:24:53,096 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-09 00:24:53,096 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-09 00:24:53,096 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-09 00:24:53,097 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-09 00:24:53,097 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-09 00:24:53,098 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-09 00:24:53,098 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-09 00:24:53,098 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-09 00:24:53,099 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2024-11-09 00:24:53,099 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-09 00:24:53,099 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-09 00:24:53,100 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-11-09 00:24:53,100 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-09 00:24:53,100 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-09 00:24:53,101 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-11-09 00:24:53,101 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-09 00:24:53,101 INFO L77 FloydHoareUtils]: At program point L35(line 35) the Hoare annotation is: true [2024-11-09 00:24:53,101 INFO L77 FloydHoareUtils]: At program point L35-1(line 35) the Hoare annotation is: true [2024-11-09 00:24:53,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:24:53 ImpRootNode [2024-11-09 00:24:53,160 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:24:53,160 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:24:53,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:24:53,161 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:24:53,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:22:24" (3/4) ... [2024-11-09 00:24:53,164 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:24:53,168 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2024-11-09 00:24:53,176 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 00:24:53,176 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:24:53,176 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:24:53,176 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:24:53,289 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:24:53,289 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:24:53,289 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:24:53,290 INFO L158 Benchmark]: Toolchain (without parser) took 149505.58ms. Allocated memory was 136.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 94.8MB in the beginning and 693.2MB in the end (delta: -598.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-09 00:24:53,290 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 136.3MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:24:53,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.58ms. Allocated memory is still 136.3MB. Free memory was 94.8MB in the beginning and 82.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:24:53,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.57ms. Allocated memory is still 136.3MB. Free memory was 82.1MB in the beginning and 80.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:24:53,291 INFO L158 Benchmark]: Boogie Preprocessor took 32.24ms. Allocated memory is still 136.3MB. Free memory was 80.5MB in the beginning and 79.6MB in the end (delta: 838.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:24:53,292 INFO L158 Benchmark]: RCFGBuilder took 372.17ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 79.3MB in the beginning and 155.3MB in the end (delta: -75.9MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-09 00:24:53,293 INFO L158 Benchmark]: CodeCheck took 148564.54ms. Allocated memory was 184.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 155.2MB in the beginning and 699.4MB in the end (delta: -544.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-09 00:24:53,293 INFO L158 Benchmark]: Witness Printer took 128.90ms. Allocated memory is still 1.8GB. Free memory was 699.4MB in the beginning and 693.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:24:53,295 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: 132.9s, OverallIterations: 126, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103845 SdHoareTripleChecker+Valid, 264.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100878 mSDsluCounter, 60713 SdHoareTripleChecker+Invalid, 231.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45301 mSDsCounter, 18057 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191808 IncrementalHoareTripleChecker+Invalid, 209865 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18057 mSolverCounterUnsat, 15412 mSDtfsCounter, 191808 mSolverCounterSat, 4.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121831 GetRequests, 113218 SyntacticMatches, 7619 SemanticMatches, 994 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652544 ImplicationChecksByTransitivity, 107.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 19035 NumberOfCodeBlocks, 19035 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 18910 ConstructedInterpolants, 0 QuantifiedInterpolants, 44784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 125 InterpolantComputations, 85 PerfectInterpolantSequences, 119142/127896 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 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 136.3MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.58ms. Allocated memory is still 136.3MB. Free memory was 94.8MB in the beginning and 82.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.57ms. Allocated memory is still 136.3MB. Free memory was 82.1MB in the beginning and 80.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.24ms. Allocated memory is still 136.3MB. Free memory was 80.5MB in the beginning and 79.6MB in the end (delta: 838.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 372.17ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 79.3MB in the beginning and 155.3MB in the end (delta: -75.9MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * CodeCheck took 148564.54ms. Allocated memory was 184.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 155.2MB in the beginning and 699.4MB in the end (delta: -544.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 128.90ms. Allocated memory is still 1.8GB. Free memory was 699.4MB in the beginning and 693.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-09 00:24:53,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62c5a78-1706-4f47-925e-2653275b99ad/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE