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_false-unreach-call_true-termination.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:14:40,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:14:40,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:14:40,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:14:40,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:14:40,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:14:40,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:14:40,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:14:40,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:14:40,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:14:40,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:14:40,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:14:40,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:14:40,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:14:40,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:14:40,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:14:40,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:14:40,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:14:40,412 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:14:40,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:14:40,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:14:40,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:14:40,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:14:40,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:14:40,419 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:14:40,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:14:40,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:14:40,422 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:14:40,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:14:40,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:14:40,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:14:40,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:14:40,425 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:14:40,425 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:14:40,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:14:40,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:14:40,427 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:40,443 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:14:40,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:14:40,445 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:14:40,445 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:14:40,445 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:14:40,446 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:14:40,449 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:14:40,449 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:14:40,449 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:14:40,449 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:14:40,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:14:40,450 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:14:40,450 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:14:40,451 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:14:40,451 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:14:40,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:14:40,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:14:40,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:14:40,539 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:14:40,540 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:14:40,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/sum04_false-unreach-call_true-termination.i_4.bpl [2018-10-15 13:14:40,541 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/sum04_false-unreach-call_true-termination.i_4.bpl' [2018-10-15 13:14:40,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:14:40,591 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:14:40,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:14:40,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:14:40,592 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:14:40,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:40" (1/1) ... [2018-10-15 13:14:40,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:40" (1/1) ... [2018-10-15 13:14:40,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:40" (1/1) ... [2018-10-15 13:14:40,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:40" (1/1) ... [2018-10-15 13:14:40,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:40" (1/1) ... [2018-10-15 13:14:40,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:40" (1/1) ... [2018-10-15 13:14:40,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:40" (1/1) ... [2018-10-15 13:14:40,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:14:40,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:14:40,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:14:40,646 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:14:40,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:40" (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:40,718 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:14:40,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:14:40,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:14:40,993 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:14:40,994 INFO L202 PluginConnector]: Adding new model sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:14:40 BoogieIcfgContainer [2018-10-15 13:14:40,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:14:40,995 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:14:40,995 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:14:40,996 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:14:41,000 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:14:40" (1/1) ... [2018-10-15 13:14:41,005 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:14:41,025 INFO L202 PluginConnector]: Adding new model sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:14:41 BasicIcfg [2018-10-15 13:14:41,026 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:14:41,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:14:41,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:14:41,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:14:41,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:14:40" (1/3) ... [2018-10-15 13:14:41,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db7d941 and model type sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:14:41, skipping insertion in model container [2018-10-15 13:14:41,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:14:40" (2/3) ... [2018-10-15 13:14:41,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db7d941 and model type sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:14:41, skipping insertion in model container [2018-10-15 13:14:41,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:14:41" (3/3) ... [2018-10-15 13:14:41,047 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_false-unreach-call_true-termination.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 13:14:41,069 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:14:41,083 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:14:41,108 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:14:41,155 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:14:41,156 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:14:41,156 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:14:41,156 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:14:41,156 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:14:41,157 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:14:41,157 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:14:41,157 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:14:41,157 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:14:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-15 13:14:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 13:14:41,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:41,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:41,188 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:41,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:41,195 INFO L82 PathProgramCache]: Analyzing trace with hash 383836074, now seen corresponding path program 1 times [2018-10-15 13:14:41,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:41,335 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:41,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:14:41,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:14:41,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:14:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:14:41,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:14:41,363 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-15 13:14:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:41,439 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-10-15 13:14:41,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:14:41,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 13:14:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:41,452 INFO L225 Difference]: With dead ends: 23 [2018-10-15 13:14:41,453 INFO L226 Difference]: Without dead ends: 23 [2018-10-15 13:14:41,454 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:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-15 13:14:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-10-15 13:14:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-15 13:14:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-10-15 13:14:41,484 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2018-10-15 13:14:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:41,484 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-10-15 13:14:41,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:14:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-10-15 13:14:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 13:14:41,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:41,485 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:41,486 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:41,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:41,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1326429829, now seen corresponding path program 1 times [2018-10-15 13:14:41,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:41,628 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:41,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:41,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:14:41,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:14:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:14:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:14:41,631 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2018-10-15 13:14:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:41,783 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-10-15 13:14:41,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:14:41,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-15 13:14:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:41,785 INFO L225 Difference]: With dead ends: 29 [2018-10-15 13:14:41,785 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 13:14:41,787 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:41,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 13:14:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-15 13:14:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-15 13:14:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-10-15 13:14:41,792 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2018-10-15 13:14:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:41,792 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-10-15 13:14:41,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:14:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-10-15 13:14:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 13:14:41,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:41,793 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:41,794 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:41,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash -482689760, now seen corresponding path program 2 times [2018-10-15 13:14:41,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 13:14:41,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:14:41,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 13:14:41,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:14:41,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:14:41,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:14:41,909 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-10-15 13:14:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:42,108 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-10-15 13:14:42,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:14:42,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-10-15 13:14:42,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:42,110 INFO L225 Difference]: With dead ends: 33 [2018-10-15 13:14:42,110 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 13:14:42,111 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:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 13:14:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-10-15 13:14:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 13:14:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-10-15 13:14:42,119 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-10-15 13:14:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:42,120 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-10-15 13:14:42,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:14:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-10-15 13:14:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 13:14:42,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:42,122 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:42,123 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:42,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1453686828, now seen corresponding path program 1 times [2018-10-15 13:14:42,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:42,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:42,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:14:42,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:14:42,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:14:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:14:42,382 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2018-10-15 13:14:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:42,609 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-10-15 13:14:42,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:14:42,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-10-15 13:14:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:42,613 INFO L225 Difference]: With dead ends: 36 [2018-10-15 13:14:42,613 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 13:14:42,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:14:42,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 13:14:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-15 13:14:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 13:14:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-10-15 13:14:42,619 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2018-10-15 13:14:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:42,619 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-10-15 13:14:42,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:14:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-10-15 13:14:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 13:14:42,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:42,621 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:42,621 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:42,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash -603333967, now seen corresponding path program 2 times [2018-10-15 13:14:42,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-15 13:14:42,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:42,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:14:42,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:14:42,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:14:42,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:14:42,724 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 7 states. [2018-10-15 13:14:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:43,006 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-10-15 13:14:43,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:14:43,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-10-15 13:14:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:43,012 INFO L225 Difference]: With dead ends: 44 [2018-10-15 13:14:43,014 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 13:14:43,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:14:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 13:14:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-10-15 13:14:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 13:14:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-15 13:14:43,028 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 35 [2018-10-15 13:14:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:43,031 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-15 13:14:43,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:14:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-15 13:14:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 13:14:43,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:43,033 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:43,036 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:43,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:43,036 INFO L82 PathProgramCache]: Analyzing trace with hash -80792261, now seen corresponding path program 3 times [2018-10-15 13:14:43,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:43,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:43,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:14:43,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:14:43,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:14:43,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:14:43,387 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 13 states. [2018-10-15 13:14:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:43,707 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-10-15 13:14:43,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:14:43,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-10-15 13:14:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:43,711 INFO L225 Difference]: With dead ends: 49 [2018-10-15 13:14:43,711 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 13:14:43,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 13:14:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-10-15 13:14:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 13:14:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-10-15 13:14:43,717 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 40 [2018-10-15 13:14:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:43,718 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-10-15 13:14:43,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:14:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-10-15 13:14:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 13:14:43,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:43,720 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:43,720 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:43,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:43,721 INFO L82 PathProgramCache]: Analyzing trace with hash 181330161, now seen corresponding path program 4 times [2018-10-15 13:14:43,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:43,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:43,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:14:43,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:14:43,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:14:43,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:14:43,999 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 15 states. [2018-10-15 13:14:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:44,702 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-10-15 13:14:44,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:14:44,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-10-15 13:14:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:44,711 INFO L225 Difference]: With dead ends: 54 [2018-10-15 13:14:44,711 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 13:14:44,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:14:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 13:14:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-15 13:14:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 13:14:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-10-15 13:14:44,719 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 45 [2018-10-15 13:14:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:44,721 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-10-15 13:14:44,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:14:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-10-15 13:14:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 13:14:44,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:44,723 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:44,723 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:44,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash -371976453, now seen corresponding path program 5 times [2018-10-15 13:14:44,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:44,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:44,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:14:44,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:14:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:14:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:14:44,950 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 17 states. [2018-10-15 13:14:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:45,308 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-10-15 13:14:45,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:14:45,309 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-10-15 13:14:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:45,310 INFO L225 Difference]: With dead ends: 56 [2018-10-15 13:14:45,310 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 13:14:45,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:14:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 13:14:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-15 13:14:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 13:14:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-10-15 13:14:45,316 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2018-10-15 13:14:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:45,317 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-10-15 13:14:45,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:14:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-10-15 13:14:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 13:14:45,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:45,318 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:45,319 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:45,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash -592373967, now seen corresponding path program 6 times [2018-10-15 13:14:45,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 13:14:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 13:14:45,366 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 13:14:45,407 INFO L202 PluginConnector]: Adding new model sum04_false-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:14:45 BasicIcfg [2018-10-15 13:14:45,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 13:14:45,410 INFO L168 Benchmark]: Toolchain (without parser) took 4818.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 277.6 MB). Peak memory consumption was 277.6 MB. Max. memory is 7.1 GB. [2018-10-15 13:14:45,412 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 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:45,413 INFO L168 Benchmark]: Boogie Preprocessor took 52.78 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:45,413 INFO L168 Benchmark]: RCFGBuilder took 349.37 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:45,417 INFO L168 Benchmark]: IcfgTransformer took 30.90 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:45,417 INFO L168 Benchmark]: TraceAbstraction took 4376.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.4 MB). Peak memory consumption was 256.4 MB. Max. memory is 7.1 GB. [2018-10-15 13:14:45,431 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.14 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 52.78 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 349.37 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.90 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 4376.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.4 MB). Peak memory consumption was 256.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 34]: assertion can be violated assertion can be violated We found a FailurePath: [L12] havoc main_#res; [L13] havoc main_~sn~0, main_~i~0, main_#t~post0; [L14] havoc main_~i~0; [L15] main_~sn~0 := 0; VAL [main_~sn~0=0] [L16] main_~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [L31] assume main_~i~0 <= 8; VAL [main_~i~0=1, main_~sn~0=0] [L38] assume main_~i~0 < 4; VAL [main_~i~0=1, main_~sn~0=0] [L39] main_~sn~0 := main_~sn~0 + 2; VAL [main_~i~0=1, main_~sn~0=2] [L45] main_#t~post0 := main_~i~0; VAL [main_#t~post0=1, main_~i~0=1, main_~sn~0=2] [L46] main_~i~0 := main_#t~post0 + 1; VAL [main_#t~post0=1, main_~i~0=2, main_~sn~0=2] [L47] havoc main_#t~post0; VAL [main_~i~0=2, main_~sn~0=2] [L31] assume main_~i~0 <= 8; VAL [main_~i~0=2, main_~sn~0=2] [L38] assume main_~i~0 < 4; VAL [main_~i~0=2, main_~sn~0=2] [L39] main_~sn~0 := main_~sn~0 + 2; VAL [main_~i~0=2, main_~sn~0=4] [L45] main_#t~post0 := main_~i~0; VAL [main_#t~post0=2, main_~i~0=2, main_~sn~0=4] [L46] main_~i~0 := main_#t~post0 + 1; VAL [main_#t~post0=2, main_~i~0=3, main_~sn~0=4] [L47] havoc main_#t~post0; VAL [main_~i~0=3, main_~sn~0=4] [L31] assume main_~i~0 <= 8; VAL [main_~i~0=3, main_~sn~0=4] [L38] assume main_~i~0 < 4; VAL [main_~i~0=3, main_~sn~0=4] [L39] main_~sn~0 := main_~sn~0 + 2; VAL [main_~i~0=3, main_~sn~0=6] [L45] main_#t~post0 := main_~i~0; VAL [main_#t~post0=3, main_~i~0=3, main_~sn~0=6] [L46] main_~i~0 := main_#t~post0 + 1; VAL [main_#t~post0=3, main_~i~0=4, main_~sn~0=6] [L47] havoc main_#t~post0; VAL [main_~i~0=4, main_~sn~0=6] [L31] assume main_~i~0 <= 8; VAL [main_~i~0=4, main_~sn~0=6] [L42] assume !(main_~i~0 < 4); VAL [main_~i~0=4, main_~sn~0=6] [L45] main_#t~post0 := main_~i~0; VAL [main_#t~post0=4, main_~i~0=4, main_~sn~0=6] [L46] main_~i~0 := main_#t~post0 + 1; VAL [main_#t~post0=4, main_~i~0=5, main_~sn~0=6] [L47] havoc main_#t~post0; VAL [main_~i~0=5, main_~sn~0=6] [L31] assume main_~i~0 <= 8; VAL [main_~i~0=5, main_~sn~0=6] [L42] assume !(main_~i~0 < 4); VAL [main_~i~0=5, main_~sn~0=6] [L45] main_#t~post0 := main_~i~0; VAL [main_#t~post0=5, main_~i~0=5, main_~sn~0=6] [L46] main_~i~0 := main_#t~post0 + 1; VAL [main_#t~post0=5, main_~i~0=6, main_~sn~0=6] [L47] havoc main_#t~post0; VAL [main_~i~0=6, main_~sn~0=6] [L31] assume main_~i~0 <= 8; VAL [main_~i~0=6, main_~sn~0=6] [L42] assume !(main_~i~0 < 4); VAL [main_~i~0=6, main_~sn~0=6] [L45] main_#t~post0 := main_~i~0; VAL [main_#t~post0=6, main_~i~0=6, main_~sn~0=6] [L46] main_~i~0 := main_#t~post0 + 1; VAL [main_#t~post0=6, main_~i~0=7, main_~sn~0=6] [L47] havoc main_#t~post0; VAL [main_~i~0=7, main_~sn~0=6] [L31] assume main_~i~0 <= 8; VAL [main_~i~0=7, main_~sn~0=6] [L42] assume !(main_~i~0 < 4); VAL [main_~i~0=7, main_~sn~0=6] [L45] main_#t~post0 := main_~i~0; VAL [main_#t~post0=7, main_~i~0=7, main_~sn~0=6] [L46] main_~i~0 := main_#t~post0 + 1; VAL [main_#t~post0=7, main_~i~0=8, main_~sn~0=6] [L47] havoc main_#t~post0; VAL [main_~i~0=8, main_~sn~0=6] [L31] assume main_~i~0 <= 8; VAL [main_~i~0=8, main_~sn~0=6] [L42] assume !(main_~i~0 < 4); VAL [main_~i~0=8, main_~sn~0=6] [L45] main_#t~post0 := main_~i~0; VAL [main_#t~post0=8, main_~i~0=8, main_~sn~0=6] [L46] main_~i~0 := main_#t~post0 + 1; VAL [main_#t~post0=8, main_~i~0=9, main_~sn~0=6] [L47] havoc main_#t~post0; VAL [main_~i~0=9, main_~sn~0=6] [L23] assume !(main_~i~0 <= 8); VAL [main_~i~0=9, main_~sn~0=6] [L24] assume ((!(0 == main_~sn~0) && !(16 == main_~sn~0)) || 0 == main_~sn~0) || 16 == main_~sn~0; VAL [main_~i~0=9, main_~sn~0=6] [L25] __VERIFIER_assert_#in~cond := (if main_~sn~0 == 16 || main_~sn~0 == 0 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=0, main_~i~0=9, main_~sn~0=6] [L26] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, main_~i~0=9, main_~sn~0=6] [L27] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L28] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L34] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. UNSAFE Result, 4.2s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 138 SDslu, 401 SDs, 0 SdLazy, 357 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, 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, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 19767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 50/322 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/sum04_false-unreach-call_true-termination.i_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_13-14-45-449.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum04_false-unreach-call_true-termination.i_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_13-14-45-449.csv Received shutdown request...