java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:07:31,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:07:31,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:07:31,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:07:31,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:07:31,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:07:31,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:07:31,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:07:31,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:07:31,175 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:07:31,175 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:07:31,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:07:31,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:07:31,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:07:31,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:07:31,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:07:31,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:07:31,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:07:31,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:07:31,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:07:31,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:07:31,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:07:31,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:07:31,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:07:31,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:07:31,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:07:31,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:07:31,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:07:31,194 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:07:31,195 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:07:31,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:07:31,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:07:31,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:07:31,197 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:07:31,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:07:31,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:07:31,199 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:07:31,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:07:31,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:07:31,215 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:07:31,215 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:07:31,215 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:07:31,215 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:07:31,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:07:31,216 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:07:31,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:07:31,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:07:31,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:07:31,221 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:07:31,221 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:07:31,223 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:07:31,223 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:07:31,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:07:31,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:07:31,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:07:31,301 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:07:31,301 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:07:31,302 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.BOUNDED-10.pals.c_11.bpl [2018-10-15 15:07:31,302 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl' [2018-10-15 15:07:31,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:07:31,372 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:07:31,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:07:31,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:07:31,373 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:07:31,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:31" (1/1) ... [2018-10-15 15:07:31,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:31" (1/1) ... [2018-10-15 15:07:31,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:31" (1/1) ... [2018-10-15 15:07:31,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:31" (1/1) ... [2018-10-15 15:07:31,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:31" (1/1) ... [2018-10-15 15:07:31,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:31" (1/1) ... [2018-10-15 15:07:31,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:31" (1/1) ... [2018-10-15 15:07:31,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:07:31,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:07:31,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:07:31,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:07:31,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:31" (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:07:31,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:07:31,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:07:32,637 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:07:32,638 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:32 BoogieIcfgContainer [2018-10-15 15:07:32,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:07:32,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:07:32,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:07:32,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:07:32,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:31" (1/2) ... [2018-10-15 15:07:32,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793547f5 and model type pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:07:32, skipping insertion in model container [2018-10-15 15:07:32,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:32" (2/2) ... [2018-10-15 15:07:32,646 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl [2018-10-15 15:07:32,656 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:07:32,667 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:07:32,682 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:07:32,709 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:07:32,710 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:07:32,710 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:07:32,710 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:07:32,710 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:07:32,710 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:07:32,711 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:07:32,711 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:07:32,711 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:07:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states. [2018-10-15 15:07:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-15 15:07:32,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:32,760 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] [2018-10-15 15:07:32,761 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:32,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1221381698, now seen corresponding path program 1 times [2018-10-15 15:07:32,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:33,347 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:07:33,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:33,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:33,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:33,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:33,375 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 3 states. [2018-10-15 15:07:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:33,476 INFO L93 Difference]: Finished difference Result 341 states and 352 transitions. [2018-10-15 15:07:33,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:33,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-10-15 15:07:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:33,508 INFO L225 Difference]: With dead ends: 341 [2018-10-15 15:07:33,508 INFO L226 Difference]: Without dead ends: 341 [2018-10-15 15:07:33,514 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:07:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-15 15:07:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2018-10-15 15:07:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-15 15:07:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 350 transitions. [2018-10-15 15:07:33,590 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 350 transitions. Word has length 228 [2018-10-15 15:07:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:33,592 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 350 transitions. [2018-10-15 15:07:33,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 350 transitions. [2018-10-15 15:07:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 15:07:33,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:33,597 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:07:33,598 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:33,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash 350188635, now seen corresponding path program 1 times [2018-10-15 15:07:33,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:33,910 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:07:33,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:33,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:07:33,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:07:33,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:07:33,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:07:33,914 INFO L87 Difference]: Start difference. First operand 338 states and 350 transitions. Second operand 8 states. [2018-10-15 15:07:34,535 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:07:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:35,363 INFO L93 Difference]: Finished difference Result 538 states and 561 transitions. [2018-10-15 15:07:35,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:07:35,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2018-10-15 15:07:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:35,369 INFO L225 Difference]: With dead ends: 538 [2018-10-15 15:07:35,369 INFO L226 Difference]: Without dead ends: 538 [2018-10-15 15:07:35,371 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:07:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-15 15:07:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 356. [2018-10-15 15:07:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-15 15:07:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 368 transitions. [2018-10-15 15:07:35,415 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 368 transitions. Word has length 230 [2018-10-15 15:07:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:35,416 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 368 transitions. [2018-10-15 15:07:35,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:07:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 368 transitions. [2018-10-15 15:07:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-15 15:07:35,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:35,428 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] [2018-10-15 15:07:35,429 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:35,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash 751795354, now seen corresponding path program 1 times [2018-10-15 15:07:35,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:35,699 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:07:35,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:35,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:35,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:35,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:35,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:35,701 INFO L87 Difference]: Start difference. First operand 356 states and 368 transitions. Second operand 3 states. [2018-10-15 15:07:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:35,763 INFO L93 Difference]: Finished difference Result 516 states and 537 transitions. [2018-10-15 15:07:35,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:35,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2018-10-15 15:07:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:35,771 INFO L225 Difference]: With dead ends: 516 [2018-10-15 15:07:35,771 INFO L226 Difference]: Without dead ends: 516 [2018-10-15 15:07:35,771 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:07:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-10-15 15:07:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 514. [2018-10-15 15:07:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-10-15 15:07:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 535 transitions. [2018-10-15 15:07:35,810 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 535 transitions. Word has length 231 [2018-10-15 15:07:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:35,811 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 535 transitions. [2018-10-15 15:07:35,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 535 transitions. [2018-10-15 15:07:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-15 15:07:35,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:35,816 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:07:35,817 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:35,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:35,817 INFO L82 PathProgramCache]: Analyzing trace with hash 930281913, now seen corresponding path program 1 times [2018-10-15 15:07:35,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:36,080 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:07:36,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:36,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:36,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:36,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:36,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:36,083 INFO L87 Difference]: Start difference. First operand 514 states and 535 transitions. Second operand 3 states. [2018-10-15 15:07:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:36,175 INFO L93 Difference]: Finished difference Result 697 states and 728 transitions. [2018-10-15 15:07:36,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:36,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-10-15 15:07:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:36,180 INFO L225 Difference]: With dead ends: 697 [2018-10-15 15:07:36,180 INFO L226 Difference]: Without dead ends: 697 [2018-10-15 15:07:36,181 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:07:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-10-15 15:07:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2018-10-15 15:07:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-15 15:07:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 726 transitions. [2018-10-15 15:07:36,199 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 726 transitions. Word has length 233 [2018-10-15 15:07:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:36,199 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 726 transitions. [2018-10-15 15:07:36,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 726 transitions. [2018-10-15 15:07:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 15:07:36,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:36,206 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, 1] [2018-10-15 15:07:36,206 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:36,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash -135809582, now seen corresponding path program 1 times [2018-10-15 15:07:36,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:36,532 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:07:36,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:36,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:36,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:36,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:36,534 INFO L87 Difference]: Start difference. First operand 694 states and 726 transitions. Second operand 3 states. [2018-10-15 15:07:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:36,629 INFO L93 Difference]: Finished difference Result 1201 states and 1259 transitions. [2018-10-15 15:07:36,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:36,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2018-10-15 15:07:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:36,637 INFO L225 Difference]: With dead ends: 1201 [2018-10-15 15:07:36,638 INFO L226 Difference]: Without dead ends: 1201 [2018-10-15 15:07:36,638 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:07:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2018-10-15 15:07:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1174. [2018-10-15 15:07:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-15 15:07:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1233 transitions. [2018-10-15 15:07:36,664 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1233 transitions. Word has length 299 [2018-10-15 15:07:36,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:36,665 INFO L481 AbstractCegarLoop]: Abstraction has 1174 states and 1233 transitions. [2018-10-15 15:07:36,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:36,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1233 transitions. [2018-10-15 15:07:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-15 15:07:36,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:36,670 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, 1] [2018-10-15 15:07:36,670 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:36,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:36,671 INFO L82 PathProgramCache]: Analyzing trace with hash -185378864, now seen corresponding path program 1 times [2018-10-15 15:07:36,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:36,905 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:07:36,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:36,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:36,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:36,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:36,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:36,907 INFO L87 Difference]: Start difference. First operand 1174 states and 1233 transitions. Second operand 3 states. [2018-10-15 15:07:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:37,009 INFO L93 Difference]: Finished difference Result 2143 states and 2249 transitions. [2018-10-15 15:07:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:37,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-10-15 15:07:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:37,019 INFO L225 Difference]: With dead ends: 2143 [2018-10-15 15:07:37,019 INFO L226 Difference]: Without dead ends: 2143 [2018-10-15 15:07:37,019 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:07:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2018-10-15 15:07:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2092. [2018-10-15 15:07:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2092 states. [2018-10-15 15:07:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2199 transitions. [2018-10-15 15:07:37,058 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2199 transitions. Word has length 300 [2018-10-15 15:07:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:37,059 INFO L481 AbstractCegarLoop]: Abstraction has 2092 states and 2199 transitions. [2018-10-15 15:07:37,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2199 transitions. [2018-10-15 15:07:37,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 15:07:37,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:37,063 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, 1] [2018-10-15 15:07:37,064 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:37,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:37,064 INFO L82 PathProgramCache]: Analyzing trace with hash 470087225, now seen corresponding path program 1 times [2018-10-15 15:07:37,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:37,256 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:07:37,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:37,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:37,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:37,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:37,258 INFO L87 Difference]: Start difference. First operand 2092 states and 2199 transitions. Second operand 3 states. [2018-10-15 15:07:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:37,345 INFO L93 Difference]: Finished difference Result 2095 states and 2189 transitions. [2018-10-15 15:07:37,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:37,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2018-10-15 15:07:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:37,355 INFO L225 Difference]: With dead ends: 2095 [2018-10-15 15:07:37,356 INFO L226 Difference]: Without dead ends: 2095 [2018-10-15 15:07:37,356 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:07:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2018-10-15 15:07:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2092. [2018-10-15 15:07:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2092 states. [2018-10-15 15:07:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2187 transitions. [2018-10-15 15:07:37,399 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2187 transitions. Word has length 301 [2018-10-15 15:07:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:37,400 INFO L481 AbstractCegarLoop]: Abstraction has 2092 states and 2187 transitions. [2018-10-15 15:07:37,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2187 transitions. [2018-10-15 15:07:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 15:07:37,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:37,405 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, 1] [2018-10-15 15:07:37,406 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:37,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash 939492379, now seen corresponding path program 2 times [2018-10-15 15:07:37,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:37,644 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:07:37,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:37,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:37,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:37,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:37,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:37,647 INFO L87 Difference]: Start difference. First operand 2092 states and 2187 transitions. Second operand 3 states. [2018-10-15 15:07:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:37,771 INFO L93 Difference]: Finished difference Result 3943 states and 4109 transitions. [2018-10-15 15:07:37,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:37,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2018-10-15 15:07:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:37,789 INFO L225 Difference]: With dead ends: 3943 [2018-10-15 15:07:37,789 INFO L226 Difference]: Without dead ends: 3943 [2018-10-15 15:07:37,790 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:07:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2018-10-15 15:07:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3844. [2018-10-15 15:07:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2018-10-15 15:07:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 4011 transitions. [2018-10-15 15:07:37,879 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 4011 transitions. Word has length 301 [2018-10-15 15:07:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:37,880 INFO L481 AbstractCegarLoop]: Abstraction has 3844 states and 4011 transitions. [2018-10-15 15:07:37,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 4011 transitions. [2018-10-15 15:07:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-15 15:07:37,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:37,886 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, 1] [2018-10-15 15:07:37,886 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:37,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:37,887 INFO L82 PathProgramCache]: Analyzing trace with hash 965386191, now seen corresponding path program 1 times [2018-10-15 15:07:37,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:38,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:07:38,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:38,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:38,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:38,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:38,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:38,132 INFO L87 Difference]: Start difference. First operand 3844 states and 4011 transitions. Second operand 3 states. [2018-10-15 15:07:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:38,225 INFO L93 Difference]: Finished difference Result 2011 states and 2081 transitions. [2018-10-15 15:07:38,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:38,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2018-10-15 15:07:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:38,236 INFO L225 Difference]: With dead ends: 2011 [2018-10-15 15:07:38,236 INFO L226 Difference]: Without dead ends: 2011 [2018-10-15 15:07:38,236 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:07:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2018-10-15 15:07:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 2008. [2018-10-15 15:07:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2018-10-15 15:07:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 2079 transitions. [2018-10-15 15:07:38,281 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 2079 transitions. Word has length 302 [2018-10-15 15:07:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:38,281 INFO L481 AbstractCegarLoop]: Abstraction has 2008 states and 2079 transitions. [2018-10-15 15:07:38,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2079 transitions. [2018-10-15 15:07:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-15 15:07:38,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:38,293 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, 1] [2018-10-15 15:07:38,294 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:38,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:38,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1162414099, now seen corresponding path program 2 times [2018-10-15 15:07:38,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:38,718 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:07:38,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:38,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:07:38,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:07:38,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:07:38,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:07:38,720 INFO L87 Difference]: Start difference. First operand 2008 states and 2079 transitions. Second operand 4 states. [2018-10-15 15:07:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:38,836 INFO L93 Difference]: Finished difference Result 3128 states and 3223 transitions. [2018-10-15 15:07:38,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:07:38,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2018-10-15 15:07:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:38,848 INFO L225 Difference]: With dead ends: 3128 [2018-10-15 15:07:38,849 INFO L226 Difference]: Without dead ends: 3128 [2018-10-15 15:07:38,849 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:07:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2018-10-15 15:07:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 3120. [2018-10-15 15:07:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2018-10-15 15:07:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 3215 transitions. [2018-10-15 15:07:38,902 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 3215 transitions. Word has length 302 [2018-10-15 15:07:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:38,903 INFO L481 AbstractCegarLoop]: Abstraction has 3120 states and 3215 transitions. [2018-10-15 15:07:38,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:07:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 3215 transitions. [2018-10-15 15:07:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-10-15 15:07:38,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:38,909 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, 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:07:38,910 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:38,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:38,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1245217114, now seen corresponding path program 3 times [2018-10-15 15:07:38,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 27 proven. 244 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-15 15:07:39,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:39,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:07:39,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:07:39,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:07:39,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:07:39,634 INFO L87 Difference]: Start difference. First operand 3120 states and 3215 transitions. Second operand 5 states. [2018-10-15 15:07:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:39,846 INFO L93 Difference]: Finished difference Result 4080 states and 4199 transitions. [2018-10-15 15:07:39,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:07:39,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 441 [2018-10-15 15:07:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:39,863 INFO L225 Difference]: With dead ends: 4080 [2018-10-15 15:07:39,864 INFO L226 Difference]: Without dead ends: 4080 [2018-10-15 15:07:39,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:07:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2018-10-15 15:07:39,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 4072. [2018-10-15 15:07:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4072 states. [2018-10-15 15:07:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 4191 transitions. [2018-10-15 15:07:39,938 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 4191 transitions. Word has length 441 [2018-10-15 15:07:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:39,939 INFO L481 AbstractCegarLoop]: Abstraction has 4072 states and 4191 transitions. [2018-10-15 15:07:39,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:07:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 4191 transitions. [2018-10-15 15:07:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2018-10-15 15:07:39,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:39,951 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:39,952 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:39,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash -218066483, now seen corresponding path program 4 times [2018-10-15 15:07:39,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 45 proven. 696 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-15 15:07:40,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:40,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:07:40,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:07:40,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:07:40,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:07:40,747 INFO L87 Difference]: Start difference. First operand 4072 states and 4191 transitions. Second operand 6 states. [2018-10-15 15:07:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:40,890 INFO L93 Difference]: Finished difference Result 5892 states and 6051 transitions. [2018-10-15 15:07:40,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:07:40,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 580 [2018-10-15 15:07:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:40,912 INFO L225 Difference]: With dead ends: 5892 [2018-10-15 15:07:40,912 INFO L226 Difference]: Without dead ends: 5892 [2018-10-15 15:07:40,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:07:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2018-10-15 15:07:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5184. [2018-10-15 15:07:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5184 states. [2018-10-15 15:07:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 5327 transitions. [2018-10-15 15:07:40,985 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 5327 transitions. Word has length 580 [2018-10-15 15:07:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:40,986 INFO L481 AbstractCegarLoop]: Abstraction has 5184 states and 5327 transitions. [2018-10-15 15:07:40,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:07:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 5327 transitions. [2018-10-15 15:07:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-15 15:07:40,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:40,998 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:40,999 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:40,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash -942408838, now seen corresponding path program 5 times [2018-10-15 15:07:41,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 907 proven. 151 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2018-10-15 15:07:43,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:43,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:07:43,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:07:43,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:07:43,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:07:43,387 INFO L87 Difference]: Start difference. First operand 5184 states and 5327 transitions. Second operand 11 states. [2018-10-15 15:07:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:44,826 INFO L93 Difference]: Finished difference Result 457 states and 458 transitions. [2018-10-15 15:07:44,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 15:07:44,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 719 [2018-10-15 15:07:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:44,827 INFO L225 Difference]: With dead ends: 457 [2018-10-15 15:07:44,827 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:07:44,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:07:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:07:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:07:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:07:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:07:44,829 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 719 [2018-10-15 15:07:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:44,830 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:07:44,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:07:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:07:44,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:07:44,835 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:07:44 BoogieIcfgContainer [2018-10-15 15:07:44,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:07:44,837 INFO L168 Benchmark]: Toolchain (without parser) took 13465.99 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.5 GB in the beginning and 1.2 GB in the end (delta: 283.5 MB). Peak memory consumption was 724.5 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:44,838 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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:07:44,839 INFO L168 Benchmark]: Boogie Preprocessor took 64.60 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:07:44,839 INFO L168 Benchmark]: RCFGBuilder took 1200.51 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:07:44,840 INFO L168 Benchmark]: TraceAbstraction took 12196.23 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.2 GB in the end (delta: 230.7 MB). Peak memory consumption was 671.6 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:44,844 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.15 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 64.60 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 1200.51 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. * TraceAbstraction took 12196.23 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.2 GB in the end (delta: 230.7 MB). Peak memory consumption was 671.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 467]: 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, 259 locations, 1 error locations. SAFE Result, 12.1s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3796 SDtfs, 2518 SDslu, 5763 SDs, 0 SdLazy, 434 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5184occurred in iteration=12, 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.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 1097 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 4467 NumberOfCodeBlocks, 4467 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4454 ConstructedInterpolants, 0 QuantifiedInterpolants, 7904544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 1955/3077 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.BOUNDED-10.pals.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-07-44-855.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-07-44-855.csv Received shutdown request...