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/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:33:43,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:33:43,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:33:43,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:33:43,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:33:43,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:33:43,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:33:43,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:33:43,130 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:33:43,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:33:43,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:33:43,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:33:43,133 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:33:43,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:33:43,136 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:33:43,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:33:43,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:33:43,139 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:33:43,143 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:33:43,146 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:33:43,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:33:43,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:33:43,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:33:43,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:33:43,158 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:33:43,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:33:43,160 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:33:43,160 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:33:43,161 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:33:43,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:33:43,166 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:33:43,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:33:43,170 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:33:43,170 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:33:43,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:33:43,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:33:43,173 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:33:43,183 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:33:43,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:33:43,184 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:33:43,184 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:33:43,184 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:33:43,185 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:33:43,185 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:33:43,186 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:33:43,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:33:43,186 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:33:43,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:33:43,187 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:33:43,187 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:33:43,188 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:33:43,188 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:33:43,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:33:43,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:33:43,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:33:43,250 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:33:43,251 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:33:43,251 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-15 15:33:43,252 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl' [2018-10-15 15:33:43,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:33:43,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:33:43,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:33:43,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:33:43,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:33:43,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:43" (1/1) ... [2018-10-15 15:33:43,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:43" (1/1) ... [2018-10-15 15:33:43,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:43" (1/1) ... [2018-10-15 15:33:43,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:43" (1/1) ... [2018-10-15 15:33:43,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:43" (1/1) ... [2018-10-15 15:33:43,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:43" (1/1) ... [2018-10-15 15:33:43,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:43" (1/1) ... [2018-10-15 15:33:43,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:33:43,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:33:43,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:33:43,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:33:43,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:43" (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:33:43,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:33:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:33:44,716 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:33:44,718 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:44 BoogieIcfgContainer [2018-10-15 15:33:44,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:33:44,718 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:33:44,719 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:33:44,720 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:33:44,723 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:44" (1/1) ... [2018-10-15 15:33:44,728 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:33:44,754 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:33:44 BasicIcfg [2018-10-15 15:33:44,754 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:33:44,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:33:44,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:33:44,759 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:33:44,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:43" (1/3) ... [2018-10-15 15:33:44,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9f795 and model type pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:33:44, skipping insertion in model container [2018-10-15 15:33:44,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:44" (2/3) ... [2018-10-15 15:33:44,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9f795 and model type pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:44, skipping insertion in model container [2018-10-15 15:33:44,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:33:44" (3/3) ... [2018-10-15 15:33:44,764 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bplleft_unchanged_by_heapseparator [2018-10-15 15:33:44,774 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:33:44,783 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:33:44,802 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:33:44,832 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:33:44,833 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:33:44,833 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:33:44,833 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:33:44,833 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:33:44,833 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:33:44,834 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:33:44,834 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:33:44,834 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:33:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2018-10-15 15:33:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-15 15:33:44,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:44,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:44,909 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:44,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:44,915 INFO L82 PathProgramCache]: Analyzing trace with hash 35005589, now seen corresponding path program 1 times [2018-10-15 15:33:44,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:45,569 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:33:45,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:45,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:45,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:45,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:45,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:45,596 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2018-10-15 15:33:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:45,720 INFO L93 Difference]: Finished difference Result 396 states and 409 transitions. [2018-10-15 15:33:45,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:45,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2018-10-15 15:33:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:45,743 INFO L225 Difference]: With dead ends: 396 [2018-10-15 15:33:45,743 INFO L226 Difference]: Without dead ends: 396 [2018-10-15 15:33:45,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-15 15:33:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2018-10-15 15:33:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-15 15:33:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 407 transitions. [2018-10-15 15:33:45,818 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 407 transitions. Word has length 267 [2018-10-15 15:33:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:45,820 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 407 transitions. [2018-10-15 15:33:45,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 407 transitions. [2018-10-15 15:33:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 15:33:45,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:45,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:45,827 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:45,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash -782829902, now seen corresponding path program 1 times [2018-10-15 15:33:45,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:46,324 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:33:46,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:46,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:33:46,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:33:46,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:33:46,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:33:46,329 INFO L87 Difference]: Start difference. First operand 393 states and 407 transitions. Second operand 8 states. [2018-10-15 15:33:47,096 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:33:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:47,646 INFO L93 Difference]: Finished difference Result 617 states and 644 transitions. [2018-10-15 15:33:47,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:33:47,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 269 [2018-10-15 15:33:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:47,654 INFO L225 Difference]: With dead ends: 617 [2018-10-15 15:33:47,655 INFO L226 Difference]: Without dead ends: 617 [2018-10-15 15:33:47,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:33:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-15 15:33:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 411. [2018-10-15 15:33:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-15 15:33:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 425 transitions. [2018-10-15 15:33:47,686 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 425 transitions. Word has length 269 [2018-10-15 15:33:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:47,687 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 425 transitions. [2018-10-15 15:33:47,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:33:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 425 transitions. [2018-10-15 15:33:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 15:33:47,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:47,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:47,693 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:47,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:47,694 INFO L82 PathProgramCache]: Analyzing trace with hash -524796518, now seen corresponding path program 1 times [2018-10-15 15:33:47,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:47,943 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:33:47,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:47,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:47,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:47,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:47,945 INFO L87 Difference]: Start difference. First operand 411 states and 425 transitions. Second operand 3 states. [2018-10-15 15:33:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:48,036 INFO L93 Difference]: Finished difference Result 595 states and 620 transitions. [2018-10-15 15:33:48,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:48,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2018-10-15 15:33:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:48,041 INFO L225 Difference]: With dead ends: 595 [2018-10-15 15:33:48,041 INFO L226 Difference]: Without dead ends: 595 [2018-10-15 15:33:48,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-10-15 15:33:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2018-10-15 15:33:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-10-15 15:33:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 618 transitions. [2018-10-15 15:33:48,066 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 618 transitions. Word has length 270 [2018-10-15 15:33:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:48,067 INFO L481 AbstractCegarLoop]: Abstraction has 593 states and 618 transitions. [2018-10-15 15:33:48,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 618 transitions. [2018-10-15 15:33:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-15 15:33:48,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:48,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:48,075 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:48,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1123989928, now seen corresponding path program 1 times [2018-10-15 15:33:48,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:48,315 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:33:48,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:48,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:48,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:48,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:48,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:48,318 INFO L87 Difference]: Start difference. First operand 593 states and 618 transitions. Second operand 3 states. [2018-10-15 15:33:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:48,392 INFO L93 Difference]: Finished difference Result 802 states and 839 transitions. [2018-10-15 15:33:48,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:48,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2018-10-15 15:33:48,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:48,397 INFO L225 Difference]: With dead ends: 802 [2018-10-15 15:33:48,397 INFO L226 Difference]: Without dead ends: 802 [2018-10-15 15:33:48,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-10-15 15:33:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 799. [2018-10-15 15:33:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2018-10-15 15:33:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 837 transitions. [2018-10-15 15:33:48,414 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 837 transitions. Word has length 273 [2018-10-15 15:33:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:48,415 INFO L481 AbstractCegarLoop]: Abstraction has 799 states and 837 transitions. [2018-10-15 15:33:48,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 837 transitions. [2018-10-15 15:33:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 15:33:48,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:48,422 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:48,422 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:48,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1057009863, now seen corresponding path program 1 times [2018-10-15 15:33:48,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:48,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:48,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:48,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:48,623 INFO L87 Difference]: Start difference. First operand 799 states and 837 transitions. Second operand 3 states. [2018-10-15 15:33:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:48,734 INFO L93 Difference]: Finished difference Result 1380 states and 1450 transitions. [2018-10-15 15:33:48,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:48,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-15 15:33:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:48,743 INFO L225 Difference]: With dead ends: 1380 [2018-10-15 15:33:48,743 INFO L226 Difference]: Without dead ends: 1380 [2018-10-15 15:33:48,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-10-15 15:33:48,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1353. [2018-10-15 15:33:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-10-15 15:33:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1424 transitions. [2018-10-15 15:33:48,772 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1424 transitions. Word has length 347 [2018-10-15 15:33:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:48,773 INFO L481 AbstractCegarLoop]: Abstraction has 1353 states and 1424 transitions. [2018-10-15 15:33:48,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1424 transitions. [2018-10-15 15:33:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:33:48,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:48,779 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:48,780 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:48,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:48,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2081983165, now seen corresponding path program 1 times [2018-10-15 15:33:48,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-15 15:33:48,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:48,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:48,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:48,984 INFO L87 Difference]: Start difference. First operand 1353 states and 1424 transitions. Second operand 3 states. [2018-10-15 15:33:49,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:49,065 INFO L93 Difference]: Finished difference Result 1356 states and 1420 transitions. [2018-10-15 15:33:49,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:49,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-15 15:33:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:49,072 INFO L225 Difference]: With dead ends: 1356 [2018-10-15 15:33:49,072 INFO L226 Difference]: Without dead ends: 1356 [2018-10-15 15:33:49,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2018-10-15 15:33:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1353. [2018-10-15 15:33:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-10-15 15:33:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1418 transitions. [2018-10-15 15:33:49,100 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1418 transitions. Word has length 348 [2018-10-15 15:33:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:49,100 INFO L481 AbstractCegarLoop]: Abstraction has 1353 states and 1418 transitions. [2018-10-15 15:33:49,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:49,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1418 transitions. [2018-10-15 15:33:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:33:49,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:49,104 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,104 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:49,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1310515601, now seen corresponding path program 2 times [2018-10-15 15:33:49,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:49,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:49,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:49,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:49,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:49,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:49,474 INFO L87 Difference]: Start difference. First operand 1353 states and 1418 transitions. Second operand 3 states. [2018-10-15 15:33:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:49,588 INFO L93 Difference]: Finished difference Result 2470 states and 2588 transitions. [2018-10-15 15:33:49,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:49,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-15 15:33:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:49,601 INFO L225 Difference]: With dead ends: 2470 [2018-10-15 15:33:49,601 INFO L226 Difference]: Without dead ends: 2470 [2018-10-15 15:33:49,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2018-10-15 15:33:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2419. [2018-10-15 15:33:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2419 states. [2018-10-15 15:33:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 2538 transitions. [2018-10-15 15:33:49,648 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 2538 transitions. Word has length 348 [2018-10-15 15:33:49,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:49,649 INFO L481 AbstractCegarLoop]: Abstraction has 2419 states and 2538 transitions. [2018-10-15 15:33:49,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2538 transitions. [2018-10-15 15:33:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:33:49,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:49,653 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,653 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:49,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:49,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1463675513, now seen corresponding path program 1 times [2018-10-15 15:33:49,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-15 15:33:49,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:49,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:49,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:49,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:49,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:49,874 INFO L87 Difference]: Start difference. First operand 2419 states and 2538 transitions. Second operand 3 states. [2018-10-15 15:33:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:49,962 INFO L93 Difference]: Finished difference Result 1314 states and 1366 transitions. [2018-10-15 15:33:49,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:49,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2018-10-15 15:33:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:49,968 INFO L225 Difference]: With dead ends: 1314 [2018-10-15 15:33:49,969 INFO L226 Difference]: Without dead ends: 1314 [2018-10-15 15:33:49,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-10-15 15:33:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1311. [2018-10-15 15:33:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2018-10-15 15:33:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1364 transitions. [2018-10-15 15:33:49,993 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1364 transitions. Word has length 349 [2018-10-15 15:33:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:49,993 INFO L481 AbstractCegarLoop]: Abstraction has 1311 states and 1364 transitions. [2018-10-15 15:33:49,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1364 transitions. [2018-10-15 15:33:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:33:49,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:49,999 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,999 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:49,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1668906247, now seen corresponding path program 2 times [2018-10-15 15:33:50,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:50,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:50,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:50,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:50,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:50,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:50,213 INFO L87 Difference]: Start difference. First operand 1311 states and 1364 transitions. Second operand 3 states. [2018-10-15 15:33:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:50,326 INFO L93 Difference]: Finished difference Result 2386 states and 2480 transitions. [2018-10-15 15:33:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:50,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2018-10-15 15:33:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:50,336 INFO L225 Difference]: With dead ends: 2386 [2018-10-15 15:33:50,337 INFO L226 Difference]: Without dead ends: 2386 [2018-10-15 15:33:50,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2018-10-15 15:33:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2335. [2018-10-15 15:33:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2018-10-15 15:33:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 2430 transitions. [2018-10-15 15:33:50,378 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 2430 transitions. Word has length 349 [2018-10-15 15:33:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:50,378 INFO L481 AbstractCegarLoop]: Abstraction has 2335 states and 2430 transitions. [2018-10-15 15:33:50,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2430 transitions. [2018-10-15 15:33:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-15 15:33:50,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:50,382 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:50,382 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:50,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:50,383 INFO L82 PathProgramCache]: Analyzing trace with hash 748811907, now seen corresponding path program 1 times [2018-10-15 15:33:50,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-15 15:33:50,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:50,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:50,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:50,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:50,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:50,590 INFO L87 Difference]: Start difference. First operand 2335 states and 2430 transitions. Second operand 3 states. [2018-10-15 15:33:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:50,674 INFO L93 Difference]: Finished difference Result 1272 states and 1312 transitions. [2018-10-15 15:33:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:50,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2018-10-15 15:33:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:50,680 INFO L225 Difference]: With dead ends: 1272 [2018-10-15 15:33:50,680 INFO L226 Difference]: Without dead ends: 1272 [2018-10-15 15:33:50,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2018-10-15 15:33:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1269. [2018-10-15 15:33:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2018-10-15 15:33:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1310 transitions. [2018-10-15 15:33:50,701 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1310 transitions. Word has length 350 [2018-10-15 15:33:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:50,702 INFO L481 AbstractCegarLoop]: Abstraction has 1269 states and 1310 transitions. [2018-10-15 15:33:50,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1310 transitions. [2018-10-15 15:33:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-15 15:33:50,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:50,705 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:50,706 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:50,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:50,706 INFO L82 PathProgramCache]: Analyzing trace with hash -606306863, now seen corresponding path program 2 times [2018-10-15 15:33:50,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:51,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:51,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:51,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:51,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:51,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:51,041 INFO L87 Difference]: Start difference. First operand 1269 states and 1310 transitions. Second operand 3 states. [2018-10-15 15:33:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:51,159 INFO L93 Difference]: Finished difference Result 2302 states and 2372 transitions. [2018-10-15 15:33:51,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:51,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2018-10-15 15:33:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:51,170 INFO L225 Difference]: With dead ends: 2302 [2018-10-15 15:33:51,171 INFO L226 Difference]: Without dead ends: 2302 [2018-10-15 15:33:51,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2018-10-15 15:33:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2251. [2018-10-15 15:33:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2251 states. [2018-10-15 15:33:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 2322 transitions. [2018-10-15 15:33:51,218 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 2322 transitions. Word has length 350 [2018-10-15 15:33:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:51,219 INFO L481 AbstractCegarLoop]: Abstraction has 2251 states and 2322 transitions. [2018-10-15 15:33:51,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 2322 transitions. [2018-10-15 15:33:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-15 15:33:51,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:51,224 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:51,225 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:51,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:51,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1799828551, now seen corresponding path program 1 times [2018-10-15 15:33:51,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-15 15:33:51,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:51,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:51,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:51,492 INFO L87 Difference]: Start difference. First operand 2251 states and 2322 transitions. Second operand 3 states. [2018-10-15 15:33:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:51,581 INFO L93 Difference]: Finished difference Result 1230 states and 1258 transitions. [2018-10-15 15:33:51,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:51,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2018-10-15 15:33:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:51,588 INFO L225 Difference]: With dead ends: 1230 [2018-10-15 15:33:51,588 INFO L226 Difference]: Without dead ends: 1230 [2018-10-15 15:33:51,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2018-10-15 15:33:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1227. [2018-10-15 15:33:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2018-10-15 15:33:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1256 transitions. [2018-10-15 15:33:51,615 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1256 transitions. Word has length 351 [2018-10-15 15:33:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:51,616 INFO L481 AbstractCegarLoop]: Abstraction has 1227 states and 1256 transitions. [2018-10-15 15:33:51,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1256 transitions. [2018-10-15 15:33:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-15 15:33:51,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:51,619 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:51,619 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:51,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:51,620 INFO L82 PathProgramCache]: Analyzing trace with hash -477292871, now seen corresponding path program 2 times [2018-10-15 15:33:51,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:52,039 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 3 [2018-10-15 15:33:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-15 15:33:52,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:52,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:33:52,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:33:52,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:33:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:33:52,183 INFO L87 Difference]: Start difference. First operand 1227 states and 1256 transitions. Second operand 4 states. [2018-10-15 15:33:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:52,348 INFO L93 Difference]: Finished difference Result 1859 states and 1896 transitions. [2018-10-15 15:33:52,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:33:52,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-10-15 15:33:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:52,359 INFO L225 Difference]: With dead ends: 1859 [2018-10-15 15:33:52,360 INFO L226 Difference]: Without dead ends: 1859 [2018-10-15 15:33:52,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:33:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2018-10-15 15:33:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1855. [2018-10-15 15:33:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1855 states. [2018-10-15 15:33:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 1892 transitions. [2018-10-15 15:33:52,393 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 1892 transitions. Word has length 351 [2018-10-15 15:33:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:52,394 INFO L481 AbstractCegarLoop]: Abstraction has 1855 states and 1892 transitions. [2018-10-15 15:33:52,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:33:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 1892 transitions. [2018-10-15 15:33:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-10-15 15:33:52,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:52,401 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:52,402 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:52,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:52,403 INFO L82 PathProgramCache]: Analyzing trace with hash -143421218, now seen corresponding path program 3 times [2018-10-15 15:33:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 27 proven. 280 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-15 15:33:53,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:53,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:33:53,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:33:53,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:33:53,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:33:53,307 INFO L87 Difference]: Start difference. First operand 1855 states and 1892 transitions. Second operand 5 states. [2018-10-15 15:33:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:53,521 INFO L93 Difference]: Finished difference Result 2487 states and 2532 transitions. [2018-10-15 15:33:53,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:33:53,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 508 [2018-10-15 15:33:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:53,535 INFO L225 Difference]: With dead ends: 2487 [2018-10-15 15:33:53,535 INFO L226 Difference]: Without dead ends: 2487 [2018-10-15 15:33:53,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:33:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2018-10-15 15:33:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2483. [2018-10-15 15:33:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2483 states. [2018-10-15 15:33:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 2528 transitions. [2018-10-15 15:33:53,588 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 2528 transitions. Word has length 508 [2018-10-15 15:33:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:53,589 INFO L481 AbstractCegarLoop]: Abstraction has 2483 states and 2528 transitions. [2018-10-15 15:33:53,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:33:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 2528 transitions. [2018-10-15 15:33:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2018-10-15 15:33:53,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:53,601 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:53,601 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:53,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash -938380071, now seen corresponding path program 4 times [2018-10-15 15:33:53,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:54,380 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-15 15:33:54,599 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-15 15:33:54,981 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-10-15 15:33:55,295 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-10-15 15:33:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 382 proven. 14 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2018-10-15 15:33:55,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:55,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:33:55,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:33:55,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:33:55,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:33:55,950 INFO L87 Difference]: Start difference. First operand 2483 states and 2528 transitions. Second operand 10 states. [2018-10-15 15:33:56,386 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-15 15:33:57,305 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-10-15 15:33:57,596 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-10-15 15:33:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:58,111 INFO L93 Difference]: Finished difference Result 339 states and 338 transitions. [2018-10-15 15:33:58,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:33:58,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 665 [2018-10-15 15:33:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:58,112 INFO L225 Difference]: With dead ends: 339 [2018-10-15 15:33:58,112 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:33:58,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:33:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:33:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:33:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:33:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:33:58,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 665 [2018-10-15 15:33:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:58,114 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:33:58,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:33:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:33:58,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:33:58,120 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:58 BasicIcfg [2018-10-15 15:33:58,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:33:58,121 INFO L168 Benchmark]: Toolchain (without parser) took 14772.98 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 666.4 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -681.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:33:58,122 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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:33:58,123 INFO L168 Benchmark]: Boogie Preprocessor took 98.92 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:33:58,123 INFO L168 Benchmark]: RCFGBuilder took 1268.68 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:58,124 INFO L168 Benchmark]: IcfgTransformer took 36.08 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:33:58,125 INFO L168 Benchmark]: TraceAbstraction took 13364.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 666.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -734.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:33:58,129 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.22 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 98.92 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 1268.68 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * IcfgTransformer took 36.08 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 13364.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 666.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -734.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: 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, 302 locations, 1 error locations. SAFE Result, 13.2s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5195 SDtfs, 2623 SDslu, 6717 SDs, 0 SdLazy, 422 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2483occurred in iteration=14, 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.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 414 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 5395 NumberOfCodeBlocks, 5395 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5380 ConstructedInterpolants, 0 QuantifiedInterpolants, 7702102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 1509/1840 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/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-33-58-141.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-33-58-141.csv Received shutdown request...