./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loops/eureka_05.i --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_06501707-c3c4-4ac2-b8eb-594de44a4508/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/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_06501707-c3c4-4ac2-b8eb-594de44a4508/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/loops/eureka_05.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/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_06501707-c3c4-4ac2-b8eb-594de44a4508/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 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:31:06,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:31:06,632 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-11-09 00:31:06,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:31:06,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:31:06,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:31:06,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:31:06,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:31:06,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:31:06,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:31:06,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:31:06,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:31:06,683 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:31:06,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:31:06,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:31:06,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:31:06,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:31:06,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:31:06,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:31:06,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:31:06,690 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 00:31:06,694 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 00:31:06,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:31:06,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:31:06,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:31:06,696 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:31:06,696 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:31:06,696 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:31:06,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:31:06,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:31:06,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:31:06,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:31:06,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:31:06,698 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:31:06,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:31:06,699 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_06501707-c3c4-4ac2-b8eb-594de44a4508/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_06501707-c3c4-4ac2-b8eb-594de44a4508/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 -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2024-11-09 00:31:06,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:31:07,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:31:07,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:31:07,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:31:07,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:31:07,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/loops/eureka_05.i Unable to find full path for "g++" [2024-11-09 00:31:09,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:31:09,281 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:31:09,281 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/sv-benchmarks/c/loops/eureka_05.i [2024-11-09 00:31:09,292 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/bin/ukojak-verify-ImItNfHLgk/data/0483da952/678bfb9df5514e5dbeac7960546ce223/FLAGf74a12b30 [2024-11-09 00:31:09,306 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/bin/ukojak-verify-ImItNfHLgk/data/0483da952/678bfb9df5514e5dbeac7960546ce223 [2024-11-09 00:31:09,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:31:09,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:31:09,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:09,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:31:09,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:31:09,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4329d089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09, skipping insertion in model container [2024-11-09 00:31:09,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:31:09,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:09,567 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:31:09,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:09,608 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:31:09,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09 WrapperNode [2024-11-09 00:31:09,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:09,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:09,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:31:09,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:31:09,618 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:31:09" (1/1) ... [2024-11-09 00:31:09,626 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:31:09" (1/1) ... [2024-11-09 00:31:09,647 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2024-11-09 00:31:09,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:09,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:31:09,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:31:09,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:31:09,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:31:09,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:31:09,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:31:09,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:31:09,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:09" (1/1) ... [2024-11-09 00:31:09,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:31:09,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:31:09,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/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:31:09,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/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:31:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:31:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:31:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 00:31:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 00:31:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:31:09,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:31:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 00:31:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 00:31:09,813 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:31:09,815 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:31:10,005 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-09 00:31:10,005 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:31:10,106 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:31:10,107 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 00:31:10,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:10 BoogieIcfgContainer [2024-11-09 00:31:10,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:31:10,110 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:31:10,110 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:31:10,119 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:31:10,120 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:10" (1/1) ... [2024-11-09 00:31:10,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 34 states and 41 transitions. [2024-11-09 00:31:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-09 00:31:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:31:10,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:10,392 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:31:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 37 states and 45 transitions. [2024-11-09 00:31:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-11-09 00:31:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 00:31:10,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:10,560 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:31:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 36 states and 43 transitions. [2024-11-09 00:31:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-09 00:31:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 00:31:10,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:10,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:31:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 35 states and 41 transitions. [2024-11-09 00:31:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-09 00:31:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:31:11,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:11,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:31:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 38 states and 47 transitions. [2024-11-09 00:31:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-11-09 00:31:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:31:11,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:31:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 39 states and 48 transitions. [2024-11-09 00:31:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-11-09 00:31:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:31:11,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:11,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:31:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 43 states and 55 transitions. [2024-11-09 00:31:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-09 00:31:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:31:12,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:12,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:31:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 43 states and 54 transitions. [2024-11-09 00:31:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2024-11-09 00:31:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:31:12,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:31:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 45 states and 56 transitions. [2024-11-09 00:31:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2024-11-09 00:31:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:31:12,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:12,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:31:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 42 states and 51 transitions. [2024-11-09 00:31:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-09 00:31:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:31:13,005 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:13,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:31:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 46 states and 55 transitions. [2024-11-09 00:31:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-09 00:31:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:31:13,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:31:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 50 states and 59 transitions. [2024-11-09 00:31:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-11-09 00:31:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 00:31:14,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:31:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 54 states and 62 transitions. [2024-11-09 00:31:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-11-09 00:31:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 00:31:15,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:15,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 57 states and 69 transitions. [2024-11-09 00:31:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2024-11-09 00:31:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 00:31:15,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:15,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 60 states and 77 transitions. [2024-11-09 00:31:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2024-11-09 00:31:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:31:16,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:16,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 60 states and 75 transitions. [2024-11-09 00:31:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-11-09 00:31:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:31:16,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:16,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 64 states and 83 transitions. [2024-11-09 00:31:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-09 00:31:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:31:17,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:17,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 65 states and 84 transitions. [2024-11-09 00:31:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2024-11-09 00:31:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 00:31:17,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:17,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 66 states and 85 transitions. [2024-11-09 00:31:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2024-11-09 00:31:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 00:31:17,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:17,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:31:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 69 states and 87 transitions. [2024-11-09 00:31:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2024-11-09 00:31:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 00:31:18,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:18,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 72 states and 93 transitions. [2024-11-09 00:31:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2024-11-09 00:31:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:31:18,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 76 states and 100 transitions. [2024-11-09 00:31:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2024-11-09 00:31:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:31:20,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 80 states and 106 transitions. [2024-11-09 00:31:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2024-11-09 00:31:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 00:31:20,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:20,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:31:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 83 states and 110 transitions. [2024-11-09 00:31:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2024-11-09 00:31:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:31:20,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:20,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:31:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 84 states and 111 transitions. [2024-11-09 00:31:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2024-11-09 00:31:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:31:21,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 00:31:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 87 states and 113 transitions. [2024-11-09 00:31:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2024-11-09 00:31:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:31:21,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 91 states and 118 transitions. [2024-11-09 00:31:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2024-11-09 00:31:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:31:22,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 95 states and 125 transitions. [2024-11-09 00:31:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-11-09 00:31:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 00:31:23,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:23,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 00:31:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 98 states and 127 transitions. [2024-11-09 00:31:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2024-11-09 00:31:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 00:31:24,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 102 states and 131 transitions. [2024-11-09 00:31:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2024-11-09 00:31:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 00:31:25,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 106 states and 138 transitions. [2024-11-09 00:31:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2024-11-09 00:31:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 00:31:27,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:31:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 109 states and 140 transitions. [2024-11-09 00:31:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2024-11-09 00:31:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 00:31:27,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:27,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 113 states and 144 transitions. [2024-11-09 00:31:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2024-11-09 00:31:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 00:31:29,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 134 states and 167 transitions. [2024-11-09 00:31:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2024-11-09 00:31:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 00:31:43,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-09 00:31:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 137 states and 182 transitions. [2024-11-09 00:31:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-09 00:31:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 00:31:45,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:45,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 00:31:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 141 states and 185 transitions. [2024-11-09 00:31:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 185 transitions. [2024-11-09 00:31:47,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 00:31:47,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:47,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:31:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 142 states and 185 transitions. [2024-11-09 00:31:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2024-11-09 00:31:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:31:48,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:31:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 143 states and 186 transitions. [2024-11-09 00:31:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2024-11-09 00:31:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:31:48,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:48,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-09 00:31:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 147 states and 196 transitions. [2024-11-09 00:31:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 196 transitions. [2024-11-09 00:31:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 00:31:51,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 00:31:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 152 states and 202 transitions. [2024-11-09 00:31:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 202 transitions. [2024-11-09 00:31:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 00:31:53,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-09 00:31:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 152 states and 201 transitions. [2024-11-09 00:31:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 201 transitions. [2024-11-09 00:31:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 00:31:54,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-09 00:31:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 155 states and 203 transitions. [2024-11-09 00:31:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2024-11-09 00:31:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 00:31:55,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-09 00:31:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 158 states and 205 transitions. [2024-11-09 00:31:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2024-11-09 00:31:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 00:31:56,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 00:31:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 157 states and 204 transitions. [2024-11-09 00:31:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2024-11-09 00:31:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 00:31:57,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:57,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 00:31:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 160 states and 206 transitions. [2024-11-09 00:31:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 206 transitions. [2024-11-09 00:31:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 00:31:58,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:31:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:31:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 161 states and 209 transitions. [2024-11-09 00:31:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 209 transitions. [2024-11-09 00:31:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 00:31:59,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:31:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 00:32:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 165 states and 213 transitions. [2024-11-09 00:32:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 213 transitions. [2024-11-09 00:32:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 00:32:01,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-09 00:32:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 181 states and 238 transitions. [2024-11-09 00:32:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 238 transitions. [2024-11-09 00:32:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 00:32:07,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 00:32:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 184 states and 240 transitions. [2024-11-09 00:32:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 240 transitions. [2024-11-09 00:32:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 00:32:09,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:32:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 188 states and 247 transitions. [2024-11-09 00:32:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 247 transitions. [2024-11-09 00:32:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:32:10,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:32:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 189 states and 250 transitions. [2024-11-09 00:32:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 250 transitions. [2024-11-09 00:32:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:32:11,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 00:32:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 193 states and 254 transitions. [2024-11-09 00:32:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 254 transitions. [2024-11-09 00:32:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 00:32:14,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:32:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 197 states and 261 transitions. [2024-11-09 00:32:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 261 transitions. [2024-11-09 00:32:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 00:32:17,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:17,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 00:32:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 200 states and 263 transitions. [2024-11-09 00:32:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 263 transitions. [2024-11-09 00:32:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 00:32:18,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:32:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 204 states and 268 transitions. [2024-11-09 00:32:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 268 transitions. [2024-11-09 00:32:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:32:21,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:21,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:32:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 217 states and 287 transitions. [2024-11-09 00:32:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 287 transitions. [2024-11-09 00:32:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:32:30,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:30,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 00:32:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 221 states and 291 transitions. [2024-11-09 00:32:32,888 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 291 transitions. [2024-11-09 00:32:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 00:32:32,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:32,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 31 proven. 49 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:32:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 225 states and 296 transitions. [2024-11-09 00:32:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 296 transitions. [2024-11-09 00:32:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 00:32:36,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 31 proven. 49 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:32:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 229 states and 300 transitions. [2024-11-09 00:32:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2024-11-09 00:32:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 00:32:38,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:38,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 31 proven. 49 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:32:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 233 states and 304 transitions. [2024-11-09 00:32:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 304 transitions. [2024-11-09 00:32:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:32:41,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 00:32:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 234 states and 306 transitions. [2024-11-09 00:32:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 306 transitions. [2024-11-09 00:32:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:32:42,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:42,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 66 proven. 60 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 00:32:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 237 states and 308 transitions. [2024-11-09 00:32:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 308 transitions. [2024-11-09 00:32:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 00:32:44,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 4 proven. 90 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:32:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:32:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 253 states and 332 transitions. [2024-11-09 00:32:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 332 transitions. [2024-11-09 00:32:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 00:32:54,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:32:54,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 4 proven. 90 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:33:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 265 states and 348 transitions. [2024-11-09 00:33:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 348 transitions. [2024-11-09 00:33:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 00:33:02,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 4 proven. 90 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:33:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 273 states and 355 transitions. [2024-11-09 00:33:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 355 transitions. [2024-11-09 00:33:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 00:33:07,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 4 proven. 90 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:33:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 277 states and 358 transitions. [2024-11-09 00:33:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 358 transitions. [2024-11-09 00:33:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:33:10,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:10,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:33:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 297 states and 389 transitions. [2024-11-09 00:33:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 389 transitions. [2024-11-09 00:33:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:33:23,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:33:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 309 states and 402 transitions. [2024-11-09 00:33:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 402 transitions. [2024-11-09 00:33:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:33:30,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:30,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:33:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 317 states and 412 transitions. [2024-11-09 00:33:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 412 transitions. [2024-11-09 00:33:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:33:36,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:36,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:33:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 321 states and 415 transitions. [2024-11-09 00:33:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 415 transitions. [2024-11-09 00:33:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 00:33:39,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 00:33:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 327 states and 421 transitions. [2024-11-09 00:33:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 421 transitions. [2024-11-09 00:33:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 00:33:45,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-09 00:33:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 327 states and 420 transitions. [2024-11-09 00:33:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 420 transitions. [2024-11-09 00:33:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:33:46,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:46,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 49 proven. 80 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:33:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 330 states and 422 transitions. [2024-11-09 00:33:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 422 transitions. [2024-11-09 00:33:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:33:48,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 37 proven. 136 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:33:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:33:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 333 states and 424 transitions. [2024-11-09 00:33:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 424 transitions. [2024-11-09 00:33:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 00:33:50,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:33:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:33:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 00:34:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 349 states and 449 transitions. [2024-11-09 00:34:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 449 transitions. [2024-11-09 00:34:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 00:34:02,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:02,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:34:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 354 states and 455 transitions. [2024-11-09 00:34:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 455 transitions. [2024-11-09 00:34:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 00:34:08,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:08,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-09 00:34:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 354 states and 454 transitions. [2024-11-09 00:34:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 454 transitions. [2024-11-09 00:34:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 00:34:09,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 76 proven. 164 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 00:34:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 357 states and 456 transitions. [2024-11-09 00:34:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 456 transitions. [2024-11-09 00:34:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:34:12,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 65 proven. 170 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 00:34:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 360 states and 458 transitions. [2024-11-09 00:34:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 458 transitions. [2024-11-09 00:34:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 00:34:13,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:13,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 122 proven. 156 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-09 00:34:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 112 states and 116 transitions. [2024-11-09 00:34:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2024-11-09 00:34:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 00:34:17,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-09 00:34:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 117 states and 120 transitions. [2024-11-09 00:34:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2024-11-09 00:34:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 00:34:25,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-09 00:34:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 117 states and 119 transitions. [2024-11-09 00:34:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2024-11-09 00:34:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 00:34:26,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:26,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-09 00:34:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 120 states and 123 transitions. [2024-11-09 00:34:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2024-11-09 00:34:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 00:34:28,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-09 00:34:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 119 states and 121 transitions. [2024-11-09 00:34:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2024-11-09 00:34:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 00:34:31,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:34:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:34:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-09 00:34:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:34:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2024-11-09 00:34:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2024-11-09 00:34:33,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:34:33,535 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 85 iterations. [2024-11-09 00:34:33,543 INFO L729 CodeCheckObserver]: All specifications hold 10 specifications checked. All of them hold [2024-11-09 00:34:44,609 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2024-11-09 00:34:44,610 INFO L77 FloydHoareUtils]: At program point L44-1(lines 44 45) the Hoare annotation is: (let ((.cse0 (<= 5 ~n~0)) (.cse1 (<= ~n~0 5))) (or (and (<= 4 |ULTIMATE.start_main_~i~1#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~i~1#1| 4)) (and (<= 0 |ULTIMATE.start_main_~i~1#1|) .cse0 (< |ULTIMATE.start_main_~i~1#1| 1) .cse1) (and (< |ULTIMATE.start_main_~i~1#1| 4) .cse0 .cse1 (<= 3 |ULTIMATE.start_main_~i~1#1|)) (and .cse0 (< |ULTIMATE.start_main_~i~1#1| 2) (<= 1 |ULTIMATE.start_main_~i~1#1|) .cse1) (and (<= 2 |ULTIMATE.start_main_~i~1#1|) .cse0 (< |ULTIMATE.start_main_~i~1#1| 3) .cse1))) [2024-11-09 00:34:44,610 INFO L77 FloydHoareUtils]: At program point L44-3(line 44) the Hoare annotation is: (let ((.cse0 (<= 5 ~n~0)) (.cse1 (<= ~n~0 5))) (or (and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (< |ULTIMATE.start_main_#t~post7#1| 1) .cse0 .cse1) (and (<= 3 |ULTIMATE.start_main_#t~post7#1|) (< |ULTIMATE.start_main_#t~post7#1| 4) .cse0 .cse1) (and (< |ULTIMATE.start_main_#t~post7#1| 3) .cse0 (<= 2 |ULTIMATE.start_main_#t~post7#1|) .cse1) (and .cse0 (< |ULTIMATE.start_main_#t~post7#1| 2) .cse1 (<= 1 |ULTIMATE.start_main_#t~post7#1|)) (and (<= 4 |ULTIMATE.start_main_#t~post7#1|) .cse0 (<= |ULTIMATE.start_main_#t~post7#1| 4) .cse1))) [2024-11-09 00:34:44,611 INFO L77 FloydHoareUtils]: At program point L44-4(line 44) the Hoare annotation is: (and (<= 5 ~n~0) (<= |ULTIMATE.start_main_#t~post7#1| 4) (<= ~n~0 5)) [2024-11-09 00:34:44,611 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-09 00:34:44,611 INFO L77 FloydHoareUtils]: At program point L44-5(lines 44 45) the Hoare annotation is: (and (<= 5 ~n~0) (<= ~n~0 5) (<= |ULTIMATE.start_main_~i~1#1| 4)) [2024-11-09 00:34:44,611 INFO L77 FloydHoareUtils]: At program point L44-6(lines 44 45) the Hoare annotation is: (and (<= 5 ~n~0) (<= ~n~0 5)) [2024-11-09 00:34:44,611 INFO L77 FloydHoareUtils]: At program point L32(line 32) the Hoare annotation is: (let ((.cse1 (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse0 (<= ~n~0 5))) (or (and (<= 5 ~n~0) .cse0 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (and (< ~n~0 .cse1) (< 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 4)) (and (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse0 (<= .cse1 ~n~0)) (and (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse0) (and (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse0))) [2024-11-09 00:34:44,611 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2024-11-09 00:34:44,612 INFO L77 FloydHoareUtils]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse1 (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse0 (<= ~n~0 5))) (or (and (<= 5 ~n~0) .cse0 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (and (< ~n~0 .cse1) (< 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 4)) (and (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse0 (<= .cse1 ~n~0)) (and (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse0) (and (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse0))) [2024-11-09 00:34:44,612 INFO L77 FloydHoareUtils]: At program point L32-3(lines 32 33) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 2)) (.cse18 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 3)) (.cse19 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 1))) (let ((.cse4 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 1)) (.cse5 (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse11 (< .cse19 ~n~0)) (.cse2 (<= ~n~0 .cse19)) (.cse8 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 2)) (.cse6 (< |ULTIMATE.start_SelectionSort_~i~0#1| ~n~0)) (.cse9 (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse3 (<= |ULTIMATE.start_SelectionSort_~i~0#1| 4)) (.cse7 (< 3 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse14 (<= |ULTIMATE.start_SelectionSort_~i~0#1| 2)) (.cse16 (< 1 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse17 (<= ~n~0 .cse18)) (.cse10 (< 2 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse12 (<= ~n~0 .cse15)) (.cse1 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (.cse13 (<= |ULTIMATE.start_SelectionSort_~i~0#1| 3))) (or (let ((.cse0 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 4))) (and (<= ~n~0 .cse0) (<= .cse0 ~n~0) (<= |ULTIMATE.start_SelectionSort_~i~0#1| 1) (<= 1 |ULTIMATE.start_SelectionSort_~i~0#1|) .cse1)) (and .cse2 .cse3 (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (and .cse2 .cse4 .cse5 .cse6 .cse3 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse4 .cse5 .cse14 (< .cse15 ~n~0) .cse16 .cse17) (and .cse4 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse2 .cse6 .cse3 .cse1 .cse7) (and .cse2 .cse8 .cse6 .cse9 .cse3 .cse7) (and .cse14 (<= .cse18 ~n~0) .cse16 .cse17 .cse1) (and (<= .cse15 ~n~0) .cse10 .cse12 .cse1 .cse13)))) [2024-11-09 00:34:44,612 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2024-11-09 00:34:44,613 INFO L77 FloydHoareUtils]: At program point L32-5(line 32) the Hoare annotation is: (let ((.cse5 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 3)) (.cse12 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 2)) (.cse16 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 1))) (let ((.cse6 (< .cse16 ~n~0)) (.cse9 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 3)) (.cse10 (< 2 |ULTIMATE.start_SelectionSort_#t~post3#1|)) (.cse11 (<= ~n~0 .cse12)) (.cse13 (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse1 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (.cse14 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 4)) (.cse15 (<= ~n~0 .cse16)) (.cse2 (<= ~n~0 .cse5)) (.cse7 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse3 (< 1 |ULTIMATE.start_SelectionSort_#t~post3#1|)) (.cse4 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 2))) (or (let ((.cse0 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 4))) (and (<= ~n~0 .cse0) (<= 1 |ULTIMATE.start_SelectionSort_#t~post3#1|) (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 1) .cse1 (<= .cse0 ~n~0))) (and .cse2 .cse3 .cse4 (<= .cse5 ~n~0) .cse1) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse9 (<= .cse12 ~n~0) .cse10 .cse1 .cse11) (and .cse6 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 2) .cse9 .cse13 .cse10 .cse11) (and .cse14 .cse13 (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse15) (and .cse14 (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse15 (<= (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (and .cse14 (<= 5 ~n~0) .cse1 .cse15) (and .cse8 .cse14 (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse15) (and .cse2 .cse7 .cse8 .cse3 (< .cse12 ~n~0) .cse4)))) [2024-11-09 00:34:44,613 INFO L77 FloydHoareUtils]: At program point L32-6(line 32) the Hoare annotation is: (let ((.cse5 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 3)) (.cse12 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 2)) (.cse16 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 1))) (let ((.cse6 (< .cse16 ~n~0)) (.cse9 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 3)) (.cse10 (< 2 |ULTIMATE.start_SelectionSort_#t~post3#1|)) (.cse11 (<= ~n~0 .cse12)) (.cse13 (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse1 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (.cse14 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 4)) (.cse15 (<= ~n~0 .cse16)) (.cse2 (<= ~n~0 .cse5)) (.cse7 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse3 (< 1 |ULTIMATE.start_SelectionSort_#t~post3#1|)) (.cse4 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 2))) (or (let ((.cse0 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 4))) (and (<= ~n~0 .cse0) (<= 1 |ULTIMATE.start_SelectionSort_#t~post3#1|) (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 1) .cse1 (<= .cse0 ~n~0))) (and .cse2 .cse3 .cse4 (<= .cse5 ~n~0) .cse1) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse9 (<= .cse12 ~n~0) .cse10 .cse1 .cse11) (and .cse6 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 2) .cse9 .cse13 .cse10 .cse11) (and .cse14 .cse13 (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse15) (and .cse14 (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse15 (<= (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (and .cse14 (<= 5 ~n~0) .cse1 .cse15) (and .cse8 .cse14 (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse15) (and .cse2 .cse7 .cse8 .cse3 (< .cse12 ~n~0) .cse4)))) [2024-11-09 00:34:44,614 INFO L77 FloydHoareUtils]: At program point L32-7(lines 32 33) the Hoare annotation is: (let ((.cse18 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 2)) (.cse21 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 3)) (.cse22 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 1))) (let ((.cse3 (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse2 (< 4 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse4 (<= ~n~0 5)) (.cse7 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse14 (< .cse22 ~n~0)) (.cse5 (<= ~n~0 .cse22)) (.cse11 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 2)) (.cse9 (< |ULTIMATE.start_SelectionSort_~i~0#1| ~n~0)) (.cse12 (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse6 (<= |ULTIMATE.start_SelectionSort_~i~0#1| 4)) (.cse10 (< 3 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse17 (<= |ULTIMATE.start_SelectionSort_~i~0#1| 2)) (.cse19 (< 1 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse20 (<= ~n~0 .cse21)) (.cse13 (< 2 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse15 (<= ~n~0 .cse18)) (.cse1 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (.cse16 (<= |ULTIMATE.start_SelectionSort_~i~0#1| 3))) (or (let ((.cse0 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 4))) (and (<= ~n~0 .cse0) (<= .cse0 ~n~0) (<= |ULTIMATE.start_SelectionSort_~i~0#1| 1) (<= 1 |ULTIMATE.start_SelectionSort_~i~0#1|) .cse1)) (and .cse2 .cse3 .cse4 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 2147483646)) (and (<= 5 ~n~0) (<= ~n~0 |ULTIMATE.start_SelectionSort_~i~0#1|) .cse4 .cse1) (and .cse5 .cse6 .cse3 (<= (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (and .cse5 .cse7 .cse8 .cse9 .cse6 .cse10) (and .cse8 .cse2 (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse4) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse7 .cse8 .cse17 (< .cse18 ~n~0) .cse19 .cse20) (and .cse12 .cse2 (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse4) (and .cse7 .cse8 .cse13 .cse14 .cse15 .cse16) (and .cse5 .cse9 .cse6 .cse1 .cse10) (and .cse5 .cse11 .cse9 .cse12 .cse6 .cse10) (and .cse17 (<= .cse21 ~n~0) .cse19 .cse20 .cse1) (and (<= .cse18 ~n~0) .cse13 .cse15 .cse1 .cse16)))) [2024-11-09 00:34:44,614 INFO L77 FloydHoareUtils]: At program point L32-8(lines 32 33) the Hoare annotation is: (let ((.cse0 (<= ~n~0 5))) (or (and (<= 5 ~n~0) .cse0 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (and (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse0 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 2147483646)) (and (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse0) (and (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse0))) [2024-11-09 00:34:44,614 INFO L77 FloydHoareUtils]: At program point L49-1(lines 49 50) the Hoare annotation is: (or (= |ULTIMATE.start_main_~i~1#1| 0) (and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= |ULTIMATE.start_main_~i~1#1| 4))) [2024-11-09 00:34:44,614 INFO L77 FloydHoareUtils]: At program point L49-3(line 49) the Hoare annotation is: (or (and (<= |ULTIMATE.start_main_#t~post9#1| 4) (<= 1 |ULTIMATE.start_main_#t~post9#1|)) (= |ULTIMATE.start_main_#t~post9#1| 0)) [2024-11-09 00:34:44,615 INFO L77 FloydHoareUtils]: At program point L49-4(line 49) the Hoare annotation is: (or (and (<= |ULTIMATE.start_main_#t~post9#1| 4) (<= 1 |ULTIMATE.start_main_#t~post9#1|)) (= |ULTIMATE.start_main_#t~post9#1| 0)) [2024-11-09 00:34:44,615 INFO L77 FloydHoareUtils]: At program point L49-5(lines 49 50) the Hoare annotation is: (<= 0 |ULTIMATE.start_main_~i~1#1|) [2024-11-09 00:34:44,615 INFO L77 FloydHoareUtils]: At program point L49-6(lines 49 50) the Hoare annotation is: true [2024-11-09 00:34:44,615 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 49) no Hoare annotation was computed. [2024-11-09 00:34:44,615 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2024-11-09 00:34:44,616 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:34:44,616 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2024-11-09 00:34:44,616 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 49) no Hoare annotation was computed. [2024-11-09 00:34:44,616 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:34:44,616 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2024-11-09 00:34:44,616 INFO L77 FloydHoareUtils]: At program point L30-1(lines 30 37) the Hoare annotation is: (let ((.cse0 (<= ~n~0 5))) (or (and (<= 5 ~n~0) .cse0 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (and (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse0 (<= (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (and (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse0) (and (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse0) (and (< |ULTIMATE.start_SelectionSort_~lh~0#1| ~n~0) (< 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse0))) [2024-11-09 00:34:44,617 INFO L77 FloydHoareUtils]: At program point L30-3(line 30) the Hoare annotation is: (let ((.cse0 (<= ~n~0 5))) (or (and (< 1 |ULTIMATE.start_SelectionSort_#t~post6#1|) .cse0 (<= (+ |ULTIMATE.start_SelectionSort_#t~post6#1| 3) ~n~0)) (and (<= (+ |ULTIMATE.start_SelectionSort_#t~post6#1| 4) ~n~0) (<= 1 |ULTIMATE.start_SelectionSort_#t~post6#1|) .cse0) (and (< 2 |ULTIMATE.start_SelectionSort_#t~post6#1|) (<= |ULTIMATE.start_SelectionSort_#t~post6#1| 2147483646) .cse0) (and (= |ULTIMATE.start_SelectionSort_#t~post6#1| 0) (<= 5 ~n~0) .cse0))) [2024-11-09 00:34:44,617 INFO L77 FloydHoareUtils]: At program point L30-4(line 30) the Hoare annotation is: (let ((.cse0 (<= ~n~0 5))) (or (and (< 1 |ULTIMATE.start_SelectionSort_#t~post6#1|) .cse0 (<= (+ |ULTIMATE.start_SelectionSort_#t~post6#1| 3) ~n~0)) (and (<= (+ |ULTIMATE.start_SelectionSort_#t~post6#1| 4) ~n~0) (<= 1 |ULTIMATE.start_SelectionSort_#t~post6#1|) .cse0) (and (< 2 |ULTIMATE.start_SelectionSort_#t~post6#1|) (<= |ULTIMATE.start_SelectionSort_#t~post6#1| 2147483646) .cse0) (and (= |ULTIMATE.start_SelectionSort_#t~post6#1| 0) (<= 5 ~n~0) .cse0))) [2024-11-09 00:34:44,617 INFO L77 FloydHoareUtils]: At program point L26(lines 26 38) the Hoare annotation is: true [2024-11-09 00:34:44,617 INFO L77 FloydHoareUtils]: At program point L30-5(lines 30 37) the Hoare annotation is: (let ((.cse0 (<= ~n~0 5))) (or (and (<= 5 ~n~0) .cse0 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (and (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse0 (<= (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (and (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse0) (and (< 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse0) (and (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse0))) [2024-11-09 00:34:44,618 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-09 00:34:44,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:34:44 ImpRootNode [2024-11-09 00:34:44,646 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:34:44,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:34:44,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:34:44,647 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:34:44,647 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:10" (3/4) ... [2024-11-09 00:34:44,650 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:34:44,660 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-09 00:34:44,660 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:34:44,660 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:34:44,661 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 00:34:44,777 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:34:44,778 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:34:44,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:34:44,779 INFO L158 Benchmark]: Toolchain (without parser) took 215465.47ms. Allocated memory was 138.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 91.6MB in the beginning and 923.7MB in the end (delta: -832.1MB). Peak memory consumption was 597.5MB. Max. memory is 16.1GB. [2024-11-09 00:34:44,779 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 102.8MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:34:44,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.29ms. Allocated memory is still 138.4MB. Free memory was 91.3MB in the beginning and 78.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:34:44,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.07ms. Allocated memory is still 138.4MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:34:44,780 INFO L158 Benchmark]: Boogie Preprocessor took 31.15ms. Allocated memory is still 138.4MB. Free memory was 77.2MB in the beginning and 75.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:34:44,780 INFO L158 Benchmark]: RCFGBuilder took 429.13ms. Allocated memory is still 138.4MB. Free memory was 75.7MB in the beginning and 108.6MB in the end (delta: -32.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-11-09 00:34:44,780 INFO L158 Benchmark]: CodeCheck took 214535.45ms. Allocated memory was 138.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 108.6MB in the beginning and 929.0MB in the end (delta: -820.3MB). Peak memory consumption was 607.3MB. Max. memory is 16.1GB. [2024-11-09 00:34:44,781 INFO L158 Benchmark]: Witness Printer took 131.98ms. Allocated memory is still 1.6GB. Free memory was 929.0MB in the beginning and 923.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:34:44,782 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 34 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 203.4s, OverallIterations: 85, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23348 SdHoareTripleChecker+Valid, 113.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20285 mSDsluCounter, 1096 SdHoareTripleChecker+Invalid, 97.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19592 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80015 IncrementalHoareTripleChecker+Invalid, 99607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19592 mSolverCounterUnsat, 1096 mSDtfsCounter, 80015 mSolverCounterSat, 1.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31649 GetRequests, 28846 SyntacticMatches, 1747 SemanticMatches, 1056 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575394 ImplicationChecksByTransitivity, 190.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 4697 NumberOfCodeBlocks, 4697 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 4613 ConstructedInterpolants, 0 QuantifiedInterpolants, 12413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 84 InterpolantComputations, 38 PerfectInterpolantSequences, 7617/10339 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: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: 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: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((5 <= n) && (n <= 5)) && (lh == 0)) || (((2 < lh) && (n <= 5)) && (((long long) 2 + lh) <= n))) || (((1 < lh) && (((long long) 3 + lh) <= n)) && (n <= 5))) || ((3 < lh) && (n <= 5))) || (((1 <= lh) && (((long long) lh + 4) <= n)) && (n <= 5))) - InvariantResult [Line: 49]: Location Invariant Derived location invariant: ((i == 0) || ((1 <= i) && (i <= 4))) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((n <= ((long long) i + 4)) && (((long long) i + 4) <= n)) && (i <= 1)) && (1 <= i)) && (lh == 0)) || ((((4 < i) && (2 < lh)) && (n <= 5)) && (lh <= 2147483646))) || ((((5 <= n) && (n <= i)) && (n <= 5)) && (lh == 0))) || ((((n <= ((long long) i + 1)) && (i <= 4)) && (2 < lh)) && (((long long) 2 + lh) <= n))) || ((((((n <= ((long long) i + 1)) && (lh <= 1)) && (1 <= lh)) && (i < n)) && (i <= 4)) && (3 < i))) || ((((1 <= lh) && (4 < i)) && (((long long) lh + 4) <= n)) && (n <= 5))) || ((((((lh <= 2) && (1 < lh)) && (2 < i)) && (((long long) i + 1) < n)) && (n <= ((long long) i + 2))) && (i <= 3))) || ((((((lh <= 1) && (1 <= lh)) && (i <= 2)) && (((long long) i + 2) < n)) && (1 < i)) && (n <= ((long long) i + 3)))) || ((((1 < lh) && (4 < i)) && (((long long) 3 + lh) <= n)) && (n <= 5))) || ((((((lh <= 1) && (1 <= lh)) && (2 < i)) && (((long long) i + 1) < n)) && (n <= ((long long) i + 2))) && (i <= 3))) || (((((n <= ((long long) i + 1)) && (i < n)) && (i <= 4)) && (lh == 0)) && (3 < i))) || ((((((n <= ((long long) i + 1)) && (lh <= 2)) && (i < n)) && (1 < lh)) && (i <= 4)) && (3 < i))) || (((((i <= 2) && (((long long) i + 3) <= n)) && (1 < i)) && (n <= ((long long) i + 3))) && (lh == 0))) || (((((((long long) i + 2) <= n) && (2 < i)) && (n <= ((long long) i + 2))) && (lh == 0)) && (i <= 3))) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (0 <= i) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((5 <= n) && (n <= 5)) && (i <= 4)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 102.8MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.29ms. Allocated memory is still 138.4MB. Free memory was 91.3MB in the beginning and 78.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.07ms. Allocated memory is still 138.4MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.15ms. Allocated memory is still 138.4MB. Free memory was 77.2MB in the beginning and 75.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 429.13ms. Allocated memory is still 138.4MB. Free memory was 75.7MB in the beginning and 108.6MB in the end (delta: -32.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * CodeCheck took 214535.45ms. Allocated memory was 138.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 108.6MB in the beginning and 929.0MB in the end (delta: -820.3MB). Peak memory consumption was 607.3MB. Max. memory is 16.1GB. * Witness Printer took 131.98ms. Allocated memory is still 1.6GB. Free memory was 929.0MB in the beginning and 923.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-09 00:34:44,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06501707-c3c4-4ac2-b8eb-594de44a4508/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