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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_false-unreach-call1_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:14:48,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:14:48,402 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:14:48,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:14:48,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:14:48,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:14:48,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:14:48,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:14:48,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:14:48,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:14:48,438 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:14:48,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:14:48,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:14:48,440 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:14:48,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:14:48,445 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:14:48,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:14:48,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:14:48,454 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:14:48,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:14:48,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:14:48,460 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:14:48,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:14:48,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:14:48,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:14:48,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:14:48,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:14:48,465 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:14:48,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:14:48,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:14:48,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:14:48,468 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:14:48,468 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:14:48,468 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:14:48,469 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:14:48,470 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:14:48,470 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 13:14:48,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:14:48,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:14:48,480 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:14:48,481 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:14:48,481 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:14:48,481 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:14:48,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:14:48,482 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:14:48,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:14:48,482 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:14:48,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:14:48,483 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:14:48,483 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:14:48,484 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:14:48,484 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:14:48,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:14:48,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:14:48,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:14:48,571 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:14:48,572 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:14:48,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_false-unreach-call1_true-termination.i_3.bpl [2018-10-15 13:14:48,573 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_false-unreach-call1_true-termination.i_3.bpl' [2018-10-15 13:14:48,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:14:48,630 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:14:48,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:14:48,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:14:48,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:14:48,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:48" (1/1) ... [2018-10-15 13:14:48,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:48" (1/1) ... [2018-10-15 13:14:48,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:48" (1/1) ... [2018-10-15 13:14:48,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:48" (1/1) ... [2018-10-15 13:14:48,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:48" (1/1) ... [2018-10-15 13:14:48,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:48" (1/1) ... [2018-10-15 13:14:48,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:48" (1/1) ... [2018-10-15 13:14:48,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:14:48,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:14:48,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:14:48,683 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:14:48,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:48" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 13:14:48,758 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:14:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:14:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:14:48,960 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:14:48,961 INFO L202 PluginConnector]: Adding new model underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:14:48 BoogieIcfgContainer [2018-10-15 13:14:48,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:14:48,962 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:14:48,962 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:14:48,963 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:14:48,967 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:14:48" (1/1) ... [2018-10-15 13:14:48,972 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:14:48,987 INFO L202 PluginConnector]: Adding new model underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:14:48 BasicIcfg [2018-10-15 13:14:48,987 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:14:48,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:14:48,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:14:48,992 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:14:48,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:48" (1/3) ... [2018-10-15 13:14:48,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe33a04 and model type underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:14:48, skipping insertion in model container [2018-10-15 13:14:48,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:14:48" (2/3) ... [2018-10-15 13:14:48,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe33a04 and model type underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:14:48, skipping insertion in model container [2018-10-15 13:14:48,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:14:48" (3/3) ... [2018-10-15 13:14:48,996 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_false-unreach-call1_true-termination.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 13:14:49,006 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:14:49,015 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:14:49,033 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:14:49,063 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:14:49,063 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:14:49,064 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:14:49,064 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:14:49,064 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:14:49,064 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:14:49,064 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:14:49,065 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:14:49,065 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:14:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-15 13:14:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 13:14:49,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:49,089 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:49,090 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:49,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:49,097 INFO L82 PathProgramCache]: Analyzing trace with hash 570541353, now seen corresponding path program 1 times [2018-10-15 13:14:49,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:49,364 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-15 13:14:49,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:14:49,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:14:49,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:14:49,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:14:49,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:14:49,397 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-15 13:14:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:49,502 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-15 13:14:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:14:49,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 13:14:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:49,516 INFO L225 Difference]: With dead ends: 18 [2018-10-15 13:14:49,517 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 13:14:49,518 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-15 13:14:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 13:14:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-10-15 13:14:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-15 13:14:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-15 13:14:49,557 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-10-15 13:14:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:49,557 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-15 13:14:49,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:14:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-15 13:14:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 13:14:49,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:49,558 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:49,559 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:49,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash 303616675, now seen corresponding path program 1 times [2018-10-15 13:14:49,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:49,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:49,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:14:49,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:14:49,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:14:49,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:14:49,739 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-10-15 13:14:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:49,895 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-15 13:14:49,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:14:49,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-15 13:14:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:49,897 INFO L225 Difference]: With dead ends: 23 [2018-10-15 13:14:49,897 INFO L226 Difference]: Without dead ends: 23 [2018-10-15 13:14:49,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:14:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-15 13:14:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-10-15 13:14:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 13:14:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 13:14:49,902 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-10-15 13:14:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:49,903 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 13:14:49,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:14:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 13:14:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 13:14:49,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:49,904 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:49,905 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:49,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1752096407, now seen corresponding path program 2 times [2018-10-15 13:14:49,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:50,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:50,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:14:50,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:14:50,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:14:50,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:14:50,272 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-10-15 13:14:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:50,575 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 13:14:50,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:14:50,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-15 13:14:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:50,579 INFO L225 Difference]: With dead ends: 28 [2018-10-15 13:14:50,579 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 13:14:50,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:14:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 13:14:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-10-15 13:14:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-15 13:14:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-15 13:14:50,585 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-10-15 13:14:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:50,586 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-15 13:14:50,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:14:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-15 13:14:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 13:14:50,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:50,587 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:50,588 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:50,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash 687414883, now seen corresponding path program 3 times [2018-10-15 13:14:50,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:50,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:50,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:14:50,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:14:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:14:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:14:50,778 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2018-10-15 13:14:51,046 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 13:14:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:51,451 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-15 13:14:51,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:14:51,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-10-15 13:14:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:51,453 INFO L225 Difference]: With dead ends: 33 [2018-10-15 13:14:51,454 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 13:14:51,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:14:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 13:14:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-15 13:14:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 13:14:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 13:14:51,460 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-10-15 13:14:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:51,460 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 13:14:51,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:14:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 13:14:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 13:14:51,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:51,462 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:51,462 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:51,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash 264908201, now seen corresponding path program 4 times [2018-10-15 13:14:51,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:51,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:51,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:14:51,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:14:51,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:14:51,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:14:51,760 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 11 states. [2018-10-15 13:14:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:52,173 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-15 13:14:52,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:14:52,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-10-15 13:14:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:52,179 INFO L225 Difference]: With dead ends: 38 [2018-10-15 13:14:52,180 INFO L226 Difference]: Without dead ends: 38 [2018-10-15 13:14:52,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:14:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-15 13:14:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-10-15 13:14:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 13:14:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-15 13:14:52,186 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-10-15 13:14:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:52,186 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-15 13:14:52,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:14:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-15 13:14:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 13:14:52,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:52,189 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:52,189 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:52,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:52,190 INFO L82 PathProgramCache]: Analyzing trace with hash -742540765, now seen corresponding path program 5 times [2018-10-15 13:14:52,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:52,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:52,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:14:52,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:14:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:14:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:14:52,469 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 13 states. [2018-10-15 13:14:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:52,920 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-15 13:14:52,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:14:52,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-10-15 13:14:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:52,928 INFO L225 Difference]: With dead ends: 43 [2018-10-15 13:14:52,928 INFO L226 Difference]: Without dead ends: 43 [2018-10-15 13:14:52,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-15 13:14:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-10-15 13:14:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 13:14:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 13:14:52,937 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-10-15 13:14:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:52,937 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 13:14:52,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:14:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 13:14:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 13:14:52,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:52,941 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:52,942 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:52,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:52,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1179707881, now seen corresponding path program 6 times [2018-10-15 13:14:52,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 13:14:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 13:14:53,043 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 13:14:53,079 INFO L202 PluginConnector]: Adding new model underapprox_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:14:53 BasicIcfg [2018-10-15 13:14:53,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 13:14:53,081 INFO L168 Benchmark]: Toolchain (without parser) took 4450.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 232.6 MB). Peak memory consumption was 232.6 MB. Max. memory is 7.1 GB. [2018-10-15 13:14:53,083 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-15 13:14:53,083 INFO L168 Benchmark]: Boogie Preprocessor took 49.99 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-15 13:14:53,084 INFO L168 Benchmark]: RCFGBuilder took 280.12 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 13:14:53,085 INFO L168 Benchmark]: IcfgTransformer took 25.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 13:14:53,086 INFO L168 Benchmark]: TraceAbstraction took 4090.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 211.5 MB). Peak memory consumption was 211.5 MB. Max. memory is 7.1 GB. [2018-10-15 13:14:53,094 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.19 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 49.99 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 280.12 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 25.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * TraceAbstraction took 4090.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 211.5 MB). Peak memory consumption was 211.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 36]: assertion can be violated assertion can be violated We found a FailurePath: [L12] havoc main_#res; [L13] havoc main_~y~0, main_#t~post0, main_~x~0; [L14] main_~x~0 := 0; VAL [main_~x~0=0] [L15] main_~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=0, main_~y~0=1] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=0, main_~x~0=0, main_~y~0=1] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=0, main_~x~0=1, main_~y~0=1] [L32] havoc main_#t~post0; VAL [main_~x~0=1, main_~y~0=1] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=1, main_~y~0=2] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=1, main_~y~0=2] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=1, main_~x~0=1, main_~y~0=2] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=1, main_~x~0=2, main_~y~0=2] [L32] havoc main_#t~post0; VAL [main_~x~0=2, main_~y~0=2] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=2, main_~y~0=4] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=2, main_~y~0=4] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=2, main_~x~0=2, main_~y~0=4] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=2, main_~x~0=3, main_~y~0=4] [L32] havoc main_#t~post0; VAL [main_~x~0=3, main_~y~0=4] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=3, main_~y~0=8] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=3, main_~y~0=8] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=3, main_~x~0=3, main_~y~0=8] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=3, main_~x~0=4, main_~y~0=8] [L32] havoc main_#t~post0; VAL [main_~x~0=4, main_~y~0=8] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=4, main_~y~0=16] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=4, main_~y~0=16] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=4, main_~x~0=4, main_~y~0=16] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=4, main_~x~0=5, main_~y~0=16] [L32] havoc main_#t~post0; VAL [main_~x~0=5, main_~y~0=16] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=5, main_~y~0=32] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=5, main_~y~0=32] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=5, main_~x~0=5, main_~y~0=32] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=5, main_~x~0=6, main_~y~0=32] [L32] havoc main_#t~post0; VAL [main_~x~0=6, main_~y~0=32] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=6, main_~y~0=64] [L22] assume !(main_~x~0 % 4294967296 < 6); VAL [main_~x~0=6, main_~y~0=64] [L23] __VERIFIER_assert_#in~cond := (if !(64 == main_~y~0 % 4294967296) then 1 else 0); VAL [__VERIFIER_assert_#in~cond=0, main_~x~0=6, main_~y~0=64] [L24] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, main_~x~0=6, main_~y~0=64] [L25] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L26] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L36] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. UNSAFE Result, 4.0s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 98 SDtfs, 27 SDslu, 445 SDs, 0 SdLazy, 582 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=6, 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, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 17059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 0/115 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox_false-unreach-call1_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_13-14-53-111.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox_false-unreach-call1_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_13-14-53-111.csv Received shutdown request...