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/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_true-unreach-call1_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:45:55,630 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:45:55,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:45:55,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:45:55,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:45:55,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:45:55,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:45:55,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:45:55,659 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:45:55,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:45:55,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:45:55,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:45:55,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:45:55,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:45:55,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:45:55,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:45:55,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:45:55,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:45:55,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:45:55,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:45:55,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:45:55,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:45:55,676 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:45:55,676 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:45:55,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:45:55,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:45:55,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:45:55,681 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:45:55,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:45:55,687 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:45:55,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:45:55,688 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:45:55,688 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:45:55,689 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:45:55,690 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:45:55,690 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:45:55,691 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 12:45:55,711 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:45:55,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:45:55,713 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:45:55,713 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:45:55,713 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:45:55,713 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:45:55,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:45:55,714 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:45:55,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:45:55,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:45:55,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:45:55,715 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:45:55,715 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:45:55,716 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:45:55,716 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:45:55,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:45:55,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:45:55,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:45:55,781 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:45:55,782 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:45:55,783 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_true-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:45:55,783 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_true-unreach-call1_true-termination.i_3.bpl' [2018-10-15 12:45:55,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:45:55,846 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:45:55,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:45:55,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:45:55,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:45:55,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:55" (1/1) ... [2018-10-15 12:45:55,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:55" (1/1) ... [2018-10-15 12:45:55,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:55" (1/1) ... [2018-10-15 12:45:55,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:55" (1/1) ... [2018-10-15 12:45:55,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:55" (1/1) ... [2018-10-15 12:45:55,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:55" (1/1) ... [2018-10-15 12:45:55,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:55" (1/1) ... [2018-10-15 12:45:55,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:45:55,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:45:55,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:45:55,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:45:55,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:55" (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 12:45:55,974 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:45:55,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:45:55,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:45:56,217 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:45:56,218 INFO L202 PluginConnector]: Adding new model underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:45:56 BoogieIcfgContainer [2018-10-15 12:45:56,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:45:56,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:45:56,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:45:56,223 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:45:56,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:55" (1/2) ... [2018-10-15 12:45:56,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a61bf84 and model type underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:45:56, skipping insertion in model container [2018-10-15 12:45:56,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:45:56" (2/2) ... [2018-10-15 12:45:56,227 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:45:56,237 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:45:56,245 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:45:56,260 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:45:56,288 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:45:56,289 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:45:56,289 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:45:56,289 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:45:56,289 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:45:56,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:45:56,290 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:45:56,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:45:56,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:45:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-15 12:45:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-15 12:45:56,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:56,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:56,314 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:56,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash 323423375, now seen corresponding path program 1 times [2018-10-15 12:45:56,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:56,557 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 12:45:56,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:45:56,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:45:56,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:45:56,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:45:56,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:45:56,586 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-15 12:45:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:56,693 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-15 12:45:56,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:45:56,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-15 12:45:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:56,704 INFO L225 Difference]: With dead ends: 19 [2018-10-15 12:45:56,705 INFO L226 Difference]: Without dead ends: 19 [2018-10-15 12:45:56,707 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 12:45:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-15 12:45:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-10-15 12:45:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-15 12:45:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-15 12:45:56,749 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2018-10-15 12:45:56,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:56,750 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-15 12:45:56,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:45:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-15 12:45:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 12:45:56,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:56,751 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:56,751 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:56,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash 235143876, now seen corresponding path program 1 times [2018-10-15 12:45:56,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:56,877 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 12:45:56,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:56,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:45:56,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:45:56,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:45:56,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:45:56,881 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2018-10-15 12:45:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:57,063 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 12:45:57,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:45:57,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-15 12:45:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:57,065 INFO L225 Difference]: With dead ends: 24 [2018-10-15 12:45:57,065 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 12:45:57,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:45:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 12:45:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-10-15 12:45:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-15 12:45:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-15 12:45:57,070 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2018-10-15 12:45:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:57,071 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-15 12:45:57,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:45:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-15 12:45:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-15 12:45:57,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:57,073 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:57,073 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:57,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1956534865, now seen corresponding path program 2 times [2018-10-15 12:45:57,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:57,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:57,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:45:57,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:45:57,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:45:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:45:57,467 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 7 states. [2018-10-15 12:45:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:57,746 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 12:45:57,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:45:57,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-10-15 12:45:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:57,748 INFO L225 Difference]: With dead ends: 29 [2018-10-15 12:45:57,748 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 12:45:57,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:45:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 12:45:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-15 12:45:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 12:45:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-15 12:45:57,754 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-10-15 12:45:57,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:57,754 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-15 12:45:57,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:45:57,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-15 12:45:57,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 12:45:57,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:57,756 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:57,757 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:57,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:57,757 INFO L82 PathProgramCache]: Analyzing trace with hash -499376732, now seen corresponding path program 3 times [2018-10-15 12:45:57,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:57,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:57,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:45:57,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:45:57,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:45:57,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:45:57,965 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2018-10-15 12:45:58,283 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 12:45:58,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:58,702 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 12:45:58,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:45:58,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-10-15 12:45:58,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:58,704 INFO L225 Difference]: With dead ends: 34 [2018-10-15 12:45:58,704 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 12:45:58,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:45:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 12:45:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-10-15 12:45:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-15 12:45:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-15 12:45:58,710 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-10-15 12:45:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:58,710 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-15 12:45:58,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:45:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-15 12:45:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-15 12:45:58,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:58,712 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:58,712 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:58,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:58,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1986483919, now seen corresponding path program 4 times [2018-10-15 12:45:58,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:59,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:59,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:45:59,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:45:59,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:45:59,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:45:59,026 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 11 states. [2018-10-15 12:45:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:59,404 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 12:45:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:45:59,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-10-15 12:45:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:59,406 INFO L225 Difference]: With dead ends: 39 [2018-10-15 12:45:59,406 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 12:45:59,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:45:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 12:45:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-15 12:45:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 12:45:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 12:45:59,413 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-10-15 12:45:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:59,413 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 12:45:59,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:45:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 12:45:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 12:45:59,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:59,415 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:59,415 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:59,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1387798660, now seen corresponding path program 5 times [2018-10-15 12:45:59,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:59,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:59,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:45:59,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:45:59,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:45:59,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:45:59,743 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 13 states. [2018-10-15 12:46:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:00,343 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 12:46:00,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:46:00,344 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-10-15 12:46:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:00,345 INFO L225 Difference]: With dead ends: 44 [2018-10-15 12:46:00,345 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 12:46:00,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:46:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 12:46:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-10-15 12:46:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 12:46:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-15 12:46:00,351 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-10-15 12:46:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:00,351 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-15 12:46:00,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:46:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-15 12:46:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-15 12:46:00,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:00,353 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:00,353 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:00,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:00,354 INFO L82 PathProgramCache]: Analyzing trace with hash -614850577, now seen corresponding path program 6 times [2018-10-15 12:46:00,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:12,845 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 178956971 c_ULTIMATE.start_main_~y~0) 89478484))) (<= .cse0 (* 268435456 (div .cse0 268435456)))) is different from false [2018-10-15 12:47:08,059 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 12:48:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 39 refuted. 16 times theorem prover too weak. 0 trivial. 26 not checked. [2018-10-15 12:48:06,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:06,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:48:06,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:48:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:48:06,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=82, Unknown=9, NotChecked=18, Total=132 [2018-10-15 12:48:06,377 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 12 states. [2018-10-15 12:53:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:53:53,604 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-15 12:53:53,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:53:53,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-10-15 12:53:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:53:53,606 INFO L225 Difference]: With dead ends: 56 [2018-10-15 12:53:53,606 INFO L226 Difference]: Without dead ends: 51 [2018-10-15 12:53:53,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 126.0s TimeCoverageRelationStatistics Valid=33, Invalid=118, Unknown=9, NotChecked=22, Total=182 [2018-10-15 12:53:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-15 12:53:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-10-15 12:53:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 12:53:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 12:53:53,612 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2018-10-15 12:53:53,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:53:53,613 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 12:53:53,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:53:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 12:53:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 12:53:53,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:53:53,614 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:53:53,615 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:53:53,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:53:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1773538148, now seen corresponding path program 7 times [2018-10-15 12:53:53,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:53:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:53:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 31 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:53:54,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:53:54,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:53:54,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:53:54,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:53:54,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:53:54,455 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 15 states. [2018-10-15 12:53:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:53:54,968 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2018-10-15 12:53:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:53:54,969 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-10-15 12:53:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:53:54,970 INFO L225 Difference]: With dead ends: 35 [2018-10-15 12:53:54,970 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 12:53:54,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:53:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 12:53:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 12:53:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 12:53:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 12:53:54,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-10-15 12:53:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:53:54,973 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 12:53:54,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:53:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 12:53:54,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 12:53:54,977 INFO L202 PluginConnector]: Adding new model underapprox_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:53:54 BoogieIcfgContainer [2018-10-15 12:53:54,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 12:53:54,978 INFO L168 Benchmark]: Toolchain (without parser) took 479133.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 372.8 MB). Peak memory consumption was 372.8 MB. Max. memory is 7.1 GB. [2018-10-15 12:53:54,979 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 12:53:54,980 INFO L168 Benchmark]: Boogie Preprocessor took 53.53 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 12:53:54,981 INFO L168 Benchmark]: RCFGBuilder took 318.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 12:53:54,982 INFO L168 Benchmark]: TraceAbstraction took 478757.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 351.6 MB). Peak memory consumption was 351.6 MB. Max. memory is 7.1 GB. [2018-10-15 12:53:54,985 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 318.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 478757.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 351.6 MB). Peak memory consumption was 351.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 478.6s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 350.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 152 SDtfs, 46 SDslu, 836 SDs, 0 SdLazy, 945 SolverSat, 23 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 339.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 129.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred 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, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 128.1s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 47510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 31/308 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox_true-unreach-call1_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_12-53-54-996.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox_true-unreach-call1_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_12-53-54-996.csv Received shutdown request...