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/sum04_true-unreach-call_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:14:47,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:14:47,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:14:47,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:14:47,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:14:47,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:14:47,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:14:47,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:14:47,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:14:47,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:14:47,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:14:47,904 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:14:47,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:14:47,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:14:47,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:14:47,910 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:14:47,911 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:14:47,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:14:47,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:14:47,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:14:47,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:14:47,928 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:14:47,931 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:14:47,931 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:14:47,931 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:14:47,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:14:47,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:14:47,938 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:14:47,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:14:47,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:14:47,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:14:47,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:14:47,942 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:14:47,942 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:14:47,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:14:47,944 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:14:47,944 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:47,962 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:14:47,962 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:14:47,963 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:14:47,963 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:14:47,963 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:14:47,963 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:14:47,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:14:47,964 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:14:47,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:14:47,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:14:47,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:14:47,965 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:14:47,965 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:14:47,966 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:14:47,966 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:14:48,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:14:48,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:14:48,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:14:48,049 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:14:48,050 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:14:48,051 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/sum04_true-unreach-call_true-termination.i_3.bpl [2018-10-15 13:14:48,051 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/sum04_true-unreach-call_true-termination.i_3.bpl' [2018-10-15 13:14:48,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:14:48,110 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:14:48,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:14:48,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:14:48,111 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:14:48,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04_true-unreach-call_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,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04_true-unreach-call_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,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04_true-unreach-call_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,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04_true-unreach-call_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,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04_true-unreach-call_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,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04_true-unreach-call_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,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04_true-unreach-call_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,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:14:48,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:14:48,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:14:48,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:14:48,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04_true-unreach-call_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,229 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:14:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:14:48,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:14:48,610 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:14:48,611 INFO L202 PluginConnector]: Adding new model sum04_true-unreach-call_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,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:14:48,611 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:14:48,611 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:14:48,613 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:14:48,617 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "sum04_true-unreach-call_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,622 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:14:48,638 INFO L202 PluginConnector]: Adding new model sum04_true-unreach-call_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,638 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:14:48,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:14:48,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:14:48,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:14:48,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04_true-unreach-call_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,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c60522 and model type sum04_true-unreach-call_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,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04_true-unreach-call_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,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c60522 and model type sum04_true-unreach-call_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,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04_true-unreach-call_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,647 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_true-unreach-call_true-termination.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 13:14:48,657 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:14:48,666 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:14:48,683 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:14:48,708 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:14:48,709 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:14:48,709 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:14:48,710 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:14:48,710 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:14:48,710 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:14:48,710 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:14:48,711 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:14:48,711 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:14:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-15 13:14:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 13:14:48,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:48,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:48,737 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:48,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:48,744 INFO L82 PathProgramCache]: Analyzing trace with hash -111570519, now seen corresponding path program 1 times [2018-10-15 13:14:48,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:48,910 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:48,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:14:48,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:14:48,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:14:48,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:14:48,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:14:48,950 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-15 13:14:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:49,069 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-15 13:14:49,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:14:49,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 13:14:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:49,087 INFO L225 Difference]: With dead ends: 21 [2018-10-15 13:14:49,088 INFO L226 Difference]: Without dead ends: 21 [2018-10-15 13:14:49,090 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,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-15 13:14:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-10-15 13:14:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-15 13:14:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-15 13:14:49,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2018-10-15 13:14:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:49,126 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-15 13:14:49,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:14:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-15 13:14:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-15 13:14:49,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:49,127 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:49,127 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:49,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:49,128 INFO L82 PathProgramCache]: Analyzing trace with hash -201877734, now seen corresponding path program 1 times [2018-10-15 13:14:49,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:49,228 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,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:49,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:14:49,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:14:49,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:14:49,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:14:49,231 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-10-15 13:14:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:49,432 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-15 13:14:49,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:14:49,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-10-15 13:14:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:49,434 INFO L225 Difference]: With dead ends: 26 [2018-10-15 13:14:49,434 INFO L226 Difference]: Without dead ends: 26 [2018-10-15 13:14:49,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:14:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-15 13:14:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-10-15 13:14:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 13:14:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 13:14:49,441 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2018-10-15 13:14:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:49,442 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 13:14:49,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:14:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 13:14:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 13:14:49,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:49,443 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:49,444 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:49,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash 891834441, now seen corresponding path program 2 times [2018-10-15 13:14:49,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:49,581 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:49,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:49,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:14:49,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:14:49,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:14:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:14:49,583 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2018-10-15 13:14:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:49,987 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-15 13:14:49,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:14:49,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-15 13:14:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:49,989 INFO L225 Difference]: With dead ends: 31 [2018-10-15 13:14:49,990 INFO L226 Difference]: Without dead ends: 31 [2018-10-15 13:14:49,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:14:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-15 13:14:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-10-15 13:14:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-15 13:14:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-15 13:14:49,996 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2018-10-15 13:14:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:49,996 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-15 13:14:49,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:14:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-15 13:14:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-15 13:14:49,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:49,998 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:49,998 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:49,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash 850852986, now seen corresponding path program 3 times [2018-10-15 13:14:50,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:50,286 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,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:50,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:14:50,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:14:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:14:50,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:14:50,289 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2018-10-15 13:14:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:50,454 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 13:14:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:14:50,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-10-15 13:14:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:50,455 INFO L225 Difference]: With dead ends: 36 [2018-10-15 13:14:50,456 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 13:14:50,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:14:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 13:14:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-10-15 13:14:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 13:14:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 13:14:50,461 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 27 [2018-10-15 13:14:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:50,462 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 13:14:50,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:14:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 13:14:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 13:14:50,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:50,463 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:50,464 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:50,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:50,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1393641193, now seen corresponding path program 4 times [2018-10-15 13:14:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:50,933 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:50,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:50,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:14:50,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:14:50,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:14:50,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:14:50,935 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 11 states. [2018-10-15 13:14:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:51,211 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 13:14:51,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:14:51,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-10-15 13:14:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:51,213 INFO L225 Difference]: With dead ends: 41 [2018-10-15 13:14:51,213 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 13:14:51,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:14:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 13:14:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-10-15 13:14:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 13:14:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 13:14:51,218 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-10-15 13:14:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:51,219 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 13:14:51,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:14:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 13:14:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 13:14:51,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:51,221 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:51,221 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:51,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:51,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1593780698, now seen corresponding path program 5 times [2018-10-15 13:14:51,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:51,414 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:51,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:51,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:14:51,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:14:51,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:14:51,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:14:51,416 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 13 states. [2018-10-15 13:14:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:51,782 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-15 13:14:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:14:51,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-10-15 13:14:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:51,784 INFO L225 Difference]: With dead ends: 46 [2018-10-15 13:14:51,785 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 13:14:51,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 13:14:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-10-15 13:14:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 13:14:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 13:14:51,796 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 37 [2018-10-15 13:14:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:51,797 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 13:14:51,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:14:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 13:14:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 13:14:51,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:51,798 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:51,801 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:51,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:51,802 INFO L82 PathProgramCache]: Analyzing trace with hash 28210569, now seen corresponding path program 6 times [2018-10-15 13:14:51,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:52,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:52,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:14:52,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:14:52,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:14:52,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:14:52,204 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 15 states. [2018-10-15 13:14:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:52,770 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-15 13:14:52,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:14:52,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-10-15 13:14:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:52,774 INFO L225 Difference]: With dead ends: 51 [2018-10-15 13:14:52,774 INFO L226 Difference]: Without dead ends: 51 [2018-10-15 13:14:52,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:14:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-15 13:14:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-10-15 13:14:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-15 13:14:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-15 13:14:52,780 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 42 [2018-10-15 13:14:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:52,780 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-15 13:14:52,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:14:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-15 13:14:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-15 13:14:52,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:52,782 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:52,783 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:52,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:52,783 INFO L82 PathProgramCache]: Analyzing trace with hash -629792966, now seen corresponding path program 7 times [2018-10-15 13:14:52,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:53,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:53,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:14:53,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:14:53,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:14:53,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:14:53,093 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 17 states. [2018-10-15 13:14:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:53,443 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-15 13:14:53,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:14:53,449 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-10-15 13:14:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:53,450 INFO L225 Difference]: With dead ends: 53 [2018-10-15 13:14:53,450 INFO L226 Difference]: Without dead ends: 53 [2018-10-15 13:14:53,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:14:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-15 13:14:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-15 13:14:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 13:14:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-15 13:14:53,456 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47 [2018-10-15 13:14:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:53,457 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-15 13:14:53,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:14:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-15 13:14:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 13:14:53,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:53,459 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:53,459 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:53,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:53,459 INFO L82 PathProgramCache]: Analyzing trace with hash -149300183, now seen corresponding path program 8 times [2018-10-15 13:14:53,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:53,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:53,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 13:14:53,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 13:14:53,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 13:14:53,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:14:53,764 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 14 states. [2018-10-15 13:14:54,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:54,074 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 13:14:54,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:14:54,074 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-10-15 13:14:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:54,076 INFO L225 Difference]: With dead ends: 64 [2018-10-15 13:14:54,077 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 13:14:54,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:14:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 13:14:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-15 13:14:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-15 13:14:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-15 13:14:54,082 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 52 [2018-10-15 13:14:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:54,082 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-15 13:14:54,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 13:14:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-15 13:14:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-15 13:14:54,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:54,084 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:54,084 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:54,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:54,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1354638182, now seen corresponding path program 9 times [2018-10-15 13:14:54,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:54,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:14:54,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-10-15 13:14:54,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:14:54,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:14:54,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:14:54,416 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 19 states. [2018-10-15 13:14:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:55,136 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-10-15 13:14:55,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:14:55,136 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-10-15 13:14:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:55,137 INFO L225 Difference]: With dead ends: 46 [2018-10-15 13:14:55,138 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 13:14:55,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:14:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 13:14:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 13:14:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 13:14:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 13:14:55,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-10-15 13:14:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:55,141 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 13:14:55,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:14:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 13:14:55,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 13:14:55,146 INFO L202 PluginConnector]: Adding new model sum04_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:14:55 BasicIcfg [2018-10-15 13:14:55,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 13:14:55,147 INFO L168 Benchmark]: Toolchain (without parser) took 7037.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 404.5 MB). Peak memory consumption was 404.5 MB. Max. memory is 7.1 GB. [2018-10-15 13:14:55,152 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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:55,153 INFO L168 Benchmark]: Boogie Preprocessor took 49.77 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:55,153 INFO L168 Benchmark]: RCFGBuilder took 449.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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:55,154 INFO L168 Benchmark]: IcfgTransformer took 27.16 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:55,155 INFO L168 Benchmark]: TraceAbstraction took 6506.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 383.4 MB). Peak memory consumption was 383.4 MB. Max. memory is 7.1 GB. [2018-10-15 13:14:55,159 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.23 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. * Boogie Preprocessor took 49.77 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. * RCFGBuilder took 449.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 27.16 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 6506.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 383.4 MB). Peak memory consumption was 383.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 6.4s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 176 SDtfs, 134 SDslu, 1119 SDs, 0 SdLazy, 651 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=9, 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, 10 MinimizatonAttempts, 22 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 42183 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 189/645 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/sum04_true-unreach-call_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_13-14-55-172.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum04_true-unreach-call_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_13-14-55-172.csv Received shutdown request...