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/20170304-DifficultPathPrograms/eureka_01.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:31:54,745 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:31:54,747 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:31:54,765 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:31:54,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:31:54,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:31:54,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:31:54,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:31:54,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:31:54,779 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:31:54,780 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:31:54,780 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:31:54,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:31:54,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:31:54,783 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:31:54,784 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:31:54,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:31:54,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:31:54,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:31:54,790 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:31:54,791 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:31:54,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:31:54,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:31:54,795 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:31:54,795 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:31:54,796 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:31:54,797 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:31:54,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:31:54,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:31:54,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:31:54,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:31:54,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:31:54,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:31:54,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:31:54,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:31:54,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:31:54,803 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 15:31:54,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:31:54,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:31:54,821 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:31:54,825 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:31:54,825 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:31:54,825 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:31:54,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:31:54,826 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:31:54,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:31:54,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:31:54,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:31:54,827 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:31:54,827 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:31:54,828 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:31:54,828 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:31:54,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:31:54,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:31:54,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:31:54,928 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:31:54,929 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:31:54,929 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl [2018-10-15 15:31:54,930 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2018-10-15 15:31:55,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:31:55,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:31:55,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:31:55,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:31:55,005 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:31:55,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:54" (1/1) ... [2018-10-15 15:31:55,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:54" (1/1) ... [2018-10-15 15:31:55,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:54" (1/1) ... [2018-10-15 15:31:55,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:54" (1/1) ... [2018-10-15 15:31:55,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:54" (1/1) ... [2018-10-15 15:31:55,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:54" (1/1) ... [2018-10-15 15:31:55,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:54" (1/1) ... [2018-10-15 15:31:55,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:31:55,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:31:55,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:31:55,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:31:55,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 15:31:55,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:31:55,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:31:55,864 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:31:55,864 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:55 BoogieIcfgContainer [2018-10-15 15:31:55,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:31:55,865 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:31:55,865 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:31:55,866 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:31:55,869 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,872 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:31:55,891 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:31:55 BasicIcfg [2018-10-15 15:31:55,892 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:31:55,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:31:55,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:31:55,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:31:55,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:54" (1/3) ... [2018-10-15 15:31:55,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1749f850 and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:55, skipping insertion in model container [2018-10-15 15:31:55,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:55" (2/3) ... [2018-10-15 15:31:55,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1749f850 and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:31:55, skipping insertion in model container [2018-10-15 15:31:55,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:31:55" (3/3) ... [2018-10-15 15:31:55,901 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bplleft_unchanged_by_heapseparator [2018-10-15 15:31:55,911 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:31:55,921 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:31:55,939 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:31:55,968 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:31:55,969 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:31:55,969 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:31:55,969 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:31:55,969 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:31:55,970 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:31:55,970 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:31:55,970 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:31:55,970 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:31:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states. [2018-10-15 15:31:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 15:31:56,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:56,002 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:56,003 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:56,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash -249654076, now seen corresponding path program 1 times [2018-10-15 15:31:56,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:56,382 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 15:31:56,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:31:56,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:31:56,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:31:56,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:31:56,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:31:56,411 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 4 states. [2018-10-15 15:31:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:56,810 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-10-15 15:31:56,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:31:56,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-10-15 15:31:56,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:56,829 INFO L225 Difference]: With dead ends: 142 [2018-10-15 15:31:56,830 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 15:31:56,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:31:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 15:31:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2018-10-15 15:31:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-15 15:31:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2018-10-15 15:31:56,883 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 89 [2018-10-15 15:31:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:56,884 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2018-10-15 15:31:56,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:31:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2018-10-15 15:31:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 15:31:56,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:56,889 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:56,889 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:56,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:56,890 INFO L82 PathProgramCache]: Analyzing trace with hash 554790944, now seen corresponding path program 1 times [2018-10-15 15:31:56,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 15:31:57,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:57,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:31:57,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:31:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:31:57,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:31:57,185 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand 6 states. [2018-10-15 15:31:57,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:57,522 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-10-15 15:31:57,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:31:57,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-10-15 15:31:57,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:57,527 INFO L225 Difference]: With dead ends: 149 [2018-10-15 15:31:57,527 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 15:31:57,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:31:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 15:31:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2018-10-15 15:31:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 15:31:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-10-15 15:31:57,544 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 104 [2018-10-15 15:31:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:57,544 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-10-15 15:31:57,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:31:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-10-15 15:31:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-15 15:31:57,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:57,547 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:57,548 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:57,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1120569426, now seen corresponding path program 2 times [2018-10-15 15:31:57,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-15 15:31:57,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:57,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:31:57,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:31:57,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:31:57,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:31:57,779 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 6 states. [2018-10-15 15:31:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:58,441 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2018-10-15 15:31:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:31:58,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-10-15 15:31:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:58,445 INFO L225 Difference]: With dead ends: 160 [2018-10-15 15:31:58,445 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 15:31:58,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:31:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 15:31:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2018-10-15 15:31:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 15:31:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-10-15 15:31:58,465 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 111 [2018-10-15 15:31:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:58,470 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-10-15 15:31:58,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:31:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-10-15 15:31:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 15:31:58,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:58,474 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:58,474 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:58,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:58,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1774721440, now seen corresponding path program 3 times [2018-10-15 15:31:58,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-15 15:31:58,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:58,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:31:58,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:31:58,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:31:58,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:31:58,761 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 8 states. [2018-10-15 15:31:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:59,103 INFO L93 Difference]: Finished difference Result 175 states and 182 transitions. [2018-10-15 15:31:59,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:31:59,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 119 [2018-10-15 15:31:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:59,106 INFO L225 Difference]: With dead ends: 175 [2018-10-15 15:31:59,106 INFO L226 Difference]: Without dead ends: 175 [2018-10-15 15:31:59,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:31:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-15 15:31:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2018-10-15 15:31:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 15:31:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 160 transitions. [2018-10-15 15:31:59,118 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 160 transitions. Word has length 119 [2018-10-15 15:31:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:59,118 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 160 transitions. [2018-10-15 15:31:59,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:31:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2018-10-15 15:31:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 15:31:59,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:59,121 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:59,122 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:59,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash 863927534, now seen corresponding path program 4 times [2018-10-15 15:31:59,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-15 15:31:59,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:59,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:31:59,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:31:59,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:31:59,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:31:59,432 INFO L87 Difference]: Start difference. First operand 155 states and 160 transitions. Second operand 10 states. [2018-10-15 15:31:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:59,874 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2018-10-15 15:31:59,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:31:59,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2018-10-15 15:31:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:59,879 INFO L225 Difference]: With dead ends: 190 [2018-10-15 15:31:59,879 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 15:31:59,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:31:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 15:31:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2018-10-15 15:31:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 15:31:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 176 transitions. [2018-10-15 15:31:59,888 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 176 transitions. Word has length 127 [2018-10-15 15:31:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:59,889 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 176 transitions. [2018-10-15 15:31:59,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:31:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 176 transitions. [2018-10-15 15:31:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 15:31:59,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:59,892 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:59,892 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:59,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:59,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1963216324, now seen corresponding path program 5 times [2018-10-15 15:31:59,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-15 15:32:00,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:00,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:32:00,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:32:00,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:32:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:32:00,306 INFO L87 Difference]: Start difference. First operand 170 states and 176 transitions. Second operand 12 states. [2018-10-15 15:32:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:00,888 INFO L93 Difference]: Finished difference Result 193 states and 201 transitions. [2018-10-15 15:32:00,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:32:00,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2018-10-15 15:32:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:00,891 INFO L225 Difference]: With dead ends: 193 [2018-10-15 15:32:00,892 INFO L226 Difference]: Without dead ends: 193 [2018-10-15 15:32:00,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:32:00,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-15 15:32:00,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2018-10-15 15:32:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 15:32:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2018-10-15 15:32:00,901 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 135 [2018-10-15 15:32:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:00,901 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2018-10-15 15:32:00,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:32:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2018-10-15 15:32:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-15 15:32:00,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:00,904 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:00,905 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:00,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:00,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1833810314, now seen corresponding path program 6 times [2018-10-15 15:32:00,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-15 15:32:01,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:01,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:32:01,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:32:01,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:32:01,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:32:01,093 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand 8 states. [2018-10-15 15:32:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:01,486 INFO L93 Difference]: Finished difference Result 204 states and 212 transitions. [2018-10-15 15:32:01,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:32:01,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2018-10-15 15:32:01,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:01,489 INFO L225 Difference]: With dead ends: 204 [2018-10-15 15:32:01,489 INFO L226 Difference]: Without dead ends: 204 [2018-10-15 15:32:01,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:32:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-15 15:32:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2018-10-15 15:32:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-15 15:32:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 199 transitions. [2018-10-15 15:32:01,498 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 199 transitions. Word has length 143 [2018-10-15 15:32:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:01,499 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 199 transitions. [2018-10-15 15:32:01,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:32:01,499 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 199 transitions. [2018-10-15 15:32:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 15:32:01,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:01,502 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:01,502 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:01,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash 266513688, now seen corresponding path program 7 times [2018-10-15 15:32:01,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-15 15:32:01,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:32:01,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:32:01,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:32:01,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:32:01,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:32:01,651 INFO L87 Difference]: Start difference. First operand 192 states and 199 transitions. Second operand 4 states. [2018-10-15 15:32:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:01,706 INFO L93 Difference]: Finished difference Result 232 states and 239 transitions. [2018-10-15 15:32:01,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:32:01,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-10-15 15:32:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:01,708 INFO L225 Difference]: With dead ends: 232 [2018-10-15 15:32:01,708 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 15:32:01,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:32:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 15:32:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 202. [2018-10-15 15:32:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-15 15:32:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 209 transitions. [2018-10-15 15:32:01,714 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 209 transitions. Word has length 150 [2018-10-15 15:32:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:01,715 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 209 transitions. [2018-10-15 15:32:01,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:32:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 209 transitions. [2018-10-15 15:32:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-15 15:32:01,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:01,717 INFO L375 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:01,718 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:01,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:01,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1079600427, now seen corresponding path program 1 times [2018-10-15 15:32:01,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 74 proven. 2 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-15 15:32:02,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:02,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:32:02,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:32:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:32:02,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:32:02,209 INFO L87 Difference]: Start difference. First operand 202 states and 209 transitions. Second operand 6 states. [2018-10-15 15:32:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:02,637 INFO L93 Difference]: Finished difference Result 277 states and 284 transitions. [2018-10-15 15:32:02,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:32:02,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2018-10-15 15:32:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:02,639 INFO L225 Difference]: With dead ends: 277 [2018-10-15 15:32:02,639 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 15:32:02,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:32:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 15:32:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 247. [2018-10-15 15:32:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-15 15:32:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 254 transitions. [2018-10-15 15:32:02,645 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 254 transitions. Word has length 195 [2018-10-15 15:32:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:02,646 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 254 transitions. [2018-10-15 15:32:02,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:32:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 254 transitions. [2018-10-15 15:32:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 15:32:02,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:02,649 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:02,649 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:02,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:02,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1542025224, now seen corresponding path program 2 times [2018-10-15 15:32:02,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 198 proven. 13 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2018-10-15 15:32:02,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:02,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:32:02,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:32:02,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:32:02,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:32:02,953 INFO L87 Difference]: Start difference. First operand 247 states and 254 transitions. Second operand 8 states. [2018-10-15 15:32:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:03,109 INFO L93 Difference]: Finished difference Result 322 states and 329 transitions. [2018-10-15 15:32:03,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:32:03,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2018-10-15 15:32:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:03,112 INFO L225 Difference]: With dead ends: 322 [2018-10-15 15:32:03,112 INFO L226 Difference]: Without dead ends: 322 [2018-10-15 15:32:03,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:32:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-15 15:32:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2018-10-15 15:32:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-15 15:32:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 299 transitions. [2018-10-15 15:32:03,119 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 299 transitions. Word has length 240 [2018-10-15 15:32:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:03,119 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 299 transitions. [2018-10-15 15:32:03,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:32:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 299 transitions. [2018-10-15 15:32:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-15 15:32:03,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:03,121 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:03,121 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:03,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash 542381131, now seen corresponding path program 3 times [2018-10-15 15:32:03,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1212 trivial. 0 not checked. [2018-10-15 15:32:03,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:32:03,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:32:03,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:32:03,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:32:03,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:32:03,383 INFO L87 Difference]: Start difference. First operand 292 states and 299 transitions. Second operand 4 states. [2018-10-15 15:32:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:03,560 INFO L93 Difference]: Finished difference Result 299 states and 306 transitions. [2018-10-15 15:32:03,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:32:03,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-10-15 15:32:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:03,563 INFO L225 Difference]: With dead ends: 299 [2018-10-15 15:32:03,563 INFO L226 Difference]: Without dead ends: 299 [2018-10-15 15:32:03,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:32:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-15 15:32:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 294. [2018-10-15 15:32:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-15 15:32:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 301 transitions. [2018-10-15 15:32:03,569 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 301 transitions. Word has length 285 [2018-10-15 15:32:03,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:03,570 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 301 transitions. [2018-10-15 15:32:03,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:32:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 301 transitions. [2018-10-15 15:32:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-15 15:32:03,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:03,572 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:03,572 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:03,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:03,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1779855037, now seen corresponding path program 1 times [2018-10-15 15:32:03,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1212 trivial. 0 not checked. [2018-10-15 15:32:03,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:03,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:32:03,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:32:03,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:32:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:32:03,870 INFO L87 Difference]: Start difference. First operand 294 states and 301 transitions. Second operand 6 states. [2018-10-15 15:32:04,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:04,072 INFO L93 Difference]: Finished difference Result 307 states and 314 transitions. [2018-10-15 15:32:04,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:32:04,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 293 [2018-10-15 15:32:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:04,076 INFO L225 Difference]: With dead ends: 307 [2018-10-15 15:32:04,076 INFO L226 Difference]: Without dead ends: 307 [2018-10-15 15:32:04,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:32:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-15 15:32:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2018-10-15 15:32:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 15:32:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 309 transitions. [2018-10-15 15:32:04,083 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 309 transitions. Word has length 293 [2018-10-15 15:32:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:04,084 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 309 transitions. [2018-10-15 15:32:04,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:32:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 309 transitions. [2018-10-15 15:32:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 15:32:04,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:04,087 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:04,087 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:04,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:04,088 INFO L82 PathProgramCache]: Analyzing trace with hash -413649105, now seen corresponding path program 2 times [2018-10-15 15:32:04,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1212 trivial. 0 not checked. [2018-10-15 15:32:04,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:04,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:32:04,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:32:04,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:32:04,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:32:04,497 INFO L87 Difference]: Start difference. First operand 302 states and 309 transitions. Second operand 8 states. [2018-10-15 15:32:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:04,746 INFO L93 Difference]: Finished difference Result 315 states and 322 transitions. [2018-10-15 15:32:04,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:32:04,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 301 [2018-10-15 15:32:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:04,751 INFO L225 Difference]: With dead ends: 315 [2018-10-15 15:32:04,751 INFO L226 Difference]: Without dead ends: 315 [2018-10-15 15:32:04,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:32:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-15 15:32:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 310. [2018-10-15 15:32:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-15 15:32:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 317 transitions. [2018-10-15 15:32:04,758 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 317 transitions. Word has length 301 [2018-10-15 15:32:04,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:04,759 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 317 transitions. [2018-10-15 15:32:04,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:32:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 317 transitions. [2018-10-15 15:32:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 15:32:04,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:04,761 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:04,761 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:04,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash 281767329, now seen corresponding path program 3 times [2018-10-15 15:32:04,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2018-10-15 15:32:05,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:05,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:32:05,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:32:05,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:32:05,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:05,633 INFO L87 Difference]: Start difference. First operand 310 states and 317 transitions. Second operand 10 states. [2018-10-15 15:32:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:06,151 INFO L93 Difference]: Finished difference Result 321 states and 328 transitions. [2018-10-15 15:32:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:32:06,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 309 [2018-10-15 15:32:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:06,153 INFO L225 Difference]: With dead ends: 321 [2018-10-15 15:32:06,154 INFO L226 Difference]: Without dead ends: 321 [2018-10-15 15:32:06,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:32:06,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-15 15:32:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2018-10-15 15:32:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-15 15:32:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 324 transitions. [2018-10-15 15:32:06,160 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 324 transitions. Word has length 309 [2018-10-15 15:32:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:06,161 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 324 transitions. [2018-10-15 15:32:06,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:32:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 324 transitions. [2018-10-15 15:32:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-15 15:32:06,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:06,163 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:06,163 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:06,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:06,163 INFO L82 PathProgramCache]: Analyzing trace with hash -344168785, now seen corresponding path program 4 times [2018-10-15 15:32:06,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2018-10-15 15:32:06,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:06,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:32:06,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:32:06,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:32:06,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:32:06,786 INFO L87 Difference]: Start difference. First operand 317 states and 324 transitions. Second operand 12 states. [2018-10-15 15:32:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:08,148 INFO L93 Difference]: Finished difference Result 324 states and 331 transitions. [2018-10-15 15:32:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:32:08,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 316 [2018-10-15 15:32:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:08,150 INFO L225 Difference]: With dead ends: 324 [2018-10-15 15:32:08,151 INFO L226 Difference]: Without dead ends: 324 [2018-10-15 15:32:08,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:32:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-15 15:32:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-10-15 15:32:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-15 15:32:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 331 transitions. [2018-10-15 15:32:08,160 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 331 transitions. Word has length 316 [2018-10-15 15:32:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:08,160 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 331 transitions. [2018-10-15 15:32:08,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:32:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 331 transitions. [2018-10-15 15:32:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-15 15:32:08,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:08,164 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:08,164 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:08,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1572979169, now seen corresponding path program 5 times [2018-10-15 15:32:08,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 496 proven. 240 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2018-10-15 15:32:09,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:09,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:32:09,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:32:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:32:09,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:09,177 INFO L87 Difference]: Start difference. First operand 324 states and 331 transitions. Second operand 10 states. [2018-10-15 15:32:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:09,492 INFO L93 Difference]: Finished difference Result 399 states and 406 transitions. [2018-10-15 15:32:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:32:09,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 323 [2018-10-15 15:32:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:09,494 INFO L225 Difference]: With dead ends: 399 [2018-10-15 15:32:09,494 INFO L226 Difference]: Without dead ends: 399 [2018-10-15 15:32:09,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:32:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-15 15:32:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 369. [2018-10-15 15:32:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-15 15:32:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 376 transitions. [2018-10-15 15:32:09,502 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 376 transitions. Word has length 323 [2018-10-15 15:32:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:09,502 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 376 transitions. [2018-10-15 15:32:09,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:32:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 376 transitions. [2018-10-15 15:32:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-15 15:32:09,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:09,506 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 20, 20, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:09,506 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:09,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1757974290, now seen corresponding path program 6 times [2018-10-15 15:32:09,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 788 proven. 446 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-10-15 15:32:10,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:10,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:32:10,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:32:10,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:32:10,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:32:10,111 INFO L87 Difference]: Start difference. First operand 369 states and 376 transitions. Second operand 12 states. [2018-10-15 15:32:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:10,399 INFO L93 Difference]: Finished difference Result 444 states and 451 transitions. [2018-10-15 15:32:10,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:32:10,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 368 [2018-10-15 15:32:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:10,402 INFO L225 Difference]: With dead ends: 444 [2018-10-15 15:32:10,402 INFO L226 Difference]: Without dead ends: 444 [2018-10-15 15:32:10,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:32:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-15 15:32:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 414. [2018-10-15 15:32:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-15 15:32:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 421 transitions. [2018-10-15 15:32:10,409 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 421 transitions. Word has length 368 [2018-10-15 15:32:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:10,410 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 421 transitions. [2018-10-15 15:32:10,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:32:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 421 transitions. [2018-10-15 15:32:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-15 15:32:10,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:10,413 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 25, 25, 25, 25, 25, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:10,413 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:10,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash 732338433, now seen corresponding path program 7 times [2018-10-15 15:32:10,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2018-10-15 15:32:10,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:10,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:32:10,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:32:10,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:32:10,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:32:10,918 INFO L87 Difference]: Start difference. First operand 414 states and 421 transitions. Second operand 10 states. [2018-10-15 15:32:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:11,187 INFO L93 Difference]: Finished difference Result 427 states and 434 transitions. [2018-10-15 15:32:11,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:32:11,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 413 [2018-10-15 15:32:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:11,190 INFO L225 Difference]: With dead ends: 427 [2018-10-15 15:32:11,191 INFO L226 Difference]: Without dead ends: 427 [2018-10-15 15:32:11,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:32:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-15 15:32:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 422. [2018-10-15 15:32:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-15 15:32:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 429 transitions. [2018-10-15 15:32:11,197 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 429 transitions. Word has length 413 [2018-10-15 15:32:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:11,198 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 429 transitions. [2018-10-15 15:32:11,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:32:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 429 transitions. [2018-10-15 15:32:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-15 15:32:11,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:11,201 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 25, 25, 25, 25, 25, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:11,201 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:11,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1253319309, now seen corresponding path program 8 times [2018-10-15 15:32:11,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3176 backedges. 190 proven. 920 refuted. 0 times theorem prover too weak. 2066 trivial. 0 not checked. [2018-10-15 15:32:11,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:11,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:32:11,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:32:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:32:11,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:32:11,926 INFO L87 Difference]: Start difference. First operand 422 states and 429 transitions. Second operand 14 states. [2018-10-15 15:32:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:12,370 INFO L93 Difference]: Finished difference Result 497 states and 504 transitions. [2018-10-15 15:32:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:32:12,371 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 421 [2018-10-15 15:32:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:12,374 INFO L225 Difference]: With dead ends: 497 [2018-10-15 15:32:12,374 INFO L226 Difference]: Without dead ends: 497 [2018-10-15 15:32:12,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=541, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:32:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-10-15 15:32:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 467. [2018-10-15 15:32:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-15 15:32:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 474 transitions. [2018-10-15 15:32:12,382 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 474 transitions. Word has length 421 [2018-10-15 15:32:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:12,382 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 474 transitions. [2018-10-15 15:32:12,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:32:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 474 transitions. [2018-10-15 15:32:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-15 15:32:12,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:12,386 INFO L375 BasicCegarLoop]: trace histogram [35, 30, 30, 30, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:12,386 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:12,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:12,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1397032128, now seen corresponding path program 9 times [2018-10-15 15:32:12,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4441 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4385 trivial. 0 not checked. [2018-10-15 15:32:12,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:12,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:32:12,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:32:12,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:32:12,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:32:12,800 INFO L87 Difference]: Start difference. First operand 467 states and 474 transitions. Second operand 12 states. [2018-10-15 15:32:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:13,128 INFO L93 Difference]: Finished difference Result 480 states and 487 transitions. [2018-10-15 15:32:13,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:32:13,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 466 [2018-10-15 15:32:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:13,131 INFO L225 Difference]: With dead ends: 480 [2018-10-15 15:32:13,131 INFO L226 Difference]: Without dead ends: 480 [2018-10-15 15:32:13,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:32:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-10-15 15:32:13,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 475. [2018-10-15 15:32:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-15 15:32:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 482 transitions. [2018-10-15 15:32:13,138 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 482 transitions. Word has length 466 [2018-10-15 15:32:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:13,139 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 482 transitions. [2018-10-15 15:32:13,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:32:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 482 transitions. [2018-10-15 15:32:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-15 15:32:13,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:13,142 INFO L375 BasicCegarLoop]: trace histogram [35, 30, 30, 30, 30, 30, 30, 30, 30, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:13,143 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:13,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1850371918, now seen corresponding path program 10 times [2018-10-15 15:32:13,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4475 backedges. 1588 proven. 1047 refuted. 0 times theorem prover too weak. 1840 trivial. 0 not checked. [2018-10-15 15:32:14,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:14,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 15:32:14,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 15:32:14,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 15:32:14,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:32:14,234 INFO L87 Difference]: Start difference. First operand 475 states and 482 transitions. Second operand 16 states. [2018-10-15 15:32:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:14,877 INFO L93 Difference]: Finished difference Result 550 states and 557 transitions. [2018-10-15 15:32:14,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 15:32:14,878 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 474 [2018-10-15 15:32:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:14,879 INFO L225 Difference]: With dead ends: 550 [2018-10-15 15:32:14,879 INFO L226 Difference]: Without dead ends: 550 [2018-10-15 15:32:14,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=366, Invalid=756, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:32:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-15 15:32:14,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 520. [2018-10-15 15:32:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-15 15:32:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 527 transitions. [2018-10-15 15:32:14,886 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 527 transitions. Word has length 474 [2018-10-15 15:32:14,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:14,887 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 527 transitions. [2018-10-15 15:32:14,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 15:32:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 527 transitions. [2018-10-15 15:32:14,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 15:32:14,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:14,890 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 35, 35, 35, 35, 35, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:14,891 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:14,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:14,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2117828357, now seen corresponding path program 11 times [2018-10-15 15:32:14,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 5875 trivial. 0 not checked. [2018-10-15 15:32:15,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:15,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:32:15,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:32:15,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:32:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:32:15,376 INFO L87 Difference]: Start difference. First operand 520 states and 527 transitions. Second operand 14 states. [2018-10-15 15:32:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:15,835 INFO L93 Difference]: Finished difference Result 533 states and 540 transitions. [2018-10-15 15:32:15,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:32:15,838 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 519 [2018-10-15 15:32:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:15,841 INFO L225 Difference]: With dead ends: 533 [2018-10-15 15:32:15,841 INFO L226 Difference]: Without dead ends: 533 [2018-10-15 15:32:15,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=541, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:32:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-15 15:32:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 528. [2018-10-15 15:32:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-15 15:32:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 535 transitions. [2018-10-15 15:32:15,848 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 535 transitions. Word has length 519 [2018-10-15 15:32:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:15,848 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 535 transitions. [2018-10-15 15:32:15,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:32:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 535 transitions. [2018-10-15 15:32:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-15 15:32:15,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:15,852 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 35, 35, 35, 35, 35, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:15,853 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:15,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:15,853 INFO L82 PathProgramCache]: Analyzing trace with hash 11304823, now seen corresponding path program 12 times [2018-10-15 15:32:15,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:16,519 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-15 15:32:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5993 trivial. 0 not checked. [2018-10-15 15:32:16,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:32:16,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 15:32:16,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:32:16,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:32:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:32:16,800 INFO L87 Difference]: Start difference. First operand 528 states and 535 transitions. Second operand 4 states. [2018-10-15 15:32:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:16,837 INFO L93 Difference]: Finished difference Result 75 states and 74 transitions. [2018-10-15 15:32:16,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:32:16,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 527 [2018-10-15 15:32:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:16,837 INFO L225 Difference]: With dead ends: 75 [2018-10-15 15:32:16,838 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:32:16,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:32:16,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:32:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:32:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:32:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:32:16,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 527 [2018-10-15 15:32:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:16,839 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:32:16,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:32:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:32:16,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:32:16,844 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:32:16 BasicIcfg [2018-10-15 15:32:16,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:32:16,845 INFO L168 Benchmark]: Toolchain (without parser) took 21841.41 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 420.5 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -425.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:32:16,846 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 15:32:16,846 INFO L168 Benchmark]: Boogie Preprocessor took 67.18 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 15:32:16,847 INFO L168 Benchmark]: RCFGBuilder took 791.97 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-15 15:32:16,848 INFO L168 Benchmark]: IcfgTransformer took 26.96 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 15:32:16,848 INFO L168 Benchmark]: TraceAbstraction took 20950.81 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 420.5 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -457.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:32:16,852 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.21 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 67.18 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 791.97 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * IcfgTransformer took 26.96 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 20950.81 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 420.5 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -457.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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, 116 locations, 1 error locations. SAFE Result, 20.8s OverallTime, 23 OverallIterations, 40 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2327 SDtfs, 2235 SDslu, 11071 SDs, 0 SdLazy, 2484 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=22, 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.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 372 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 6428 NumberOfCodeBlocks, 6428 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6405 ConstructedInterpolants, 0 QuantifiedInterpolants, 6028971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 34973/38021 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/eureka_01.i_6.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-32-16-863.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_01.i_6.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-32-16-863.csv Received shutdown request...