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.5.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:33:39,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:33:39,573 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:33:39,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:33:39,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:33:39,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:33:39,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:33:39,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:33:39,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:33:39,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:33:39,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:33:39,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:33:39,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:33:39,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:33:39,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:33:39,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:33:39,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:33:39,608 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:33:39,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:33:39,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:33:39,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:33:39,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:33:39,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:33:39,623 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:33:39,623 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:33:39,624 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:33:39,625 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:33:39,626 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:33:39,627 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:33:39,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:33:39,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:33:39,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:33:39,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:33:39,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:33:39,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:33:39,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:33:39,634 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:39,653 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:33:39,653 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:33:39,656 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:33:39,656 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:33:39,656 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:33:39,656 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:33:39,657 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:33:39,657 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:33:39,657 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:33:39,658 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:33:39,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:33:39,658 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:33:39,658 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:33:39,659 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:33:39,659 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:33:39,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:33:39,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:33:39,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:33:39,759 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:33:39,760 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:33:39,761 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.5.ufo.UNBOUNDED.pals.c_11.bpl [2018-10-15 15:33:39,761 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl' [2018-10-15 15:33:39,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:33:39,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:33:39,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:33:39,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:33:39,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:33:39,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:39" (1/1) ... [2018-10-15 15:33:39,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:39" (1/1) ... [2018-10-15 15:33:39,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:39" (1/1) ... [2018-10-15 15:33:39,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:39" (1/1) ... [2018-10-15 15:33:39,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:39" (1/1) ... [2018-10-15 15:33:39,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:39" (1/1) ... [2018-10-15 15:33:39,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:39" (1/1) ... [2018-10-15 15:33:39,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:33:39,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:33:39,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:33:39,940 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:33:39,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:39" (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:40,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:33:40,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:33:41,192 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:33:41,194 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:41 BoogieIcfgContainer [2018-10-15 15:33:41,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:33:41,195 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:33:41,195 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:33:41,196 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:33:41,200 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:41" (1/1) ... [2018-10-15 15:33:41,205 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:33:41,233 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:33:41 BasicIcfg [2018-10-15 15:33:41,233 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:33:41,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:33:41,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:33:41,238 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:33:41,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:39" (1/3) ... [2018-10-15 15:33:41,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606f9037 and model type pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:33:41, skipping insertion in model container [2018-10-15 15:33:41,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:41" (2/3) ... [2018-10-15 15:33:41,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606f9037 and model type pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:41, skipping insertion in model container [2018-10-15 15:33:41,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:33:41" (3/3) ... [2018-10-15 15:33:41,242 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bplleft_unchanged_by_heapseparator [2018-10-15 15:33:41,252 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:33:41,262 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:33:41,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:33:41,316 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:33:41,317 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:33:41,317 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:33:41,317 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:33:41,317 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:33:41,317 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:33:41,318 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:33:41,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:33:41,318 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:33:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states. [2018-10-15 15:33:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 15:33:41,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:41,385 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] [2018-10-15 15:33:41,386 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:41,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash 462403499, now seen corresponding path program 1 times [2018-10-15 15:33:41,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:41,965 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:41,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:41,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:41,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:41,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:41,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:41,995 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 3 states. [2018-10-15 15:33:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:42,112 INFO L93 Difference]: Finished difference Result 334 states and 345 transitions. [2018-10-15 15:33:42,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:42,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2018-10-15 15:33:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:42,139 INFO L225 Difference]: With dead ends: 334 [2018-10-15 15:33:42,139 INFO L226 Difference]: Without dead ends: 334 [2018-10-15 15:33:42,141 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:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-15 15:33:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2018-10-15 15:33:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-15 15:33:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 343 transitions. [2018-10-15 15:33:42,227 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 343 transitions. Word has length 229 [2018-10-15 15:33:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:42,230 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 343 transitions. [2018-10-15 15:33:42,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 343 transitions. [2018-10-15 15:33:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 15:33:42,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:42,243 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] [2018-10-15 15:33:42,243 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:42,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:42,247 INFO L82 PathProgramCache]: Analyzing trace with hash 884265706, now seen corresponding path program 1 times [2018-10-15 15:33:42,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:42,757 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:42,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:42,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:33:42,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:33:42,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:33:42,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:33:42,761 INFO L87 Difference]: Start difference. First operand 331 states and 343 transitions. Second operand 8 states. [2018-10-15 15:33:43,788 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:33:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:44,149 INFO L93 Difference]: Finished difference Result 525 states and 548 transitions. [2018-10-15 15:33:44,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:33:44,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 229 [2018-10-15 15:33:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:44,165 INFO L225 Difference]: With dead ends: 525 [2018-10-15 15:33:44,165 INFO L226 Difference]: Without dead ends: 525 [2018-10-15 15:33:44,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:33:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-15 15:33:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 349. [2018-10-15 15:33:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 15:33:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 361 transitions. [2018-10-15 15:33:44,217 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 361 transitions. Word has length 229 [2018-10-15 15:33:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:44,218 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 361 transitions. [2018-10-15 15:33:44,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:33:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 361 transitions. [2018-10-15 15:33:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 15:33:44,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:44,230 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] [2018-10-15 15:33:44,230 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:44,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash -841633821, now seen corresponding path program 1 times [2018-10-15 15:33:44,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:44,524 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:44,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:44,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:44,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:44,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:44,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:44,527 INFO L87 Difference]: Start difference. First operand 349 states and 361 transitions. Second operand 3 states. [2018-10-15 15:33:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:44,592 INFO L93 Difference]: Finished difference Result 438 states and 455 transitions. [2018-10-15 15:33:44,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:44,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-15 15:33:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:44,597 INFO L225 Difference]: With dead ends: 438 [2018-10-15 15:33:44,597 INFO L226 Difference]: Without dead ends: 438 [2018-10-15 15:33:44,598 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:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-10-15 15:33:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2018-10-15 15:33:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-15 15:33:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 453 transitions. [2018-10-15 15:33:44,612 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 453 transitions. Word has length 230 [2018-10-15 15:33:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:44,613 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 453 transitions. [2018-10-15 15:33:44,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 453 transitions. [2018-10-15 15:33:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-15 15:33:44,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:44,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,620 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:44,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:44,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1772155290, now seen corresponding path program 1 times [2018-10-15 15:33:44,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:44,924 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:44,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:44,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:44,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:44,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:44,927 INFO L87 Difference]: Start difference. First operand 436 states and 453 transitions. Second operand 3 states. [2018-10-15 15:33:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:45,000 INFO L93 Difference]: Finished difference Result 695 states and 726 transitions. [2018-10-15 15:33:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:45,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2018-10-15 15:33:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:45,007 INFO L225 Difference]: With dead ends: 695 [2018-10-15 15:33:45,007 INFO L226 Difference]: Without dead ends: 695 [2018-10-15 15:33:45,008 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,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-10-15 15:33:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 680. [2018-10-15 15:33:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-15 15:33:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 712 transitions. [2018-10-15 15:33:45,025 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 712 transitions. Word has length 295 [2018-10-15 15:33:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:45,025 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 712 transitions. [2018-10-15 15:33:45,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 712 transitions. [2018-10-15 15:33:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 15:33:45,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:45,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,031 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:45,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:45,032 INFO L82 PathProgramCache]: Analyzing trace with hash -867460556, now seen corresponding path program 1 times [2018-10-15 15:33:45,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-15 15:33:45,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:45,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:45,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:45,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:45,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:45,198 INFO L87 Difference]: Start difference. First operand 680 states and 712 transitions. Second operand 3 states. [2018-10-15 15:33:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:45,232 INFO L93 Difference]: Finished difference Result 683 states and 711 transitions. [2018-10-15 15:33:45,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:45,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-10-15 15:33:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:45,240 INFO L225 Difference]: With dead ends: 683 [2018-10-15 15:33:45,241 INFO L226 Difference]: Without dead ends: 683 [2018-10-15 15:33:45,241 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,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-10-15 15:33:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 680. [2018-10-15 15:33:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-15 15:33:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 709 transitions. [2018-10-15 15:33:45,253 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 709 transitions. Word has length 296 [2018-10-15 15:33:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:45,254 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 709 transitions. [2018-10-15 15:33:45,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 709 transitions. [2018-10-15 15:33:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 15:33:45,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:45,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,259 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:45,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:45,260 INFO L82 PathProgramCache]: Analyzing trace with hash -623398606, now seen corresponding path program 2 times [2018-10-15 15:33:45,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:45,503 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:45,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:45,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:45,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:45,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:45,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:45,505 INFO L87 Difference]: Start difference. First operand 680 states and 709 transitions. Second operand 3 states. [2018-10-15 15:33:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:45,611 INFO L93 Difference]: Finished difference Result 1174 states and 1226 transitions. [2018-10-15 15:33:45,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:45,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-10-15 15:33:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:45,619 INFO L225 Difference]: With dead ends: 1174 [2018-10-15 15:33:45,620 INFO L226 Difference]: Without dead ends: 1174 [2018-10-15 15:33:45,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2018-10-15 15:33:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1147. [2018-10-15 15:33:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2018-10-15 15:33:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1200 transitions. [2018-10-15 15:33:45,648 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1200 transitions. Word has length 296 [2018-10-15 15:33:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:45,649 INFO L481 AbstractCegarLoop]: Abstraction has 1147 states and 1200 transitions. [2018-10-15 15:33:45,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1200 transitions. [2018-10-15 15:33:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-15 15:33:45,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:45,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,653 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:45,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:45,653 INFO L82 PathProgramCache]: Analyzing trace with hash 967902360, now seen corresponding path program 1 times [2018-10-15 15:33:45,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-15 15:33:45,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:45,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:45,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:45,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:45,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:45,795 INFO L87 Difference]: Start difference. First operand 1147 states and 1200 transitions. Second operand 3 states. [2018-10-15 15:33:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:45,889 INFO L93 Difference]: Finished difference Result 662 states and 684 transitions. [2018-10-15 15:33:45,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:45,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-10-15 15:33:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:45,893 INFO L225 Difference]: With dead ends: 662 [2018-10-15 15:33:45,893 INFO L226 Difference]: Without dead ends: 662 [2018-10-15 15:33:45,894 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,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-10-15 15:33:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 659. [2018-10-15 15:33:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-10-15 15:33:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 682 transitions. [2018-10-15 15:33:45,907 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 682 transitions. Word has length 297 [2018-10-15 15:33:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:45,907 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 682 transitions. [2018-10-15 15:33:45,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 682 transitions. [2018-10-15 15:33:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-15 15:33:45,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:45,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,910 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:45,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:45,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1173421402, now seen corresponding path program 2 times [2018-10-15 15:33:45,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:46,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:46,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:46,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:46,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:46,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:46,059 INFO L87 Difference]: Start difference. First operand 659 states and 682 transitions. Second operand 3 states. [2018-10-15 15:33:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:46,167 INFO L93 Difference]: Finished difference Result 1132 states and 1172 transitions. [2018-10-15 15:33:46,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:46,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-10-15 15:33:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:46,174 INFO L225 Difference]: With dead ends: 1132 [2018-10-15 15:33:46,174 INFO L226 Difference]: Without dead ends: 1132 [2018-10-15 15:33:46,174 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:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-10-15 15:33:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1105. [2018-10-15 15:33:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2018-10-15 15:33:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1146 transitions. [2018-10-15 15:33:46,200 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1146 transitions. Word has length 297 [2018-10-15 15:33:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:46,201 INFO L481 AbstractCegarLoop]: Abstraction has 1105 states and 1146 transitions. [2018-10-15 15:33:46,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1146 transitions. [2018-10-15 15:33:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 15:33:46,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:46,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,205 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:46,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash 318672756, now seen corresponding path program 1 times [2018-10-15 15:33:46,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-15 15:33:46,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:46,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:46,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:46,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:46,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:46,444 INFO L87 Difference]: Start difference. First operand 1105 states and 1146 transitions. Second operand 3 states. [2018-10-15 15:33:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:46,533 INFO L93 Difference]: Finished difference Result 641 states and 657 transitions. [2018-10-15 15:33:46,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:46,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-10-15 15:33:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:46,542 INFO L225 Difference]: With dead ends: 641 [2018-10-15 15:33:46,542 INFO L226 Difference]: Without dead ends: 641 [2018-10-15 15:33:46,542 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:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-10-15 15:33:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 638. [2018-10-15 15:33:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-10-15 15:33:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 655 transitions. [2018-10-15 15:33:46,557 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 655 transitions. Word has length 298 [2018-10-15 15:33:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:46,557 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 655 transitions. [2018-10-15 15:33:46,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 655 transitions. [2018-10-15 15:33:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 15:33:46,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:46,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,561 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:46,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:46,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1293907314, now seen corresponding path program 2 times [2018-10-15 15:33:46,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:46,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:46,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:46,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:46,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:46,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:46,797 INFO L87 Difference]: Start difference. First operand 638 states and 655 transitions. Second operand 3 states. [2018-10-15 15:33:46,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:46,917 INFO L93 Difference]: Finished difference Result 1090 states and 1118 transitions. [2018-10-15 15:33:46,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:46,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-10-15 15:33:46,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:46,923 INFO L225 Difference]: With dead ends: 1090 [2018-10-15 15:33:46,923 INFO L226 Difference]: Without dead ends: 1090 [2018-10-15 15:33:46,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-10-15 15:33:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1063. [2018-10-15 15:33:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2018-10-15 15:33:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1092 transitions. [2018-10-15 15:33:46,947 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1092 transitions. Word has length 298 [2018-10-15 15:33:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:46,948 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 1092 transitions. [2018-10-15 15:33:46,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1092 transitions. [2018-10-15 15:33:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 15:33:46,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:46,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,951 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:46,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash -193319080, now seen corresponding path program 1 times [2018-10-15 15:33:46,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-15 15:33:47,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:47,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:47,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:47,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:47,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:47,132 INFO L87 Difference]: Start difference. First operand 1063 states and 1092 transitions. Second operand 3 states. [2018-10-15 15:33:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:47,215 INFO L93 Difference]: Finished difference Result 620 states and 630 transitions. [2018-10-15 15:33:47,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:47,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2018-10-15 15:33:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:47,219 INFO L225 Difference]: With dead ends: 620 [2018-10-15 15:33:47,219 INFO L226 Difference]: Without dead ends: 620 [2018-10-15 15:33:47,219 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:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-10-15 15:33:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 617. [2018-10-15 15:33:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-10-15 15:33:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 628 transitions. [2018-10-15 15:33:47,233 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 628 transitions. Word has length 299 [2018-10-15 15:33:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:47,233 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 628 transitions. [2018-10-15 15:33:47,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:47,234 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 628 transitions. [2018-10-15 15:33:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 15:33:47,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:47,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,236 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:47,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash 503212314, now seen corresponding path program 2 times [2018-10-15 15:33:47,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:47,664 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-15 15:33:47,892 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-15 15:33:48,293 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-15 15:33:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:48,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:48,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:33:48,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:33:48,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:33:48,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:33:48,581 INFO L87 Difference]: Start difference. First operand 617 states and 628 transitions. Second operand 10 states. [2018-10-15 15:33:48,853 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-10-15 15:33:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:50,195 INFO L93 Difference]: Finished difference Result 259 states and 258 transitions. [2018-10-15 15:33:50,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:33:50,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 299 [2018-10-15 15:33:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:50,196 INFO L225 Difference]: With dead ends: 259 [2018-10-15 15:33:50,197 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:33:50,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:33:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:33:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:33:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:33:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:33:50,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 299 [2018-10-15 15:33:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:50,199 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:33:50,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:33:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:33:50,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:33:50,205 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:50 BasicIcfg [2018-10-15 15:33:50,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:33:50,206 INFO L168 Benchmark]: Toolchain (without parser) took 10336.83 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 212.9 MB). Free memory was 1.5 GB in the beginning and 942.1 MB in the end (delta: 523.0 MB). Peak memory consumption was 735.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:50,208 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:33:50,208 INFO L168 Benchmark]: Boogie Preprocessor took 67.82 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:50,209 INFO L168 Benchmark]: RCFGBuilder took 1254.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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:50,210 INFO L168 Benchmark]: IcfgTransformer took 38.07 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:50,210 INFO L168 Benchmark]: TraceAbstraction took 8971.04 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 212.9 MB). Free memory was 1.4 GB in the beginning and 942.1 MB in the end (delta: 470.1 MB). Peak memory consumption was 683.0 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:50,215 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.82 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 1254.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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * IcfgTransformer took 38.07 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 8971.04 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 212.9 MB). Free memory was 1.4 GB in the beginning and 942.1 MB in the end (delta: 470.1 MB). Peak memory consumption was 683.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 463]: 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, 256 locations, 1 error locations. SAFE Result, 8.8s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3543 SDtfs, 1664 SDslu, 4691 SDs, 0 SdLazy, 354 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1147occurred in iteration=6, 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 289 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3363 NumberOfCodeBlocks, 3363 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3351 ConstructedInterpolants, 0 QuantifiedInterpolants, 3101625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 452/462 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.5.ufo.UNBOUNDED.pals.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-33-50-227.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-33-50-227.csv Received shutdown request...