java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/KojakBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:48:03,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:48:03,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:48:03,968 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:48:03,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:48:03,969 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:48:03,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:48:03,974 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:48:03,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:48:03,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:48:03,983 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:48:03,983 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:48:03,986 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:48:03,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:48:03,992 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:48:03,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:48:03,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:48:03,997 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:48:04,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:48:04,006 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:48:04,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:48:04,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:48:04,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:48:04,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:48:04,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:48:04,021 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:48:04,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:48:04,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:48:04,026 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:48:04,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:48:04,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:48:04,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:48:04,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:48:04,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:48:04,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:48:04,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:48:04,036 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-02 12:48:04,066 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:48:04,068 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:48:04,069 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:48:04,069 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:48:04,073 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:48:04,073 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:48:04,073 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:48:04,074 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:48:04,074 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:48:04,074 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:48:04,074 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:48:04,076 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:48:04,076 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:48:04,076 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:48:04,076 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:48:04,076 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:48:04,077 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:48:04,077 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-02 12:48:04,077 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-02 12:48:04,077 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:48:04,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:48:04,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-02 12:48:04,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:48:04,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:48:04,079 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:48:04,080 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-02 12:48:04,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:48:04,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:48:04,080 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:48:04,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:48:04,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:48:04,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:48:04,158 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:48:04,159 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:48:04,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2018-10-02 12:48:04,160 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-10-02 12:48:04,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:48:04,235 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:48:04,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:48:04,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:48:04,236 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:48:04,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:48:04" (1/1) ... [2018-10-02 12:48:04,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:48:04" (1/1) ... [2018-10-02 12:48:04,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:48:04,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:48:04,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:48:04,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:48:04,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:48:04" (1/1) ... [2018-10-02 12:48:04,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:48:04" (1/1) ... [2018-10-02 12:48:04,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:48:04" (1/1) ... [2018-10-02 12:48:04,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:48:04" (1/1) ... [2018-10-02 12:48:04,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:48:04" (1/1) ... [2018-10-02 12:48:04,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:48:04" (1/1) ... [2018-10-02 12:48:04,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:48:04" (1/1) ... [2018-10-02 12:48:04,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:48:04,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:48:04,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:48:04,319 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:48:04,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:48:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-02 12:48:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:48:04,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:48:05,753 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:48:05,754 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:05 BoogieIcfgContainer [2018-10-02 12:48:05,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:48:05,755 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-02 12:48:05,755 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-02 12:48:05,766 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-02 12:48:05,766 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:05" (1/1) ... [2018-10-02 12:48:05,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 12:48:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2018-10-02 12:48:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2018-10-02 12:48:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:48:05,820 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 17 states and 24 transitions. [2018-10-02 12:48:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2018-10-02 12:48:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 12:48:06,228 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 19 states and 26 transitions. [2018-10-02 12:48:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2018-10-02 12:48:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:48:06,727 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:06,973 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-02 12:48:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2018-10-02 12:48:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-10-02 12:48:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:48:07,459 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 26 states and 38 transitions. [2018-10-02 12:48:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2018-10-02 12:48:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:48:07,764 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:48:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2018-10-02 12:48:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-02 12:48:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:48:07,990 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:48:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 28 states and 37 transitions. [2018-10-02 12:48:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-10-02 12:48:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:48:08,280 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 31 states and 43 transitions. [2018-10-02 12:48:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-02 12:48:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:48:08,610 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 32 states and 44 transitions. [2018-10-02 12:48:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2018-10-02 12:48:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:48:08,816 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:48:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2018-10-02 12:48:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2018-10-02 12:48:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-02 12:48:09,219 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 12:48:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 36 states and 48 transitions. [2018-10-02 12:48:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2018-10-02 12:48:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 12:48:09,527 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 12:48:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 39 states and 49 transitions. [2018-10-02 12:48:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-10-02 12:48:09,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 12:48:09,985 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:11,953 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-02 12:48:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 55 states and 78 transitions. [2018-10-02 12:48:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-02 12:48:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 12:48:13,723 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 57 states and 79 transitions. [2018-10-02 12:48:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-10-02 12:48:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 12:48:14,192 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-02 12:48:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 58 states and 80 transitions. [2018-10-02 12:48:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2018-10-02 12:48:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 12:48:14,876 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-02 12:48:15,608 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-02 12:48:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 59 states and 82 transitions. [2018-10-02 12:48:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-02 12:48:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 12:48:15,970 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-02 12:48:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 60 states and 83 transitions. [2018-10-02 12:48:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2018-10-02 12:48:17,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 12:48:17,700 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-02 12:48:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 62 states and 85 transitions. [2018-10-02 12:48:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2018-10-02 12:48:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:48:17,936 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:20,127 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-02 12:48:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 91 states and 140 transitions. [2018-10-02 12:48:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2018-10-02 12:48:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:48:25,544 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 94 states and 141 transitions. [2018-10-02 12:48:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2018-10-02 12:48:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:48:26,496 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:48:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 95 states and 141 transitions. [2018-10-02 12:48:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2018-10-02 12:48:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 12:48:26,812 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-02 12:48:27,449 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-02 12:48:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 96 states and 142 transitions. [2018-10-02 12:48:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2018-10-02 12:48:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 12:48:27,736 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 12:48:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:48:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-02 12:48:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 12:48:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2018-10-02 12:48:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-02 12:48:28,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:48:28,040 WARN L420 CodeCheckObserver]: This Program is SAFE, Check terminated with 0 iterations. [2018-10-02 12:48:28,070 INFO L760 CodeCheckObserver]: 0 DeclaredPredicates, 4119 GetRequests, 3785 SyntacticMatches, 86 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30942 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=10995, Invalid=51255, Unknown=0, NotChecked=0, Total=62250 [2018-10-02 12:48:28,074 INFO L776 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-10-02 12:48:28,100 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.10 12:48:28 ImpRootNode [2018-10-02 12:48:28,100 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-02 12:48:28,101 INFO L168 Benchmark]: Toolchain (without parser) took 23868.50 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 242.2 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 314.3 MB). Peak memory consumption was 556.5 MB. Max. memory is 7.1 GB. [2018-10-02 12:48:28,103 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:48:28,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:48:28,104 INFO L168 Benchmark]: Boogie Preprocessor took 36.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:48:28,104 INFO L168 Benchmark]: RCFGBuilder took 1435.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 63.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 7.1 GB. [2018-10-02 12:48:28,105 INFO L168 Benchmark]: CodeCheck took 22345.55 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 242.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 250.8 MB). Peak memory consumption was 493.0 MB. Max. memory is 7.1 GB. [2018-10-02 12:48:28,110 INFO L336 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, 33 locations, 1 error locations. SAFE Result, 22.2s OverallTime, 23 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35258368 SDtfs, 38976486 SDslu, 66766822 SDs, 0 SdLazy, 36287410 SolverSat, 24225130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 73557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 378/558 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 333]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((((~wl_pc == 1 && (((!(~r_st == 0) && 2 == ~c1_st) && 2 <= ~e_c) || !(~wb_pc == 1))) && 0 <= ~d) && ~d <= 0) || (!(~wl_pc == 2) && !(~wl_pc == 1))) || (((((((0 <= ~t_b && ~wl_pc == 2) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((((((~r_st == 0 && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~wl_pc == 0) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) || ((((((((~r_st == 0 && 0 <= ~t_b) && ~wl_pc == 2) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || ((~r_st == 0 && ~wl_pc == 1) && !(~wl_st == 0))) || ((((((((!(~wl_pc == 2) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && !(~r_st == 0)) && !(~wl_pc == 0)) && 0 <= ~d) && 1 <= ~c2_pc) && ~d <= 0)) || ((((((((((~wl_st == 0 && 0 <= ~d) && ~c1_st == 0) && ~c <= ~c_t) && ~d <= 0) && ~wl_pc == 0) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c)) || ((((0 <= ~t_b && ~wl_st == 0) && ~wl_pc == 2) && ~t_b <= 0) && ~d == 2)) || ((((((((((~r_st == 0 && !(~wl_pc == 2)) && !(~wl_pc == 1)) && 0 <= ~t_b) && 2 <= ~data) && !(~wl_pc == 0)) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((((!(~wl_pc == 2) && ~wb_pc == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && !(~wl_pc == 0)) && 0 <= ~d) && 1 <= ~c2_pc) && ~d <= 0) || (((0 <= ~t_b && ~wl_pc == 2) && ~t_b <= 0) && ~d == 2)) || (((((((((0 <= ~d && ~c1_st == 0) && ~c <= ~c_t) && ~d <= 0) && ~wl_pc == 0) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((~wl_pc == 1 && ((((~c1_st == 2 && ~c <= ~c_t) && 2 <= ~e_c) && ~c_t <= ~c) || !(~wb_pc == 1))) && 0 <= ~d) && ~d <= 0) && !(~wl_st == 0)) || ((((((((~data == ~c_t && 0 <= ~t_b) && ~wl_pc == 2) && !(~r_st == 0)) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~c_req_up == 1) && !(~wl_st == 0))) || (((((((((!(~wl_pc == 2) && ~wb_pc == 1) && 1 <= ~c1_pc) && !(~wl_pc == 1)) && ~wl_st == 0) && !(~r_st == 0)) && !(~wl_pc == 0)) && 0 <= ~d) && 1 <= ~c2_pc) && ~d <= 0)) || ((((((((~r_st == 0 && 0 <= ~t_b) && ~wl_pc == 2) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || (((((((~wl_pc == 1 && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && !(~r_st == 0)) && 0 <= ~d) && 1 <= ~c2_pc) && ~d <= 0)) || ((((0 <= ~t_b && ~wl_st == 0) && ~wl_pc == 2) && ~t_b <= 0) && ~d == 2)) || (((((((((((~wl_st == 0 && 0 <= ~d) && ~c1_st == 0) && ~c <= ~c_t) && ~wb_st == 0) && ~d <= 0) && ~wl_pc == 0) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((~wl_pc == 1 && ((((~c1_st == 2 && ~c <= ~c_t) && 2 <= ~e_c) && ~c_t <= ~c) || !(~wb_pc == 1))) && 0 <= ~d) && ~d <= 0) && !(~wl_st == 0)) || ((((((((~data == ~c_t && 0 <= ~t_b) && ~wl_pc == 2) && !(~r_st == 0)) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~c_req_up == 1) && !(~wl_st == 0))) || (((((((((!(~wl_pc == 2) && ~wb_pc == 1) && 1 <= ~c1_pc) && !(~wl_pc == 1)) && ~wl_st == 0) && !(~r_st == 0)) && !(~wl_pc == 0)) && 0 <= ~d) && 1 <= ~c2_pc) && ~d <= 0)) || ((((((((~r_st == 0 && 0 <= ~t_b) && ~wl_pc == 2) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || (((((((~wl_pc == 1 && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && !(~r_st == 0)) && 0 <= ~d) && 1 <= ~c2_pc) && ~d <= 0)) || ((((0 <= ~t_b && ~wl_st == 0) && ~wl_pc == 2) && ~t_b <= 0) && ~d == 2)) || (((((((((((~wl_st == 0 && 0 <= ~d) && ~c1_st == 0) && ~c <= ~c_t) && ~wb_st == 0) && ~d <= 0) && ~wl_pc == 0) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((~wl_pc == 1 && ((((~c1_st == 2 && ~c <= ~c_t) && 2 <= ~e_c) && ~c_t <= ~c) || !(~wb_pc == 1))) && 0 <= ~d) && ~d <= 0) && !(~wl_st == 0)) || ((((((((~r_st == 0 && !(~wl_pc == 1)) && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || (((((((((!(~wl_pc == 1) && ~data == ~c_t) && 0 <= ~t_b) && !(~r_st == 0)) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && !(~c1_st == 0)) && ~c_req_up == 1) && !(~wl_st == 0)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((0 <= ~t_b && ~wl_pc == 2) && ~t_b <= 0) && ~d == 2) || ((((((!(~wl_pc == 2) && ~wb_pc == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 0 <= ~d) && 1 <= ~c2_pc) && ~d <= 0) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((~r_st == 0 && 0 <= ~t_b) && ~wl_pc == 2) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) || ((((((((!(~wl_pc == 2) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && !(~r_st == 0)) && !(~wl_pc == 0)) && 0 <= ~d) && 1 <= ~c2_pc) && ~d <= 0)) || (((((((((((~wl_st == 0 && 0 <= ~d) && ~c1_st == 0) && ~c <= ~c_t) && ~wb_st == 0) && ~d <= 0) && ~wl_pc == 0) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && ~d == ~t_b) && 0 <= ~d) && ~c1_st == 0) && 1 <= ~c2_pc) && ~d == ~data) && ~c2_st == 0) && ~wb_pc == 1) && !(~r_st == 0)) && ~e_f == ~wl_pc) && ~d <= 0) && !(~wl_st == 0)) || (((~r_st == 0 && ~wl_pc == 1) && !((((~c1_st == 0 && ~c <= ~c_t) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c)) && !(~wl_st == 0))) || ((((((((((~wl_pc == 1 && 0 <= ~d) && ~c1_st == 0) && ~c <= ~c_t) && ~d <= 0) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && !(~wl_st == 0))) || ((((((((~r_st == 0 && ~wl_pc == 1) && ~c1_st == 0) && ~c <= ~c_t) && !(((0 <= ~d && ~d <= 0) && ~c1_pc == 0) && ~c2_pc == 0)) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && !(~wl_st == 0))) || (((((((~r_st == 0 && !(~wl_pc == 1)) && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1435.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 63.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 7.1 GB. * CodeCheck took 22345.55 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 242.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 250.8 MB). Peak memory consumption was 493.0 MB. Max. memory is 7.1 GB. RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-02_12-48-28-131.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-02_12-48-28-131.csv Received shutdown request...