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-1cc990c [2018-10-01 02:22:52,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 02:22:52,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 02:22:52,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 02:22:52,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 02:22:52,880 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 02:22:52,881 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 02:22:52,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 02:22:52,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 02:22:52,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 02:22:52,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 02:22:52,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 02:22:52,889 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 02:22:52,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 02:22:52,891 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 02:22:52,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 02:22:52,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 02:22:52,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 02:22:52,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 02:22:52,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 02:22:52,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 02:22:52,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 02:22:52,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 02:22:52,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 02:22:52,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 02:22:52,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 02:22:52,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 02:22:52,906 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 02:22:52,907 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 02:22:52,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 02:22:52,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 02:22:52,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 02:22:52,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 02:22:52,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 02:22:52,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 02:22:52,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 02:22:52,912 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-01 02:22:52,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 02:22:52,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 02:22:52,928 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 02:22:52,929 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 02:22:52,929 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 02:22:52,929 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 02:22:52,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 02:22:52,930 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 02:22:52,930 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 02:22:52,930 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 02:22:52,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 02:22:52,932 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 02:22:52,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 02:22:52,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 02:22:52,933 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 02:22:52,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 02:22:52,933 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 02:22:52,933 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-01 02:22:52,934 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-01 02:22:52,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 02:22:52,935 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 02:22:52,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-01 02:22:52,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 02:22:52,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 02:22:52,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 02:22:52,936 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-01 02:22:52,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 02:22:52,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 02:22:52,937 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 02:22:52,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 02:22:53,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 02:22:53,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 02:22:53,017 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 02:22:53,017 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 02:22:53,018 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-01 02:22:53,019 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-10-01 02:22:53,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 02:22:53,120 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 02:22:53,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 02:22:53,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 02:22:53,122 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 02:22:53,145 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 01.10 02:22:53" (1/1) ... [2018-10-01 02:22:53,161 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 01.10 02:22:53" (1/1) ... [2018-10-01 02:22:53,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 02:22:53,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 02:22:53,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 02:22:53,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 02:22:53,184 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 01.10 02:22:53" (1/1) ... [2018-10-01 02:22:53,185 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 01.10 02:22:53" (1/1) ... [2018-10-01 02:22:53,197 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 01.10 02:22:53" (1/1) ... [2018-10-01 02:22:53,197 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 01.10 02:22:53" (1/1) ... [2018-10-01 02:22:53,214 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 01.10 02:22:53" (1/1) ... [2018-10-01 02:22:53,223 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 01.10 02:22:53" (1/1) ... [2018-10-01 02:22:53,228 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 01.10 02:22:53" (1/1) ... [2018-10-01 02:22:53,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 02:22:53,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 02:22:53,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 02:22:53,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 02:22:53,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 02:22:53" (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-01 02:22:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 02:22:53,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 02:22:54,684 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 02:22:54,684 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 02:22:54 BoogieIcfgContainer [2018-10-01 02:22:54,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 02:22:54,685 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-01 02:22:54,685 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-01 02:22:54,697 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-01 02:22:54,698 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 01.10 02:22:54" (1/1) ... [2018-10-01 02:22:54,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 02:22:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2018-10-01 02:22:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2018-10-01 02:22:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 02:22:54,757 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:54,961 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-01 02:22:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 17 states and 24 transitions. [2018-10-01 02:22:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2018-10-01 02:22:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 02:22:55,173 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:55,308 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-01 02:22:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 19 states and 26 transitions. [2018-10-01 02:22:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2018-10-01 02:22:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 02:22:55,586 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:55,693 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-01 02:22:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2018-10-01 02:22:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-10-01 02:22:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 02:22:56,189 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:56,366 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-01 02:22:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 26 states and 38 transitions. [2018-10-01 02:22:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2018-10-01 02:22:56,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 02:22:56,507 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:56,552 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-01 02:22:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2018-10-01 02:22:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-01 02:22:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 02:22:56,707 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:56,757 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-01 02:22:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 28 states and 37 transitions. [2018-10-01 02:22:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-10-01 02:22:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 02:22:57,001 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:57,243 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-01 02:22:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 31 states and 43 transitions. [2018-10-01 02:22:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-01 02:22:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 02:22:57,429 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:57,469 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-01 02:22:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 32 states and 44 transitions. [2018-10-01 02:22:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2018-10-01 02:22:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 02:22:57,620 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:57,898 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-01 02:22:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2018-10-01 02:22:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2018-10-01 02:22:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-01 02:22:58,002 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:58,175 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-01 02:22:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 36 states and 48 transitions. [2018-10-01 02:22:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2018-10-01 02:22:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-01 02:22:58,376 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:58,406 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-01 02:22:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:22:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 39 states and 49 transitions. [2018-10-01 02:22:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-10-01 02:22:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 02:22:58,688 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:22:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:22:59,360 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-01 02:23:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 55 states and 78 transitions. [2018-10-01 02:23:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-01 02:23:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 02:23:01,628 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:23:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:23:01,786 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-01 02:23:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 57 states and 79 transitions. [2018-10-01 02:23:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-10-01 02:23:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 02:23:01,993 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:23:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:23:02,039 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-01 02:23:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 58 states and 80 transitions. [2018-10-01 02:23:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2018-10-01 02:23:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 02:23:02,544 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:23:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:23:03,530 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-01 02:23:04,029 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-01 02:23:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 59 states and 82 transitions. [2018-10-01 02:23:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-01 02:23:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 02:23:04,578 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:23:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:23:05,541 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-01 02:23:06,287 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-01 02:23:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 60 states and 83 transitions. [2018-10-01 02:23:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2018-10-01 02:23:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 02:23:06,450 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:23:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:23:06,483 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-01 02:23:07,028 WARN L178 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-01 02:23:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 62 states and 85 transitions. [2018-10-01 02:23:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2018-10-01 02:23:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 02:23:07,425 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:23:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:23:08,869 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-01 02:23:10,283 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-01 02:23:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 91 states and 140 transitions. [2018-10-01 02:23:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2018-10-01 02:23:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 02:23:15,735 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:23:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:23:15,811 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-01 02:23:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 94 states and 141 transitions. [2018-10-01 02:23:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2018-10-01 02:23:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 02:23:16,734 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:23:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:23:16,807 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-01 02:23:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 95 states and 141 transitions. [2018-10-01 02:23:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2018-10-01 02:23:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 02:23:17,042 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:23:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:23:17,065 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-01 02:23:17,739 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-01 02:23:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 96 states and 142 transitions. [2018-10-01 02:23:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2018-10-01 02:23:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 02:23:18,143 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:23:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:23:18,381 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-01 02:23:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:23:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2018-10-01 02:23:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-01 02:23:18,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 02:23:18,562 WARN L420 CodeCheckObserver]: This Program is SAFE, Check terminated with 0 iterations. [2018-10-01 02:23:18,572 INFO L776 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-10-01 02:23:18,598 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.10 02:23:18 ImpRootNode [2018-10-01 02:23:18,599 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-01 02:23:18,600 INFO L168 Benchmark]: Toolchain (without parser) took 25482.24 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 226.5 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 360.0 MB). Peak memory consumption was 586.5 MB. Max. memory is 7.1 GB. [2018-10-01 02:23:18,601 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-01 02:23:18,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.33 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-01 02:23:18,602 INFO L168 Benchmark]: Boogie Preprocessor took 62.02 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-01 02:23:18,603 INFO L168 Benchmark]: RCFGBuilder took 1450.34 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.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-10-01 02:23:18,603 INFO L168 Benchmark]: CodeCheck took 23913.40 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 226.5 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 296.6 MB). Peak memory consumption was 523.1 MB. Max. memory is 7.1 GB. [2018-10-01 02:23:18,608 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, 23.8s 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, 12.9s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s 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) && ~wl_pc == 2) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) || ((((((((~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 && ~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.23 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 50.33 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 62.02 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.34 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.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * CodeCheck took 23913.40 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 226.5 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 296.6 MB). Peak memory consumption was 523.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-01_02-23-18-628.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-01_02-23-18-628.csv Received shutdown request...