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/sum01_bug02_false-unreach-call_true-termination.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:13:54,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:13:54,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:13:54,646 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:13:54,646 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:13:54,647 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:13:54,648 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:13:54,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:13:54,653 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:13:54,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:13:54,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:13:54,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:13:54,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:13:54,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:13:54,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:13:54,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:13:54,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:13:54,675 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:13:54,676 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:13:54,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:13:54,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:13:54,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:13:54,687 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:13:54,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:13:54,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:13:54,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:13:54,689 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:13:54,690 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:13:54,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:13:54,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:13:54,692 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:13:54,693 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:13:54,693 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:13:54,693 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:13:54,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:13:54,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:13:54,695 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:13:54,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:13:54,707 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:13:54,707 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:13:54,708 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:13:54,711 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:13:54,711 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:13:54,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:13:54,712 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:13:54,712 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:13:54,712 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:13:54,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:13:54,713 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:13:54,713 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:13:54,715 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:13:54,715 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:13:54,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:13:54,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:13:54,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:13:54,789 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:13:54,790 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:13:54,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/sum01_bug02_false-unreach-call_true-termination.i_4.bpl [2018-10-15 13:13:54,791 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/sum01_bug02_false-unreach-call_true-termination.i_4.bpl' [2018-10-15 13:13:54,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:13:54,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:13:54,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:13:54,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:13:54,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:13:54,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:54" (1/1) ... [2018-10-15 13:13:54,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:54" (1/1) ... [2018-10-15 13:13:54,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:54" (1/1) ... [2018-10-15 13:13:54,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:54" (1/1) ... [2018-10-15 13:13:54,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:54" (1/1) ... [2018-10-15 13:13:54,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:54" (1/1) ... [2018-10-15 13:13:54,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:54" (1/1) ... [2018-10-15 13:13:54,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:13:54,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:13:54,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:13:54,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:13:54,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:54" (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:13:54,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:13:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:13:54,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:13:55,339 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:13:55,340 INFO L202 PluginConnector]: Adding new model sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:55 BoogieIcfgContainer [2018-10-15 13:13:55,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:13:55,341 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:13:55,341 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:13:55,342 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:13:55,346 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:55" (1/1) ... [2018-10-15 13:13:55,352 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:13:55,370 INFO L202 PluginConnector]: Adding new model sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:13:55 BasicIcfg [2018-10-15 13:13:55,371 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:13:55,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:13:55,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:13:55,376 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:13:55,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:54" (1/3) ... [2018-10-15 13:13:55,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4582a5 and model type sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:13:55, skipping insertion in model container [2018-10-15 13:13:55,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:55" (2/3) ... [2018-10-15 13:13:55,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4582a5 and model type sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:13:55, skipping insertion in model container [2018-10-15 13:13:55,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:13:55" (3/3) ... [2018-10-15 13:13:55,381 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_false-unreach-call_true-termination.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 13:13:55,392 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:13:55,403 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:13:55,437 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:13:55,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:13:55,473 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:13:55,473 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:13:55,474 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:13:55,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:13:55,474 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:13:55,474 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:13:55,475 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:13:55,475 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:13:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-10-15 13:13:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 13:13:55,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:55,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:55,512 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:55,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash 422035761, now seen corresponding path program 1 times [2018-10-15 13:13:55,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:55,817 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:13:55,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:13:55,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-15 13:13:55,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 13:13:55,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 13:13:55,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:13:55,843 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 6 states. [2018-10-15 13:13:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:56,020 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-10-15 13:13:56,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 13:13:56,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-10-15 13:13:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:56,033 INFO L225 Difference]: With dead ends: 38 [2018-10-15 13:13:56,033 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 13:13:56,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:13:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 13:13:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-10-15 13:13:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-15 13:13:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-15 13:13:56,073 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-10-15 13:13:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:56,073 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-15 13:13:56,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 13:13:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-10-15 13:13:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 13:13:56,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:56,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:56,075 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:56,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2097951677, now seen corresponding path program 1 times [2018-10-15 13:13:56,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:56,573 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-10-15 13:13:56,863 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-10-15 13:13:57,095 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:13:57,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:57,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:13:57,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:13:57,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:13:57,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:13:57,099 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 11 states. [2018-10-15 13:13:57,664 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-15 13:13:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:57,841 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-10-15 13:13:57,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:13:57,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-10-15 13:13:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:57,847 INFO L225 Difference]: With dead ends: 60 [2018-10-15 13:13:57,847 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 13:13:57,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:13:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 13:13:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-10-15 13:13:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 13:13:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-10-15 13:13:57,860 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 24 [2018-10-15 13:13:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:57,860 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-10-15 13:13:57,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:13:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-10-15 13:13:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 13:13:57,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:57,862 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:57,862 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:57,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:57,863 INFO L82 PathProgramCache]: Analyzing trace with hash -277168613, now seen corresponding path program 1 times [2018-10-15 13:13:57,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:57,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:57,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 13:13:57,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 13:13:57,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 13:13:57,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:13:57,991 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2018-10-15 13:13:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:58,230 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-10-15 13:13:58,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:13:58,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-15 13:13:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:58,231 INFO L225 Difference]: With dead ends: 38 [2018-10-15 13:13:58,231 INFO L226 Difference]: Without dead ends: 38 [2018-10-15 13:13:58,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:13:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-15 13:13:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-10-15 13:13:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 13:13:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-10-15 13:13:58,238 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-10-15 13:13:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:58,239 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-10-15 13:13:58,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 13:13:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-10-15 13:13:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-15 13:13:58,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:58,240 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:58,241 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:58,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1280436879, now seen corresponding path program 2 times [2018-10-15 13:13:58,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-15 13:13:58,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:58,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 13:13:58,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 13:13:58,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 13:13:58,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:13:58,771 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2018-10-15 13:13:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:59,282 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-10-15 13:13:59,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:13:59,284 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-10-15 13:13:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:59,285 INFO L225 Difference]: With dead ends: 54 [2018-10-15 13:13:59,285 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 13:13:59,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:13:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 13:13:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-10-15 13:13:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-15 13:13:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-10-15 13:13:59,292 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 33 [2018-10-15 13:13:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:59,293 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-10-15 13:13:59,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 13:13:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-10-15 13:13:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-15 13:13:59,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:59,295 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:59,295 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:59,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash -299370167, now seen corresponding path program 2 times [2018-10-15 13:13:59,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:59,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:59,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:13:59,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:13:59,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:13:59,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:13:59,487 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2018-10-15 13:13:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:59,905 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-10-15 13:13:59,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 13:13:59,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-10-15 13:13:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:59,908 INFO L225 Difference]: With dead ends: 56 [2018-10-15 13:13:59,909 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 13:13:59,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:13:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 13:13:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-10-15 13:13:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 13:13:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-10-15 13:13:59,921 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 41 [2018-10-15 13:13:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:59,922 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-10-15 13:13:59,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:13:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-10-15 13:13:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 13:13:59,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:59,925 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:59,925 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:59,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:59,931 INFO L82 PathProgramCache]: Analyzing trace with hash -195071525, now seen corresponding path program 3 times [2018-10-15 13:13:59,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:00,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 13:14:00,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 13:14:00,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 13:14:00,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:14:00,417 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 16 states. [2018-10-15 13:14:00,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:00,757 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-10-15 13:14:00,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 13:14:00,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-10-15 13:14:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:00,759 INFO L225 Difference]: With dead ends: 65 [2018-10-15 13:14:00,760 INFO L226 Difference]: Without dead ends: 65 [2018-10-15 13:14:00,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:14:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-15 13:14:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-10-15 13:14:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-15 13:14:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-10-15 13:14:00,768 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 50 [2018-10-15 13:14:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:00,769 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-10-15 13:14:00,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 13:14:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-10-15 13:14:00,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 13:14:00,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:00,771 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:00,771 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:00,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:00,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1158578807, now seen corresponding path program 4 times [2018-10-15 13:14:00,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:01,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:01,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 13:14:01,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 13:14:01,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 13:14:01,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:14:01,070 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 20 states. [2018-10-15 13:14:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:01,591 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-10-15 13:14:01,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 13:14:01,596 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-10-15 13:14:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:01,597 INFO L225 Difference]: With dead ends: 73 [2018-10-15 13:14:01,597 INFO L226 Difference]: Without dead ends: 73 [2018-10-15 13:14:01,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:14:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-15 13:14:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-10-15 13:14:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 13:14:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-10-15 13:14:01,604 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 59 [2018-10-15 13:14:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:01,605 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-10-15 13:14:01,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 13:14:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-10-15 13:14:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 13:14:01,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:01,607 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:01,607 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:01,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:01,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1785116059, now seen corresponding path program 5 times [2018-10-15 13:14:01,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 13:14:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 13:14:01,670 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 13:14:01,701 INFO L202 PluginConnector]: Adding new model sum01_bug02_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:14:01 BasicIcfg [2018-10-15 13:14:01,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 13:14:01,702 INFO L168 Benchmark]: Toolchain (without parser) took 6864.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 436.2 MB). Peak memory consumption was 436.2 MB. Max. memory is 7.1 GB. [2018-10-15 13:14:01,703 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:01,704 INFO L168 Benchmark]: Boogie Preprocessor took 49.16 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:01,705 INFO L168 Benchmark]: RCFGBuilder took 450.69 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:01,705 INFO L168 Benchmark]: IcfgTransformer took 30.32 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:01,706 INFO L168 Benchmark]: TraceAbstraction took 6328.61 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: 415.1 MB). Peak memory consumption was 415.1 MB. Max. memory is 7.1 GB. [2018-10-15 13:14:01,710 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.20 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.16 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 450.69 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 30.32 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 6328.61 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: 415.1 MB). Peak memory consumption was 415.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 41]: assertion can be violated assertion can be violated We found a FailurePath: [L16] havoc main_#res; [L17] havoc main_#t~nondet0, main_~sn~0, main_~j~0, main_~n~0, main_#t~post2, main_#t~post1, main_~i~0; [L18] havoc main_~i~0; [L19] main_~j~0 := 10; VAL [main_~j~0=10] [L20] main_~n~0 := (if main_#t~nondet0 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 else main_#t~nondet0 % 4294967296 + -4294967296); VAL [main_#t~nondet0=6, main_~j~0=10, main_~n~0=6] [L21] havoc main_#t~nondet0; VAL [main_~j~0=10, main_~n~0=6] [L22] main_~sn~0 := 0; VAL [main_~j~0=10, main_~n~0=6, main_~sn~0=0] [L23] main_~i~0 := 1; VAL [main_~i~0=1, main_~j~0=10, main_~n~0=6, main_~sn~0=0] [L38] assume main_~i~0 <= main_~n~0; VAL [main_~i~0=1, main_~j~0=10, main_~n~0=6, main_~sn~0=0] [L45] assume main_~i~0 < main_~j~0; VAL [main_~i~0=1, main_~j~0=10, main_~n~0=6, main_~sn~0=0] [L46] main_~sn~0 := main_~sn~0 + 2; VAL [main_~i~0=1, main_~j~0=10, main_~n~0=6, main_~sn~0=2] [L52] main_#t~post2 := main_~j~0; VAL [main_#t~post2=10, main_~i~0=1, main_~j~0=10, main_~n~0=6, main_~sn~0=2] [L53] main_~j~0 := main_#t~post2 + -1; VAL [main_#t~post2=10, main_~i~0=1, main_~j~0=9, main_~n~0=6, main_~sn~0=2] [L54] havoc main_#t~post2; VAL [main_~i~0=1, main_~j~0=9, main_~n~0=6, main_~sn~0=2] [L55] main_#t~post1 := main_~i~0; VAL [main_#t~post1=1, main_~i~0=1, main_~j~0=9, main_~n~0=6, main_~sn~0=2] [L56] main_~i~0 := main_#t~post1 + 1; VAL [main_#t~post1=1, main_~i~0=2, main_~j~0=9, main_~n~0=6, main_~sn~0=2] [L57] havoc main_#t~post1; VAL [main_~i~0=2, main_~j~0=9, main_~n~0=6, main_~sn~0=2] [L38] assume main_~i~0 <= main_~n~0; VAL [main_~i~0=2, main_~j~0=9, main_~n~0=6, main_~sn~0=2] [L45] assume main_~i~0 < main_~j~0; VAL [main_~i~0=2, main_~j~0=9, main_~n~0=6, main_~sn~0=2] [L46] main_~sn~0 := main_~sn~0 + 2; VAL [main_~i~0=2, main_~j~0=9, main_~n~0=6, main_~sn~0=4] [L52] main_#t~post2 := main_~j~0; VAL [main_#t~post2=9, main_~i~0=2, main_~j~0=9, main_~n~0=6, main_~sn~0=4] [L53] main_~j~0 := main_#t~post2 + -1; VAL [main_#t~post2=9, main_~i~0=2, main_~j~0=8, main_~n~0=6, main_~sn~0=4] [L54] havoc main_#t~post2; VAL [main_~i~0=2, main_~j~0=8, main_~n~0=6, main_~sn~0=4] [L55] main_#t~post1 := main_~i~0; VAL [main_#t~post1=2, main_~i~0=2, main_~j~0=8, main_~n~0=6, main_~sn~0=4] [L56] main_~i~0 := main_#t~post1 + 1; VAL [main_#t~post1=2, main_~i~0=3, main_~j~0=8, main_~n~0=6, main_~sn~0=4] [L57] havoc main_#t~post1; VAL [main_~i~0=3, main_~j~0=8, main_~n~0=6, main_~sn~0=4] [L38] assume main_~i~0 <= main_~n~0; VAL [main_~i~0=3, main_~j~0=8, main_~n~0=6, main_~sn~0=4] [L45] assume main_~i~0 < main_~j~0; VAL [main_~i~0=3, main_~j~0=8, main_~n~0=6, main_~sn~0=4] [L46] main_~sn~0 := main_~sn~0 + 2; VAL [main_~i~0=3, main_~j~0=8, main_~n~0=6, main_~sn~0=6] [L52] main_#t~post2 := main_~j~0; VAL [main_#t~post2=8, main_~i~0=3, main_~j~0=8, main_~n~0=6, main_~sn~0=6] [L53] main_~j~0 := main_#t~post2 + -1; VAL [main_#t~post2=8, main_~i~0=3, main_~j~0=7, main_~n~0=6, main_~sn~0=6] [L54] havoc main_#t~post2; VAL [main_~i~0=3, main_~j~0=7, main_~n~0=6, main_~sn~0=6] [L55] main_#t~post1 := main_~i~0; VAL [main_#t~post1=3, main_~i~0=3, main_~j~0=7, main_~n~0=6, main_~sn~0=6] [L56] main_~i~0 := main_#t~post1 + 1; VAL [main_#t~post1=3, main_~i~0=4, main_~j~0=7, main_~n~0=6, main_~sn~0=6] [L57] havoc main_#t~post1; VAL [main_~i~0=4, main_~j~0=7, main_~n~0=6, main_~sn~0=6] [L38] assume main_~i~0 <= main_~n~0; VAL [main_~i~0=4, main_~j~0=7, main_~n~0=6, main_~sn~0=6] [L45] assume main_~i~0 < main_~j~0; VAL [main_~i~0=4, main_~j~0=7, main_~n~0=6, main_~sn~0=6] [L46] main_~sn~0 := main_~sn~0 + 2; VAL [main_~i~0=4, main_~j~0=7, main_~n~0=6, main_~sn~0=8] [L52] main_#t~post2 := main_~j~0; VAL [main_#t~post2=7, main_~i~0=4, main_~j~0=7, main_~n~0=6, main_~sn~0=8] [L53] main_~j~0 := main_#t~post2 + -1; VAL [main_#t~post2=7, main_~i~0=4, main_~j~0=6, main_~n~0=6, main_~sn~0=8] [L54] havoc main_#t~post2; VAL [main_~i~0=4, main_~j~0=6, main_~n~0=6, main_~sn~0=8] [L55] main_#t~post1 := main_~i~0; VAL [main_#t~post1=4, main_~i~0=4, main_~j~0=6, main_~n~0=6, main_~sn~0=8] [L56] main_~i~0 := main_#t~post1 + 1; VAL [main_#t~post1=4, main_~i~0=5, main_~j~0=6, main_~n~0=6, main_~sn~0=8] [L57] havoc main_#t~post1; VAL [main_~i~0=5, main_~j~0=6, main_~n~0=6, main_~sn~0=8] [L38] assume main_~i~0 <= main_~n~0; VAL [main_~i~0=5, main_~j~0=6, main_~n~0=6, main_~sn~0=8] [L45] assume main_~i~0 < main_~j~0; VAL [main_~i~0=5, main_~j~0=6, main_~n~0=6, main_~sn~0=8] [L46] main_~sn~0 := main_~sn~0 + 2; VAL [main_~i~0=5, main_~j~0=6, main_~n~0=6, main_~sn~0=10] [L52] main_#t~post2 := main_~j~0; VAL [main_#t~post2=6, main_~i~0=5, main_~j~0=6, main_~n~0=6, main_~sn~0=10] [L53] main_~j~0 := main_#t~post2 + -1; VAL [main_#t~post2=6, main_~i~0=5, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [L54] havoc main_#t~post2; VAL [main_~i~0=5, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [L55] main_#t~post1 := main_~i~0; VAL [main_#t~post1=5, main_~i~0=5, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [L56] main_~i~0 := main_#t~post1 + 1; VAL [main_#t~post1=5, main_~i~0=6, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [L57] havoc main_#t~post1; VAL [main_~i~0=6, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [L38] assume main_~i~0 <= main_~n~0; VAL [main_~i~0=6, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [L49] assume !(main_~i~0 < main_~j~0); VAL [main_~i~0=6, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [L52] main_#t~post2 := main_~j~0; VAL [main_#t~post2=5, main_~i~0=6, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [L53] main_~j~0 := main_#t~post2 + -1; VAL [main_#t~post2=5, main_~i~0=6, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L54] havoc main_#t~post2; VAL [main_~i~0=6, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L55] main_#t~post1 := main_~i~0; VAL [main_#t~post1=6, main_~i~0=6, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L56] main_~i~0 := main_#t~post1 + 1; VAL [main_#t~post1=6, main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L57] havoc main_#t~post1; VAL [main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L30] assume !(main_~i~0 <= main_~n~0); VAL [main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L31] assume (0 == main_~sn~0 || 2 * main_~n~0 == main_~sn~0) || (!(0 == main_~sn~0) && !(2 * main_~n~0 == main_~sn~0)); VAL [main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L32] __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=0, main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L33] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L34] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L35] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [L41] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. UNSAFE Result, 6.2s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 136 SDtfs, 234 SDslu, 812 SDs, 0 SdLazy, 760 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, 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, 7 MinimizatonAttempts, 30 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 45547 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 75/196 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/sum01_bug02_false-unreach-call_true-termination.i_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_13-14-01-725.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum01_bug02_false-unreach-call_true-termination.i_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_13-14-01-725.csv Received shutdown request...