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/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005b.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:41:55,934 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:41:55,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:41:55,947 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:41:55,948 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:41:55,950 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:41:55,951 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:41:55,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:41:55,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:41:55,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:41:55,956 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:41:55,957 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:41:55,958 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:41:55,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:41:55,960 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:41:55,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:41:55,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:41:55,967 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:41:55,971 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:41:55,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:41:55,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:41:55,980 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:41:55,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:41:55,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:41:55,984 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:41:55,987 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:41:55,988 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:41:55,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:41:55,989 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:41:55,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:41:55,992 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:41:55,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:41:55,993 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:41:55,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:41:55,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:41:55,995 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:41:55,995 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:41:56,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:41:56,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:41:56,020 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:41:56,020 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:41:56,020 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:41:56,021 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:41:56,021 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:41:56,021 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:41:56,021 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:41:56,021 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:41:56,022 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:41:56,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:41:56,022 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:41:56,022 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:41:56,022 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:41:56,023 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:41:56,023 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:41:56,023 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:41:56,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:41:56,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:41:56,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:41:56,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:41:56,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:41:56,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:41:56,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:41:56,024 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:41:56,025 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:41:56,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:41:56,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:41:56,025 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:41:56,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:41:56,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:41:56,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:41:56,085 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:41:56,086 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:41:56,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005b.c.i_4.bpl [2018-10-02 11:41:56,087 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005b.c.i_4.bpl' [2018-10-02 11:41:56,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:41:56,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:41:56,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:41:56,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:41:56,143 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:41:56,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (1/1) ... [2018-10-02 11:41:56,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (1/1) ... [2018-10-02 11:41:56,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:41:56,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:41:56,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:41:56,183 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:41:56,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (1/1) ... [2018-10-02 11:41:56,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (1/1) ... [2018-10-02 11:41:56,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (1/1) ... [2018-10-02 11:41:56,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (1/1) ... [2018-10-02 11:41:56,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (1/1) ... [2018-10-02 11:41:56,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (1/1) ... [2018-10-02 11:41:56,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (1/1) ... [2018-10-02 11:41:56,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:41:56,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:41:56,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:41:56,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:41:56,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (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:2000 (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:2000 [2018-10-02 11:41:56,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:41:56,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:41:56,530 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:41:56,531 INFO L202 PluginConnector]: Adding new model cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:41:56 BoogieIcfgContainer [2018-10-02 11:41:56,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:41:56,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:41:56,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:41:56,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:41:56,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:41:56" (1/2) ... [2018-10-02 11:41:56,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d41d83 and model type cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:41:56, skipping insertion in model container [2018-10-02 11:41:56,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:41:56" (2/2) ... [2018-10-02 11:41:56,539 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005b.c.i_4.bpl [2018-10-02 11:41:56,549 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:41:56,557 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:41:56,607 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:41:56,607 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:41:56,607 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:41:56,608 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:41:56,608 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:41:56,608 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:41:56,608 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:41:56,608 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:41:56,609 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:41:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-02 11:41:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 11:41:56,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:41:56,630 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-02 11:41:56,631 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:41:56,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:41:56,637 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-02 11:41:56,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:41:56,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:41:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:41:56,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:41:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:41:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:41:56,804 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 11:41:56,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:41:56,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:41:56,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:41:56,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:41:56,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:41:56,830 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-02 11:41:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:41:56,882 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2018-10-02 11:41:56,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:41:56,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-02 11:41:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:41:56,896 INFO L225 Difference]: With dead ends: 15 [2018-10-02 11:41:56,896 INFO L226 Difference]: Without dead ends: 9 [2018-10-02 11:41:56,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:41:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-02 11:41:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-02 11:41:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-02 11:41:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-10-02 11:41:56,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-10-02 11:41:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:41:56,938 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-10-02 11:41:56,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:41:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-02 11:41:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:41:56,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:41:56,939 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:41:56,939 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:41:56,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:41:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash 209100445, now seen corresponding path program 1 times [2018-10-02 11:41:56,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:41:56,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:41:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:41:56,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:41:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:41:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:41:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:41:57,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:41:57,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:41:57,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:41:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:41:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:41:57,004 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2018-10-02 11:41:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:41:57,031 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-10-02 11:41:57,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:41:57,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-02 11:41:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:41:57,033 INFO L225 Difference]: With dead ends: 17 [2018-10-02 11:41:57,033 INFO L226 Difference]: Without dead ends: 11 [2018-10-02 11:41:57,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:41:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-02 11:41:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-02 11:41:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-02 11:41:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-10-02 11:41:57,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-10-02 11:41:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:41:57,038 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-02 11:41:57,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:41:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-02 11:41:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:41:57,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:41:57,039 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:41:57,040 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:41:57,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:41:57,040 INFO L82 PathProgramCache]: Analyzing trace with hash -850198025, now seen corresponding path program 1 times [2018-10-02 11:41:57,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:41:57,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:41:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:41:57,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:41:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:41:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:41:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:41:57,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:41:57,200 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-02 11:41:57,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:41:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:41:57,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:41:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:41:57,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:41:57,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-02 11:41:57,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:41:57,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:41:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:41:57,303 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-10-02 11:41:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:41:57,371 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-10-02 11:41:57,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:41:57,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-02 11:41:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:41:57,373 INFO L225 Difference]: With dead ends: 17 [2018-10-02 11:41:57,373 INFO L226 Difference]: Without dead ends: 15 [2018-10-02 11:41:57,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:41:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-02 11:41:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-02 11:41:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-02 11:41:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-10-02 11:41:57,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2018-10-02 11:41:57,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:41:57,380 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-10-02 11:41:57,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:41:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-10-02 11:41:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:41:57,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:41:57,381 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-10-02 11:41:57,382 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:41:57,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:41:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash 186575053, now seen corresponding path program 2 times [2018-10-02 11:41:57,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:41:57,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:41:57,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:41:57,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:41:57,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:41:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:41:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:41:57,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:41:57,502 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:41:57,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:41:57,535 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:41:57,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:41:57,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:41:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:41:57,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:41:57,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-02 11:41:57,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:41:57,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:41:57,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:41:57,686 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2018-10-02 11:41:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:41:58,001 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-10-02 11:41:58,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:41:58,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-10-02 11:41:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:41:58,003 INFO L225 Difference]: With dead ends: 25 [2018-10-02 11:41:58,004 INFO L226 Difference]: Without dead ends: 17 [2018-10-02 11:41:58,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:41:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-02 11:41:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-02 11:41:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-02 11:41:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-10-02 11:41:58,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2018-10-02 11:41:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:41:58,011 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-10-02 11:41:58,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:41:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-10-02 11:41:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:41:58,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:41:58,012 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1] [2018-10-02 11:41:58,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:41:58,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:41:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1490411687, now seen corresponding path program 3 times [2018-10-02 11:41:58,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:41:58,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:41:58,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:41:58,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:41:58,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:41:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:41:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-02 11:41:58,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:41:58,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:41:58,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:41:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:41:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:41:58,072 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2018-10-02 11:41:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:41:58,078 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-10-02 11:41:58,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:41:58,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 11:41:58,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:41:58,079 INFO L225 Difference]: With dead ends: 17 [2018-10-02 11:41:58,079 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:41:58,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:41:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:41:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:41:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:41:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:41:58,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-10-02 11:41:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:41:58,081 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:41:58,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:41:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:41:58,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:41:58,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:41:58,275 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 53) no Hoare annotation was computed. [2018-10-02 11:41:58,275 INFO L421 ceAbstractionStarter]: At program point L31(lines 31 36) the Hoare annotation is: false [2018-10-02 11:41:58,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 53) no Hoare annotation was computed. [2018-10-02 11:41:58,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 53) no Hoare annotation was computed. [2018-10-02 11:41:58,276 INFO L421 ceAbstractionStarter]: At program point L21(lines 21 32) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~i~4 0) (<= (+ ULTIMATE.start_main_~j~4 100) ULTIMATE.start_main_~i~4)) (= ULTIMATE.start_main_~k~4 4)) [2018-10-02 11:41:58,276 INFO L421 ceAbstractionStarter]: At program point L52(lines 35 52) the Hoare annotation is: (or (= ULTIMATE.start_main_~k~4 4) (<= ULTIMATE.start_main_~i~4 1)) [2018-10-02 11:41:58,277 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2018-10-02 11:41:58,277 INFO L421 ceAbstractionStarter]: At program point L48(lines 18 48) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~i~4 0) (<= (+ ULTIMATE.start_main_~j~4 100) ULTIMATE.start_main_~i~4)) (= ULTIMATE.start_main_~k~4 4)) [2018-10-02 11:41:58,277 INFO L421 ceAbstractionStarter]: At program point L40(lines 40 49) the Hoare annotation is: (or (= ULTIMATE.start_main_~k~4 4) (<= ULTIMATE.start_main_~i~4 1)) [2018-10-02 11:41:58,287 INFO L202 PluginConnector]: Adding new model cggmp2005b.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:41:58 BoogieIcfgContainer [2018-10-02 11:41:58,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:41:58,288 INFO L168 Benchmark]: Toolchain (without parser) took 2149.35 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: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. [2018-10-02 11:41:58,290 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 11:41:58,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.93 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 11:41:58,292 INFO L168 Benchmark]: Boogie Preprocessor took 19.97 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 11:41:58,292 INFO L168 Benchmark]: RCFGBuilder took 328.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:41:58,293 INFO L168 Benchmark]: TraceAbstraction took 1755.48 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: 76.7 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:41:58,298 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * 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 39.93 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 19.97 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 328.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1755.48 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: 76.7 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: 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: 31]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (main_~i~4 <= 0 && main_~j~4 + 100 <= main_~i~4) || main_~k~4 == 4 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (main_~i~4 <= 0 && main_~j~4 + 100 <= main_~i~4) || main_~k~4 == 4 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: main_~k~4 == 4 || main_~i~4 <= 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: main_~k~4 == 4 || main_~i~4 <= 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 1.6s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 5 SDslu, 41 SDs, 0 SdLazy, 34 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=4, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 19 NumberOfFragments, 41 HoareAnnotationTreeSize, 5 FomulaSimplifications, 72 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 1983 SizeOfPredicates, 3 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 42/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/cggmp2005b.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-41-58-317.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/cggmp2005b.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-41-58-317.csv Received shutdown request...