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.6.1.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:07:40,951 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:07:40,953 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:07:40,965 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:07:40,966 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:07:40,967 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:07:40,968 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:07:40,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:07:40,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:07:40,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:07:40,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:07:40,974 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:07:40,975 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:07:40,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:07:40,977 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:07:40,977 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:07:40,978 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:07:40,980 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:07:40,982 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:07:40,984 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:07:40,985 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:07:40,986 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:07:40,989 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:07:40,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:07:40,989 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:07:40,991 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:07:40,992 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:07:40,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:07:40,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:07:40,995 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:07:40,995 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:07:40,996 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:07:40,996 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:07:40,996 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:07:40,997 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:07:40,998 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:07:40,998 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:41,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:07:41,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:07:41,010 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:07:41,010 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:07:41,011 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:07:41,013 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:07:41,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:07:41,014 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:07:41,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:07:41,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:07:41,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:07:41,015 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:07:41,015 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:07:41,016 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:07:41,016 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:07:41,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:07:41,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:07:41,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:07:41,099 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:07:41,100 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:07:41,100 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-15 15:07:41,101 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl' [2018-10-15 15:07:41,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:07:41,186 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:07:41,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:07:41,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:07:41,187 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:07:41,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/1) ... [2018-10-15 15:07:41,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:07:41,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:07:41,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:07:41,257 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:07:41,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (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:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:07:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:07:42,615 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:07:42,616 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:42 BoogieIcfgContainer [2018-10-15 15:07:42,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:07:42,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:07:42,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:07:42,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:07:42,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:41" (1/2) ... [2018-10-15 15:07:42,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1345e24f and model type pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:07:42, skipping insertion in model container [2018-10-15 15:07:42,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:42" (2/2) ... [2018-10-15 15:07:42,626 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-15 15:07:42,636 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:07:42,646 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:07:42,664 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:07:42,694 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:07:42,695 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:07:42,695 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:07:42,696 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:07:42,696 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:07:42,696 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:07:42,696 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:07:42,696 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:07:42,696 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:07:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-15 15:07:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 15:07:42,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:42,754 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:42,755 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:42,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:42,762 INFO L82 PathProgramCache]: Analyzing trace with hash -40739563, now seen corresponding path program 1 times [2018-10-15 15:07:42,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:43,443 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:43,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:43,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:43,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:43,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:43,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:43,480 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-15 15:07:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:43,643 INFO L93 Difference]: Finished difference Result 397 states and 410 transitions. [2018-10-15 15:07:43,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:43,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2018-10-15 15:07:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:43,667 INFO L225 Difference]: With dead ends: 397 [2018-10-15 15:07:43,667 INFO L226 Difference]: Without dead ends: 397 [2018-10-15 15:07:43,670 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:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-15 15:07:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 394. [2018-10-15 15:07:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-15 15:07:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 408 transitions. [2018-10-15 15:07:43,744 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 408 transitions. Word has length 269 [2018-10-15 15:07:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:43,745 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 408 transitions. [2018-10-15 15:07:43,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 408 transitions. [2018-10-15 15:07:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 15:07:43,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:43,752 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:43,752 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:43,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash 733495681, now seen corresponding path program 1 times [2018-10-15 15:07:43,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:44,130 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:44,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:44,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:07:44,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:07:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:07:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:07:44,135 INFO L87 Difference]: Start difference. First operand 394 states and 408 transitions. Second operand 8 states. [2018-10-15 15:07:45,235 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-15 15:07:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:45,327 INFO L93 Difference]: Finished difference Result 619 states and 646 transitions. [2018-10-15 15:07:45,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:07:45,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 270 [2018-10-15 15:07:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:45,342 INFO L225 Difference]: With dead ends: 619 [2018-10-15 15:07:45,342 INFO L226 Difference]: Without dead ends: 619 [2018-10-15 15:07:45,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:07:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-10-15 15:07:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 412. [2018-10-15 15:07:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-15 15:07:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 426 transitions. [2018-10-15 15:07:45,386 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 426 transitions. Word has length 270 [2018-10-15 15:07:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:45,387 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 426 transitions. [2018-10-15 15:07:45,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:07:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 426 transitions. [2018-10-15 15:07:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-15 15:07:45,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:45,393 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:45,393 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:45,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash -250588058, now seen corresponding path program 1 times [2018-10-15 15:07:45,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:45,744 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:45,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:45,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:45,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:45,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:45,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:45,747 INFO L87 Difference]: Start difference. First operand 412 states and 426 transitions. Second operand 3 states. [2018-10-15 15:07:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:45,843 INFO L93 Difference]: Finished difference Result 516 states and 536 transitions. [2018-10-15 15:07:45,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:45,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-10-15 15:07:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:45,847 INFO L225 Difference]: With dead ends: 516 [2018-10-15 15:07:45,847 INFO L226 Difference]: Without dead ends: 516 [2018-10-15 15:07:45,848 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:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-10-15 15:07:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 515. [2018-10-15 15:07:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-15 15:07:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 535 transitions. [2018-10-15 15:07:45,872 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 535 transitions. Word has length 271 [2018-10-15 15:07:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:45,873 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 535 transitions. [2018-10-15 15:07:45,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 535 transitions. [2018-10-15 15:07:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 15:07:45,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:45,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, 2, 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] [2018-10-15 15:07:45,886 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:45,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:45,887 INFO L82 PathProgramCache]: Analyzing trace with hash 965021740, now seen corresponding path program 1 times [2018-10-15 15:07:45,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:46,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:46,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:46,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:46,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:46,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:46,139 INFO L87 Difference]: Start difference. First operand 515 states and 535 transitions. Second operand 3 states. [2018-10-15 15:07:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:46,171 INFO L93 Difference]: Finished difference Result 821 states and 858 transitions. [2018-10-15 15:07:46,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:46,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-15 15:07:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:46,182 INFO L225 Difference]: With dead ends: 821 [2018-10-15 15:07:46,182 INFO L226 Difference]: Without dead ends: 821 [2018-10-15 15:07:46,183 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:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-10-15 15:07:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 806. [2018-10-15 15:07:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-15 15:07:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 844 transitions. [2018-10-15 15:07:46,201 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 844 transitions. Word has length 347 [2018-10-15 15:07:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:46,201 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 844 transitions. [2018-10-15 15:07:46,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 844 transitions. [2018-10-15 15:07:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:07:46,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:46,207 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:46,208 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:46,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:46,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1311319514, now seen corresponding path program 1 times [2018-10-15 15:07:46,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-15 15:07:46,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:46,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:46,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:46,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:46,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:46,401 INFO L87 Difference]: Start difference. First operand 806 states and 844 transitions. Second operand 3 states. [2018-10-15 15:07:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:46,461 INFO L93 Difference]: Finished difference Result 809 states and 843 transitions. [2018-10-15 15:07:46,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:46,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-15 15:07:46,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:46,466 INFO L225 Difference]: With dead ends: 809 [2018-10-15 15:07:46,466 INFO L226 Difference]: Without dead ends: 809 [2018-10-15 15:07:46,467 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:46,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-10-15 15:07:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 806. [2018-10-15 15:07:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-15 15:07:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 841 transitions. [2018-10-15 15:07:46,483 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 841 transitions. Word has length 348 [2018-10-15 15:07:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:46,485 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 841 transitions. [2018-10-15 15:07:46,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 841 transitions. [2018-10-15 15:07:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:07:46,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:46,492 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:46,493 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:46,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:46,493 INFO L82 PathProgramCache]: Analyzing trace with hash 807676942, now seen corresponding path program 2 times [2018-10-15 15:07:46,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:46,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:46,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:46,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:46,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:46,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:46,738 INFO L87 Difference]: Start difference. First operand 806 states and 841 transitions. Second operand 3 states. [2018-10-15 15:07:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:46,787 INFO L93 Difference]: Finished difference Result 1394 states and 1458 transitions. [2018-10-15 15:07:46,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:46,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-10-15 15:07:46,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:46,797 INFO L225 Difference]: With dead ends: 1394 [2018-10-15 15:07:46,797 INFO L226 Difference]: Without dead ends: 1394 [2018-10-15 15:07:46,798 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:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-10-15 15:07:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1367. [2018-10-15 15:07:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2018-10-15 15:07:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1432 transitions. [2018-10-15 15:07:46,826 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1432 transitions. Word has length 348 [2018-10-15 15:07:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:46,827 INFO L481 AbstractCegarLoop]: Abstraction has 1367 states and 1432 transitions. [2018-10-15 15:07:46,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1432 transitions. [2018-10-15 15:07:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:07:46,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:46,830 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:46,830 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:46,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:46,831 INFO L82 PathProgramCache]: Analyzing trace with hash 320118877, now seen corresponding path program 1 times [2018-10-15 15:07:46,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-15 15:07:47,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:47,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:47,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:47,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:47,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:47,112 INFO L87 Difference]: Start difference. First operand 1367 states and 1432 transitions. Second operand 3 states. [2018-10-15 15:07:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:47,194 INFO L93 Difference]: Finished difference Result 788 states and 816 transitions. [2018-10-15 15:07:47,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:47,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2018-10-15 15:07:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:47,198 INFO L225 Difference]: With dead ends: 788 [2018-10-15 15:07:47,199 INFO L226 Difference]: Without dead ends: 788 [2018-10-15 15:07:47,199 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:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-10-15 15:07:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 785. [2018-10-15 15:07:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-10-15 15:07:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 814 transitions. [2018-10-15 15:07:47,215 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 814 transitions. Word has length 349 [2018-10-15 15:07:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:47,216 INFO L481 AbstractCegarLoop]: Abstraction has 785 states and 814 transitions. [2018-10-15 15:07:47,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 814 transitions. [2018-10-15 15:07:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:07:47,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:47,220 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:47,221 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:47,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash -220712689, now seen corresponding path program 2 times [2018-10-15 15:07:47,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:47,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:47,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:47,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:47,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:47,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:47,500 INFO L87 Difference]: Start difference. First operand 785 states and 814 transitions. Second operand 3 states. [2018-10-15 15:07:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:47,604 INFO L93 Difference]: Finished difference Result 1352 states and 1404 transitions. [2018-10-15 15:07:47,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:47,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2018-10-15 15:07:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:47,611 INFO L225 Difference]: With dead ends: 1352 [2018-10-15 15:07:47,611 INFO L226 Difference]: Without dead ends: 1352 [2018-10-15 15:07:47,611 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:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2018-10-15 15:07:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1325. [2018-10-15 15:07:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2018-10-15 15:07:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1378 transitions. [2018-10-15 15:07:47,637 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1378 transitions. Word has length 349 [2018-10-15 15:07:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:47,638 INFO L481 AbstractCegarLoop]: Abstraction has 1325 states and 1378 transitions. [2018-10-15 15:07:47,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1378 transitions. [2018-10-15 15:07:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-15 15:07:47,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:47,642 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:47,643 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:47,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:47,643 INFO L82 PathProgramCache]: Analyzing trace with hash 655838365, now seen corresponding path program 1 times [2018-10-15 15:07:47,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-15 15:07:47,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:47,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:47,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:47,865 INFO L87 Difference]: Start difference. First operand 1325 states and 1378 transitions. Second operand 3 states. [2018-10-15 15:07:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:47,946 INFO L93 Difference]: Finished difference Result 767 states and 789 transitions. [2018-10-15 15:07:47,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:47,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2018-10-15 15:07:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:47,952 INFO L225 Difference]: With dead ends: 767 [2018-10-15 15:07:47,952 INFO L226 Difference]: Without dead ends: 767 [2018-10-15 15:07:47,952 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:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-10-15 15:07:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2018-10-15 15:07:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-10-15 15:07:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 787 transitions. [2018-10-15 15:07:47,971 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 787 transitions. Word has length 350 [2018-10-15 15:07:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:47,972 INFO L481 AbstractCegarLoop]: Abstraction has 764 states and 787 transitions. [2018-10-15 15:07:47,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 787 transitions. [2018-10-15 15:07:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-15 15:07:47,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:47,981 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:47,982 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:47,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash -715142933, now seen corresponding path program 2 times [2018-10-15 15:07:47,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:48,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:48,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:48,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:48,252 INFO L87 Difference]: Start difference. First operand 764 states and 787 transitions. Second operand 3 states. [2018-10-15 15:07:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:48,365 INFO L93 Difference]: Finished difference Result 1310 states and 1350 transitions. [2018-10-15 15:07:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:48,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2018-10-15 15:07:48,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:48,372 INFO L225 Difference]: With dead ends: 1310 [2018-10-15 15:07:48,372 INFO L226 Difference]: Without dead ends: 1310 [2018-10-15 15:07:48,373 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:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2018-10-15 15:07:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1283. [2018-10-15 15:07:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2018-10-15 15:07:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1324 transitions. [2018-10-15 15:07:48,403 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1324 transitions. Word has length 350 [2018-10-15 15:07:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:48,404 INFO L481 AbstractCegarLoop]: Abstraction has 1283 states and 1324 transitions. [2018-10-15 15:07:48,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1324 transitions. [2018-10-15 15:07:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-15 15:07:48,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:48,409 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:48,409 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:48,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash 788197709, now seen corresponding path program 1 times [2018-10-15 15:07:48,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:48,779 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:48,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:48,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:48,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:48,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:48,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:48,781 INFO L87 Difference]: Start difference. First operand 1283 states and 1324 transitions. Second operand 3 states. [2018-10-15 15:07:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:48,898 INFO L93 Difference]: Finished difference Result 2330 states and 2400 transitions. [2018-10-15 15:07:48,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:48,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2018-10-15 15:07:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:48,909 INFO L225 Difference]: With dead ends: 2330 [2018-10-15 15:07:48,909 INFO L226 Difference]: Without dead ends: 2330 [2018-10-15 15:07:48,909 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:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2018-10-15 15:07:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2279. [2018-10-15 15:07:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2018-10-15 15:07:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 2350 transitions. [2018-10-15 15:07:48,952 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 2350 transitions. Word has length 351 [2018-10-15 15:07:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:48,953 INFO L481 AbstractCegarLoop]: Abstraction has 2279 states and 2350 transitions. [2018-10-15 15:07:48,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2350 transitions. [2018-10-15 15:07:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 15:07:48,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:48,957 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:48,957 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:48,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:48,957 INFO L82 PathProgramCache]: Analyzing trace with hash 236754875, now seen corresponding path program 1 times [2018-10-15 15:07:48,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-15 15:07:49,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:49,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:49,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:49,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:49,160 INFO L87 Difference]: Start difference. First operand 2279 states and 2350 transitions. Second operand 3 states. [2018-10-15 15:07:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:49,244 INFO L93 Difference]: Finished difference Result 1244 states and 1272 transitions. [2018-10-15 15:07:49,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:49,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2018-10-15 15:07:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:49,250 INFO L225 Difference]: With dead ends: 1244 [2018-10-15 15:07:49,250 INFO L226 Difference]: Without dead ends: 1244 [2018-10-15 15:07:49,250 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:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2018-10-15 15:07:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1241. [2018-10-15 15:07:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2018-10-15 15:07:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1270 transitions. [2018-10-15 15:07:49,274 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1270 transitions. Word has length 352 [2018-10-15 15:07:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:49,274 INFO L481 AbstractCegarLoop]: Abstraction has 1241 states and 1270 transitions. [2018-10-15 15:07:49,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1270 transitions. [2018-10-15 15:07:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 15:07:49,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:49,278 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:49,278 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:49,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:49,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1314126131, now seen corresponding path program 2 times [2018-10-15 15:07:49,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-15 15:07:49,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:49,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:07:49,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:07:49,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:07:49,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:07:49,827 INFO L87 Difference]: Start difference. First operand 1241 states and 1270 transitions. Second operand 4 states. [2018-10-15 15:07:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:49,990 INFO L93 Difference]: Finished difference Result 1797 states and 1834 transitions. [2018-10-15 15:07:49,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:07:49,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2018-10-15 15:07:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:49,998 INFO L225 Difference]: With dead ends: 1797 [2018-10-15 15:07:49,999 INFO L226 Difference]: Without dead ends: 1797 [2018-10-15 15:07:49,999 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:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2018-10-15 15:07:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1793. [2018-10-15 15:07:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-10-15 15:07:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 1830 transitions. [2018-10-15 15:07:50,034 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 1830 transitions. Word has length 352 [2018-10-15 15:07:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:50,035 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 1830 transitions. [2018-10-15 15:07:50,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:07:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 1830 transitions. [2018-10-15 15:07:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-15 15:07:50,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:50,041 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:07:50,041 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:50,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1385508174, now seen corresponding path program 3 times [2018-10-15 15:07:50,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-15 15:07:52,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:52,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:07:52,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:07:52,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:07:52,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:07:52,385 INFO L87 Difference]: Start difference. First operand 1793 states and 1830 transitions. Second operand 11 states. [2018-10-15 15:07:52,719 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-15 15:07:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:54,141 INFO L93 Difference]: Finished difference Result 374 states and 373 transitions. [2018-10-15 15:07:54,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 15:07:54,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 510 [2018-10-15 15:07:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:54,143 INFO L225 Difference]: With dead ends: 374 [2018-10-15 15:07:54,143 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:07:54,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:07:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:07:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:07:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:07:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:07:54,146 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 510 [2018-10-15 15:07:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:54,146 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:07:54,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:07:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:07:54,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:07:54,152 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:07:54 BoogieIcfgContainer [2018-10-15 15:07:54,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:07:54,153 INFO L168 Benchmark]: Toolchain (without parser) took 12968.21 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.7 GB in the end (delta: -215.3 MB). Peak memory consumption was 225.6 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:54,154 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:54,155 INFO L168 Benchmark]: Boogie Preprocessor took 69.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:07:54,155 INFO L168 Benchmark]: RCFGBuilder took 1359.96 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:54,156 INFO L168 Benchmark]: TraceAbstraction took 11534.07 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: -268.2 MB). Peak memory consumption was 172.7 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:54,160 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.19 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 69.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1359.96 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 11534.07 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: -268.2 MB). Peak memory consumption was 172.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: 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, 303 locations, 1 error locations. SAFE Result, 11.4s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4884 SDtfs, 2366 SDslu, 6325 SDs, 0 SdLazy, 422 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2279occurred in iteration=11, 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, 14 MinimizatonAttempts, 374 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 4816 NumberOfCodeBlocks, 4816 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4802 ConstructedInterpolants, 0 QuantifiedInterpolants, 5719395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 769/962 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-07-54-170.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_12.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-07-54-170.csv Received shutdown request...