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.2.ufo.BOUNDED-10.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:33:32,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:33:32,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:33:32,297 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:33:32,299 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:33:32,300 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:33:32,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:33:32,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:33:32,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:33:32,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:33:32,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:33:32,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:33:32,322 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:33:32,324 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:33:32,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:33:32,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:33:32,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:33:32,334 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:33:32,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:33:32,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:33:32,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:33:32,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:33:32,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:33:32,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:33:32,353 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:33:32,354 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:33:32,355 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:33:32,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:33:32,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:33:32,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:33:32,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:33:32,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:33:32,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:33:32,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:33:32,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:33:32,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:33:32,366 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:32,384 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:33:32,384 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:33:32,385 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:33:32,385 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:33:32,386 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:33:32,387 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:33:32,388 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:33:32,388 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:33:32,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:33:32,389 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:33:32,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:33:32,390 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:33:32,390 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:33:32,391 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:33:32,391 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:33:32,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:33:32,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:33:32,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:33:32,498 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:33:32,499 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:33:32,500 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.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-10-15 15:33:32,501 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl' [2018-10-15 15:33:32,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:33:32,613 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:33:32,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:33:32,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:33:32,614 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:33:32,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/1) ... [2018-10-15 15:33:32,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:33:32,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:33:32,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:33:32,721 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:33:32,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (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:32,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:33:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:33:34,046 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:33:34,047 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:34 BoogieIcfgContainer [2018-10-15 15:33:34,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:33:34,047 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:33:34,048 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:33:34,049 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:33:34,053 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:34" (1/1) ... [2018-10-15 15:33:34,061 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:33:34,087 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:33:34 BasicIcfg [2018-10-15 15:33:34,087 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:33:34,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:33:34,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:33:34,092 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:33:34,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:33:32" (1/3) ... [2018-10-15 15:33:34,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4ab57e and model type pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:33:34, skipping insertion in model container [2018-10-15 15:33:34,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:33:34" (2/3) ... [2018-10-15 15:33:34,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4ab57e and model type pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:34, skipping insertion in model container [2018-10-15 15:33:34,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:33:34" (3/3) ... [2018-10-15 15:33:34,096 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bplleft_unchanged_by_heapseparator [2018-10-15 15:33:34,107 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:33:34,119 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:33:34,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:33:34,167 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:33:34,168 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:33:34,169 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:33:34,169 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:33:34,169 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:33:34,169 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:33:34,170 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:33:34,170 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:33:34,170 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:33:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states. [2018-10-15 15:33:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-15 15:33:34,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:34,222 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] [2018-10-15 15:33:34,223 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:34,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:34,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1493209006, now seen corresponding path program 1 times [2018-10-15 15:33:34,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:34,824 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:34,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:34,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:34,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:34,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:34,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:34,856 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 3 states. [2018-10-15 15:33:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:34,978 INFO L93 Difference]: Finished difference Result 339 states and 350 transitions. [2018-10-15 15:33:34,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:34,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-10-15 15:33:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:35,001 INFO L225 Difference]: With dead ends: 339 [2018-10-15 15:33:35,002 INFO L226 Difference]: Without dead ends: 339 [2018-10-15 15:33:35,004 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:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-15 15:33:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2018-10-15 15:33:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-15 15:33:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 348 transitions. [2018-10-15 15:33:35,071 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 348 transitions. Word has length 227 [2018-10-15 15:33:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:35,073 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 348 transitions. [2018-10-15 15:33:35,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 348 transitions. [2018-10-15 15:33:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 15:33:35,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:35,078 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:35,079 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:35,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash 905711279, now seen corresponding path program 1 times [2018-10-15 15:33:35,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:35,481 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:35,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:35,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:33:35,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:33:35,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:33:35,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:33:35,485 INFO L87 Difference]: Start difference. First operand 336 states and 348 transitions. Second operand 8 states. [2018-10-15 15:33:36,009 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 15:33:36,767 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-15 15:33:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:36,970 INFO L93 Difference]: Finished difference Result 534 states and 557 transitions. [2018-10-15 15:33:36,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:33:36,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 229 [2018-10-15 15:33:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:36,978 INFO L225 Difference]: With dead ends: 534 [2018-10-15 15:33:36,978 INFO L226 Difference]: Without dead ends: 534 [2018-10-15 15:33:36,980 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:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-10-15 15:33:37,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 354. [2018-10-15 15:33:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-15 15:33:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 366 transitions. [2018-10-15 15:33:37,008 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 366 transitions. Word has length 229 [2018-10-15 15:33:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:37,010 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 366 transitions. [2018-10-15 15:33:37,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:33:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 366 transitions. [2018-10-15 15:33:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 15:33:37,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:37,015 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:37,016 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:37,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:37,016 INFO L82 PathProgramCache]: Analyzing trace with hash 280342656, now seen corresponding path program 1 times [2018-10-15 15:33:37,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:37,265 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:37,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:37,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:37,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:37,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:37,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:37,267 INFO L87 Difference]: Start difference. First operand 354 states and 366 transitions. Second operand 3 states. [2018-10-15 15:33:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:37,373 INFO L93 Difference]: Finished difference Result 512 states and 533 transitions. [2018-10-15 15:33:37,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:37,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-15 15:33:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:37,381 INFO L225 Difference]: With dead ends: 512 [2018-10-15 15:33:37,381 INFO L226 Difference]: Without dead ends: 512 [2018-10-15 15:33:37,382 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:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-10-15 15:33:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2018-10-15 15:33:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-10-15 15:33:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 531 transitions. [2018-10-15 15:33:37,423 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 531 transitions. Word has length 230 [2018-10-15 15:33:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:37,425 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 531 transitions. [2018-10-15 15:33:37,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 531 transitions. [2018-10-15 15:33:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-15 15:33:37,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:37,434 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] [2018-10-15 15:33:37,434 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:37,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2106406343, now seen corresponding path program 1 times [2018-10-15 15:33:37,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:37,636 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:37,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:37,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:37,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:37,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:37,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:37,638 INFO L87 Difference]: Start difference. First operand 510 states and 531 transitions. Second operand 3 states. [2018-10-15 15:33:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:37,669 INFO L93 Difference]: Finished difference Result 693 states and 724 transitions. [2018-10-15 15:33:37,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:37,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-10-15 15:33:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:37,680 INFO L225 Difference]: With dead ends: 693 [2018-10-15 15:33:37,680 INFO L226 Difference]: Without dead ends: 693 [2018-10-15 15:33:37,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:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-10-15 15:33:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 690. [2018-10-15 15:33:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-15 15:33:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 722 transitions. [2018-10-15 15:33:37,698 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 722 transitions. Word has length 233 [2018-10-15 15:33:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:37,699 INFO L481 AbstractCegarLoop]: Abstraction has 690 states and 722 transitions. [2018-10-15 15:33:37,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 722 transitions. [2018-10-15 15:33:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 15:33:37,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:37,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, 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] [2018-10-15 15:33:37,705 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:37,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1135833360, now seen corresponding path program 1 times [2018-10-15 15:33:37,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:37,984 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:37,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:37,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:37,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:37,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:37,986 INFO L87 Difference]: Start difference. First operand 690 states and 722 transitions. Second operand 3 states. [2018-10-15 15:33:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:38,014 INFO L93 Difference]: Finished difference Result 1193 states and 1251 transitions. [2018-10-15 15:33:38,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:38,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-10-15 15:33:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:38,025 INFO L225 Difference]: With dead ends: 1193 [2018-10-15 15:33:38,025 INFO L226 Difference]: Without dead ends: 1193 [2018-10-15 15:33:38,026 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:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2018-10-15 15:33:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1166. [2018-10-15 15:33:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2018-10-15 15:33:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1225 transitions. [2018-10-15 15:33:38,053 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1225 transitions. Word has length 298 [2018-10-15 15:33:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:38,054 INFO L481 AbstractCegarLoop]: Abstraction has 1166 states and 1225 transitions. [2018-10-15 15:33:38,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1225 transitions. [2018-10-15 15:33:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 15:33:38,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:38,057 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, 1, 1] [2018-10-15 15:33:38,057 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:38,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash -279956326, now seen corresponding path program 1 times [2018-10-15 15:33:38,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-15 15:33:38,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:38,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:38,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:38,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:38,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:38,250 INFO L87 Difference]: Start difference. First operand 1166 states and 1225 transitions. Second operand 3 states. [2018-10-15 15:33:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:38,334 INFO L93 Difference]: Finished difference Result 1169 states and 1221 transitions. [2018-10-15 15:33:38,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:38,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2018-10-15 15:33:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:38,340 INFO L225 Difference]: With dead ends: 1169 [2018-10-15 15:33:38,340 INFO L226 Difference]: Without dead ends: 1169 [2018-10-15 15:33:38,341 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:38,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2018-10-15 15:33:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1166. [2018-10-15 15:33:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2018-10-15 15:33:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1219 transitions. [2018-10-15 15:33:38,362 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1219 transitions. Word has length 299 [2018-10-15 15:33:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:38,362 INFO L481 AbstractCegarLoop]: Abstraction has 1166 states and 1219 transitions. [2018-10-15 15:33:38,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1219 transitions. [2018-10-15 15:33:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 15:33:38,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:38,366 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, 1, 1] [2018-10-15 15:33:38,367 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:38,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash -228497764, now seen corresponding path program 2 times [2018-10-15 15:33:38,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:38,620 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:38,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:38,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:38,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:38,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:38,622 INFO L87 Difference]: Start difference. First operand 1166 states and 1219 transitions. Second operand 3 states. [2018-10-15 15:33:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:38,731 INFO L93 Difference]: Finished difference Result 2127 states and 2221 transitions. [2018-10-15 15:33:38,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:38,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2018-10-15 15:33:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:38,741 INFO L225 Difference]: With dead ends: 2127 [2018-10-15 15:33:38,741 INFO L226 Difference]: Without dead ends: 2127 [2018-10-15 15:33:38,742 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:38,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2018-10-15 15:33:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2076. [2018-10-15 15:33:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2076 states. [2018-10-15 15:33:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2171 transitions. [2018-10-15 15:33:38,781 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2171 transitions. Word has length 299 [2018-10-15 15:33:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:38,782 INFO L481 AbstractCegarLoop]: Abstraction has 2076 states and 2171 transitions. [2018-10-15 15:33:38,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2171 transitions. [2018-10-15 15:33:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-15 15:33:38,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:38,785 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, 1, 1] [2018-10-15 15:33:38,786 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:38,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash 510291218, now seen corresponding path program 1 times [2018-10-15 15:33:38,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-15 15:33:38,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:38,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:38,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:38,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:38,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:38,968 INFO L87 Difference]: Start difference. First operand 2076 states and 2171 transitions. Second operand 3 states. [2018-10-15 15:33:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:39,059 INFO L93 Difference]: Finished difference Result 1127 states and 1167 transitions. [2018-10-15 15:33:39,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:39,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-10-15 15:33:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:39,065 INFO L225 Difference]: With dead ends: 1127 [2018-10-15 15:33:39,065 INFO L226 Difference]: Without dead ends: 1127 [2018-10-15 15:33:39,066 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:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2018-10-15 15:33:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1124. [2018-10-15 15:33:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2018-10-15 15:33:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1165 transitions. [2018-10-15 15:33:39,090 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1165 transitions. Word has length 300 [2018-10-15 15:33:39,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:39,091 INFO L481 AbstractCegarLoop]: Abstraction has 1124 states and 1165 transitions. [2018-10-15 15:33:39,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1165 transitions. [2018-10-15 15:33:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-15 15:33:39,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:39,097 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, 1, 1] [2018-10-15 15:33:39,097 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:39,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:39,098 INFO L82 PathProgramCache]: Analyzing trace with hash 318579152, now seen corresponding path program 2 times [2018-10-15 15:33:39,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:39,406 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:39,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:39,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:39,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:39,408 INFO L87 Difference]: Start difference. First operand 1124 states and 1165 transitions. Second operand 3 states. [2018-10-15 15:33:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:39,521 INFO L93 Difference]: Finished difference Result 2043 states and 2113 transitions. [2018-10-15 15:33:39,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:39,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-10-15 15:33:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:39,531 INFO L225 Difference]: With dead ends: 2043 [2018-10-15 15:33:39,532 INFO L226 Difference]: Without dead ends: 2043 [2018-10-15 15:33:39,532 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:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2018-10-15 15:33:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1992. [2018-10-15 15:33:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2018-10-15 15:33:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2063 transitions. [2018-10-15 15:33:39,572 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2063 transitions. Word has length 300 [2018-10-15 15:33:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:39,573 INFO L481 AbstractCegarLoop]: Abstraction has 1992 states and 2063 transitions. [2018-10-15 15:33:39,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2063 transitions. [2018-10-15 15:33:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 15:33:39,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:39,576 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, 1, 1] [2018-10-15 15:33:39,577 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:39,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:39,577 INFO L82 PathProgramCache]: Analyzing trace with hash -593922915, now seen corresponding path program 1 times [2018-10-15 15:33:39,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:39,753 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:39,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:33:39,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:33:39,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:33:39,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:33:39,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:33:39,755 INFO L87 Difference]: Start difference. First operand 1992 states and 2063 transitions. Second operand 3 states. [2018-10-15 15:33:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:39,844 INFO L93 Difference]: Finished difference Result 1085 states and 1113 transitions. [2018-10-15 15:33:39,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:33:39,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2018-10-15 15:33:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:39,849 INFO L225 Difference]: With dead ends: 1085 [2018-10-15 15:33:39,849 INFO L226 Difference]: Without dead ends: 1085 [2018-10-15 15:33:39,850 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:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2018-10-15 15:33:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1082. [2018-10-15 15:33:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2018-10-15 15:33:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1111 transitions. [2018-10-15 15:33:39,867 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1111 transitions. Word has length 301 [2018-10-15 15:33:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:39,868 INFO L481 AbstractCegarLoop]: Abstraction has 1082 states and 1111 transitions. [2018-10-15 15:33:39,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:33:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1111 transitions. [2018-10-15 15:33:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 15:33:39,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:39,871 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, 1, 1] [2018-10-15 15:33:39,871 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:39,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:39,871 INFO L82 PathProgramCache]: Analyzing trace with hash 880345533, now seen corresponding path program 2 times [2018-10-15 15:33:39,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-15 15:33:40,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:40,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:33:40,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:33:40,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:33:40,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:33:40,317 INFO L87 Difference]: Start difference. First operand 1082 states and 1111 transitions. Second operand 4 states. [2018-10-15 15:33:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:40,482 INFO L93 Difference]: Finished difference Result 1638 states and 1675 transitions. [2018-10-15 15:33:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:33:40,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 301 [2018-10-15 15:33:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:40,491 INFO L225 Difference]: With dead ends: 1638 [2018-10-15 15:33:40,491 INFO L226 Difference]: Without dead ends: 1638 [2018-10-15 15:33:40,492 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:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2018-10-15 15:33:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1634. [2018-10-15 15:33:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2018-10-15 15:33:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1671 transitions. [2018-10-15 15:33:40,522 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1671 transitions. Word has length 301 [2018-10-15 15:33:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:40,523 INFO L481 AbstractCegarLoop]: Abstraction has 1634 states and 1671 transitions. [2018-10-15 15:33:40,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:33:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1671 transitions. [2018-10-15 15:33:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 15:33:40,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:40,527 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,527 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:40,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1356467358, now seen corresponding path program 3 times [2018-10-15 15:33:40,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:41,059 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-15 15:33:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 205 proven. 22 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-15 15:33:41,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:41,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:33:41,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:33:41,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:33:41,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:33:41,881 INFO L87 Difference]: Start difference. First operand 1634 states and 1671 transitions. Second operand 10 states. [2018-10-15 15:33:42,409 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-15 15:33:43,832 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-10-15 15:33:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:44,135 INFO L93 Difference]: Finished difference Result 331 states and 330 transitions. [2018-10-15 15:33:44,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:33:44,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 439 [2018-10-15 15:33:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:44,137 INFO L225 Difference]: With dead ends: 331 [2018-10-15 15:33:44,137 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:33:44,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:33:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:33:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:33:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:33:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:33:44,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 439 [2018-10-15 15:33:44,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:44,140 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:33:44,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:33:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:33:44,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:33:44,146 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:33:44 BasicIcfg [2018-10-15 15:33:44,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:33:44,147 INFO L168 Benchmark]: Toolchain (without parser) took 11535.78 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -291.1 MB). Peak memory consumption was 149.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:44,149 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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:44,149 INFO L168 Benchmark]: Boogie Preprocessor took 105.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:33:44,150 INFO L168 Benchmark]: RCFGBuilder took 1326.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:44,151 INFO L168 Benchmark]: IcfgTransformer took 39.87 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:44,151 INFO L168 Benchmark]: TraceAbstraction took 10057.97 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -343.9 MB). Peak memory consumption was 97.0 MB. Max. memory is 7.1 GB. [2018-10-15 15:33:44,155 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1326.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * IcfgTransformer took 39.87 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 10057.97 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -343.9 MB). Peak memory consumption was 97.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 465]: 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, 258 locations, 1 error locations. SAFE Result, 9.9s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3551 SDtfs, 1925 SDslu, 4884 SDs, 0 SdLazy, 406 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2076occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 330 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3456 NumberOfCodeBlocks, 3456 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3444 ConstructedInterpolants, 0 QuantifiedInterpolants, 3674832 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 622/675 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.2.ufo.BOUNDED-10.pals.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-33-44-168.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-33-44-168.csv Received shutdown request...