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-133090d [2018-10-04 10:18:59,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 10:18:59,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 10:18:59,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 10:18:59,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 10:18:59,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 10:18:59,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 10:18:59,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 10:18:59,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 10:18:59,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 10:18:59,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 10:18:59,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 10:18:59,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 10:18:59,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 10:18:59,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 10:18:59,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 10:18:59,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 10:18:59,309 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 10:18:59,310 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 10:18:59,312 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 10:18:59,313 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 10:18:59,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 10:18:59,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 10:18:59,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 10:18:59,318 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 10:18:59,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 10:18:59,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 10:18:59,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 10:18:59,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 10:18:59,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 10:18:59,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 10:18:59,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 10:18:59,324 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 10:18:59,324 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 10:18:59,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 10:18:59,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 10:18:59,326 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-04 10:18:59,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 10:18:59,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 10:18:59,343 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 10:18:59,343 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 10:18:59,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 10:18:59,344 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 10:18:59,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 10:18:59,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 10:18:59,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 10:18:59,345 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 10:18:59,345 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 10:18:59,345 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 10:18:59,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 10:18:59,346 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 10:18:59,346 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 10:18:59,346 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 10:18:59,346 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 10:18:59,346 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-04 10:18:59,347 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-04 10:18:59,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 10:18:59,347 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 10:18:59,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-04 10:18:59,347 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 10:18:59,348 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 10:18:59,348 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 10:18:59,348 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-04 10:18:59,348 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 10:18:59,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 10:18:59,349 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 10:18:59,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 10:18:59,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 10:18:59,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 10:18:59,432 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 10:18:59,433 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 10:18:59,434 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-04 10:18:59,434 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-10-04 10:18:59,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 10:18:59,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 10:18:59,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 10:18:59,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 10:18:59,527 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 10:18:59,552 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 04.10 10:18:59" (1/1) ... [2018-10-04 10:18:59,569 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 04.10 10:18:59" (1/1) ... [2018-10-04 10:18:59,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 10:18:59,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 10:18:59,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 10:18:59,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 10:18:59,592 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 04.10 10:18:59" (1/1) ... [2018-10-04 10:18:59,592 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 04.10 10:18:59" (1/1) ... [2018-10-04 10:18:59,596 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 04.10 10:18:59" (1/1) ... [2018-10-04 10:18:59,604 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 04.10 10:18:59" (1/1) ... [2018-10-04 10:18:59,621 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 04.10 10:18:59" (1/1) ... [2018-10-04 10:18:59,626 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 04.10 10:18:59" (1/1) ... [2018-10-04 10:18:59,628 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 04.10 10:18:59" (1/1) ... [2018-10-04 10:18:59,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 10:18:59,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 10:18:59,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 10:18:59,636 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 10:18:59,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:18:59" (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-04 10:18:59,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 10:18:59,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 10:19:01,084 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 10:19:01,085 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 10:19:01 BoogieIcfgContainer [2018-10-04 10:19:01,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 10:19:01,086 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-04 10:19:01,086 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-04 10:19:01,098 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-04 10:19:01,098 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 04.10 10:19:01" (1/1) ... [2018-10-04 10:19:01,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 10:19:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2018-10-04 10:19:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2018-10-04 10:19:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 10:19:01,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:01,319 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-04 10:19:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 17 states and 24 transitions. [2018-10-04 10:19:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2018-10-04 10:19:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 10:19:01,530 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:01,662 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-04 10:19:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 19 states and 26 transitions. [2018-10-04 10:19:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2018-10-04 10:19:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 10:19:01,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:02,095 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-04 10:19:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2018-10-04 10:19:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-10-04 10:19:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 10:19:02,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:02,785 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-04 10:19:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 26 states and 38 transitions. [2018-10-04 10:19:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2018-10-04 10:19:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 10:19:02,931 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:02,987 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-04 10:19:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2018-10-04 10:19:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-04 10:19:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 10:19:03,113 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:03,155 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-04 10:19:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 28 states and 37 transitions. [2018-10-04 10:19:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-10-04 10:19:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:19:03,447 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:03,604 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-04 10:19:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 31 states and 43 transitions. [2018-10-04 10:19:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-04 10:19:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:19:03,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:03,844 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-04 10:19:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 32 states and 44 transitions. [2018-10-04 10:19:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2018-10-04 10:19:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:19:04,021 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:04,317 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-04 10:19:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2018-10-04 10:19:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2018-10-04 10:19:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 10:19:04,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:04,602 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-04 10:19:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 36 states and 48 transitions. [2018-10-04 10:19:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2018-10-04 10:19:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 10:19:04,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:04,961 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-04 10:19:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 39 states and 49 transitions. [2018-10-04 10:19:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-10-04 10:19:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 10:19:05,386 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:05,835 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-04 10:19:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 55 states and 78 transitions. [2018-10-04 10:19:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-04 10:19:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 10:19:08,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:08,280 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-04 10:19:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 57 states and 79 transitions. [2018-10-04 10:19:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-10-04 10:19:08,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 10:19:08,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:08,486 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-04 10:19:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 58 states and 80 transitions. [2018-10-04 10:19:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2018-10-04 10:19:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 10:19:08,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:09,966 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-04 10:19:10,494 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-04 10:19:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 59 states and 82 transitions. [2018-10-04 10:19:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-04 10:19:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 10:19:10,852 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:11,651 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-04 10:19:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 60 states and 83 transitions. [2018-10-04 10:19:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2018-10-04 10:19:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 10:19:12,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:12,394 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-04 10:19:12,897 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-04 10:19:13,369 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-10-04 10:19:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 62 states and 85 transitions. [2018-10-04 10:19:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2018-10-04 10:19:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 10:19:13,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:14,460 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-04 10:19:15,753 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-04 10:19:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 91 states and 140 transitions. [2018-10-04 10:19:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2018-10-04 10:19:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 10:19:21,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:21,158 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-04 10:19:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 94 states and 141 transitions. [2018-10-04 10:19:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2018-10-04 10:19:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 10:19:21,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:21,972 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-04 10:19:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 95 states and 141 transitions. [2018-10-04 10:19:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2018-10-04 10:19:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 10:19:22,347 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:22,371 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-04 10:19:22,879 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-04 10:19:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 96 states and 142 transitions. [2018-10-04 10:19:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2018-10-04 10:19:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 10:19:23,162 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:19:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:19:23,716 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-04 10:19:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:19:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2018-10-04 10:19:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-04 10:19:23,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 10:19:23,900 WARN L425 CodeCheckObserver]: This Program is SAFE, Check terminated with 23 iterations. [2018-10-04 10:19:23,911 INFO L778 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-10-04 10:19:24,055 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-04 10:19:24,224 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-10-04 10:19:24,521 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-10-04 10:19:24,774 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-10-04 10:19:25,217 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-10-04 10:19:25,218 INFO L582 CodeCheckObserver]: Invariant with dag size 40 [2018-10-04 10:19:25,227 INFO L582 CodeCheckObserver]: Invariant with dag size 50 [2018-10-04 10:19:25,229 INFO L582 CodeCheckObserver]: Invariant with dag size 39 [2018-10-04 10:19:25,234 INFO L582 CodeCheckObserver]: Invariant with dag size 60 [2018-10-04 10:19:25,238 INFO L582 CodeCheckObserver]: Invariant with dag size 60 [2018-10-04 10:19:25,239 INFO L582 CodeCheckObserver]: Invariant with dag size 44 [2018-10-04 10:19:25,240 INFO L582 CodeCheckObserver]: Invariant with dag size 25 [2018-10-04 10:19:25,240 INFO L582 CodeCheckObserver]: Invariant with dag size 48 [2018-10-04 10:19:25,241 INFO L582 CodeCheckObserver]: Invariant with dag size 52 [2018-10-04 10:19:25,243 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 04.10 10:19:25 ImpRootNode [2018-10-04 10:19:25,243 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-04 10:19:25,244 INFO L168 Benchmark]: Toolchain (without parser) took 25719.27 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 227.5 MB). Free memory was 1.5 GB in the beginning and 944.4 MB in the end (delta: 526.0 MB). Peak memory consumption was 753.5 MB. Max. memory is 7.1 GB. [2018-10-04 10:19:25,246 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-04 10:19:25,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.05 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-04 10:19:25,247 INFO L168 Benchmark]: Boogie Preprocessor took 57.28 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-04 10:19:25,247 INFO L168 Benchmark]: RCFGBuilder took 1450.02 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-04 10:19:25,248 INFO L168 Benchmark]: CodeCheck took 24156.86 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 227.5 MB). Free memory was 1.4 GB in the beginning and 944.4 MB in the end (delta: 462.5 MB). Peak memory consumption was 690.1 MB. Max. memory is 7.1 GB. [2018-10-04 10:19:25,253 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.7s 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, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4117 GetRequests, 3783 SyntacticMatches, 86 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30942 ImplicationChecksByTransitivity, 19.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s 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) && ~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) - InvariantResult [Line: 187]: 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)) && !(~wl_pc == 0)) && 0 <= ~d) && 1 <= ~c2_pc) && ~d <= 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) - 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_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))) || ((((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_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))) || ((((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) && !(~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)) && 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 51.05 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 57.28 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 1450.02 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 24156.86 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 227.5 MB). Free memory was 1.4 GB in the beginning and 944.4 MB in the end (delta: 462.5 MB). Peak memory consumption was 690.1 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-04_10-19-25-272.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-04_10-19-25-272.csv Received shutdown request...