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/s3_srvr_1.BV.c.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:08:45,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:08:45,199 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:08:45,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:08:45,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:08:45,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:08:45,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:08:45,224 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:08:45,226 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:08:45,227 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:08:45,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:08:45,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:08:45,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:08:45,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:08:45,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:08:45,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:08:45,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:08:45,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:08:45,239 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:08:45,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:08:45,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:08:45,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:08:45,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:08:45,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:08:45,246 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:08:45,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:08:45,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:08:45,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:08:45,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:08:45,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:08:45,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:08:45,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:08:45,252 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:08:45,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:08:45,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:08:45,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:08:45,255 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:08:45,264 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:08:45,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:08:45,266 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:08:45,266 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:08:45,266 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:08:45,266 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:08:45,267 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:08:45,267 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:08:45,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:08:45,268 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:08:45,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:08:45,268 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:08:45,268 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:08:45,269 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:08:45,269 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:08:45,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:08:45,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:08:45,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:08:45,334 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:08:45,334 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:08:45,335 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl [2018-10-15 15:08:45,335 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl' [2018-10-15 15:08:45,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:08:45,456 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:08:45,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:08:45,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:08:45,457 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:08:45,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:45" (1/1) ... [2018-10-15 15:08:45,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:45" (1/1) ... [2018-10-15 15:08:45,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:45" (1/1) ... [2018-10-15 15:08:45,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:45" (1/1) ... [2018-10-15 15:08:45,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:45" (1/1) ... [2018-10-15 15:08:45,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:45" (1/1) ... [2018-10-15 15:08:45,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:45" (1/1) ... [2018-10-15 15:08:45,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:08:45,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:08:45,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:08:45,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:08:45,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:45" (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:08:45,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:08:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:08:46,860 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:08:46,861 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:08:46 BoogieIcfgContainer [2018-10-15 15:08:46,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:08:46,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:08:46,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:08:46,866 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:08:46,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:45" (1/2) ... [2018-10-15 15:08:46,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676c325c and model type s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:08:46, skipping insertion in model container [2018-10-15 15:08:46,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:08:46" (2/2) ... [2018-10-15 15:08:46,869 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.BV.c.cil.c_21.bpl [2018-10-15 15:08:46,880 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:08:46,894 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:08:46,912 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:08:46,947 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:08:46,948 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:08:46,948 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:08:46,948 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:08:46,948 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:08:46,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:08:46,949 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:08:46,949 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:08:46,949 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:08:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states. [2018-10-15 15:08:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 15:08:47,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:47,008 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] [2018-10-15 15:08:47,010 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:47,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:47,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1278975486, now seen corresponding path program 1 times [2018-10-15 15:08:47,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:47,387 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:08:47,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:47,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:47,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:47,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:47,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:47,417 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 3 states. [2018-10-15 15:08:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:47,667 INFO L93 Difference]: Finished difference Result 398 states and 421 transitions. [2018-10-15 15:08:47,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:47,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2018-10-15 15:08:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:47,694 INFO L225 Difference]: With dead ends: 398 [2018-10-15 15:08:47,694 INFO L226 Difference]: Without dead ends: 394 [2018-10-15 15:08:47,697 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:08:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-15 15:08:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 389. [2018-10-15 15:08:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-15 15:08:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 412 transitions. [2018-10-15 15:08:47,779 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 412 transitions. Word has length 157 [2018-10-15 15:08:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:47,780 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 412 transitions. [2018-10-15 15:08:47,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 412 transitions. [2018-10-15 15:08:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 15:08:47,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:47,796 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 15:08:47,796 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:47,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:47,797 INFO L82 PathProgramCache]: Analyzing trace with hash 723296173, now seen corresponding path program 1 times [2018-10-15 15:08:47,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:08:47,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:47,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:47,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:47,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:47,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:47,982 INFO L87 Difference]: Start difference. First operand 389 states and 412 transitions. Second operand 3 states. [2018-10-15 15:08:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:48,237 INFO L93 Difference]: Finished difference Result 406 states and 429 transitions. [2018-10-15 15:08:48,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:48,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-10-15 15:08:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:48,242 INFO L225 Difference]: With dead ends: 406 [2018-10-15 15:08:48,243 INFO L226 Difference]: Without dead ends: 406 [2018-10-15 15:08:48,244 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:08:48,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-15 15:08:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2018-10-15 15:08:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-10-15 15:08:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 429 transitions. [2018-10-15 15:08:48,274 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 429 transitions. Word has length 181 [2018-10-15 15:08:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:48,275 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 429 transitions. [2018-10-15 15:08:48,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 429 transitions. [2018-10-15 15:08:48,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-15 15:08:48,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:48,292 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-15 15:08:48,292 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:48,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:48,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1577119735, now seen corresponding path program 1 times [2018-10-15 15:08:48,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-15 15:08:48,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:48,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:48,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:48,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:48,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:48,488 INFO L87 Difference]: Start difference. First operand 406 states and 429 transitions. Second operand 3 states. [2018-10-15 15:08:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:48,790 INFO L93 Difference]: Finished difference Result 425 states and 448 transitions. [2018-10-15 15:08:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:48,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2018-10-15 15:08:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:48,795 INFO L225 Difference]: With dead ends: 425 [2018-10-15 15:08:48,795 INFO L226 Difference]: Without dead ends: 425 [2018-10-15 15:08:48,796 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:08:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-15 15:08:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-10-15 15:08:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-15 15:08:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 448 transitions. [2018-10-15 15:08:48,814 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 448 transitions. Word has length 207 [2018-10-15 15:08:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:48,815 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 448 transitions. [2018-10-15 15:08:48,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 448 transitions. [2018-10-15 15:08:48,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 15:08:48,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:48,820 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-10-15 15:08:48,820 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:48,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:48,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1847756234, now seen corresponding path program 1 times [2018-10-15 15:08:48,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-15 15:08:48,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:48,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:48,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:48,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:48,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:48,964 INFO L87 Difference]: Start difference. First operand 425 states and 448 transitions. Second operand 3 states. [2018-10-15 15:08:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:49,187 INFO L93 Difference]: Finished difference Result 467 states and 490 transitions. [2018-10-15 15:08:49,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:49,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-15 15:08:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:49,194 INFO L225 Difference]: With dead ends: 467 [2018-10-15 15:08:49,194 INFO L226 Difference]: Without dead ends: 467 [2018-10-15 15:08:49,194 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:08:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-15 15:08:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2018-10-15 15:08:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-15 15:08:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 490 transitions. [2018-10-15 15:08:49,211 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 490 transitions. Word has length 230 [2018-10-15 15:08:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:49,212 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 490 transitions. [2018-10-15 15:08:49,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 490 transitions. [2018-10-15 15:08:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-15 15:08:49,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:49,217 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2018-10-15 15:08:49,218 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:49,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:49,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1795534954, now seen corresponding path program 1 times [2018-10-15 15:08:49,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-10-15 15:08:49,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:49,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:49,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:49,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:49,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:49,370 INFO L87 Difference]: Start difference. First operand 467 states and 490 transitions. Second operand 3 states. [2018-10-15 15:08:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:49,676 INFO L93 Difference]: Finished difference Result 513 states and 536 transitions. [2018-10-15 15:08:49,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:49,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-15 15:08:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:49,681 INFO L225 Difference]: With dead ends: 513 [2018-10-15 15:08:49,681 INFO L226 Difference]: Without dead ends: 513 [2018-10-15 15:08:49,682 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:08:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-15 15:08:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2018-10-15 15:08:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-15 15:08:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 536 transitions. [2018-10-15 15:08:49,704 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 536 transitions. Word has length 261 [2018-10-15 15:08:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:49,705 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 536 transitions. [2018-10-15 15:08:49,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 536 transitions. [2018-10-15 15:08:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-15 15:08:49,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:49,713 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2018-10-15 15:08:49,714 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:49,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:49,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1703433482, now seen corresponding path program 1 times [2018-10-15 15:08:49,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-15 15:08:49,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:49,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:49,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:49,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:49,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:49,958 INFO L87 Difference]: Start difference. First operand 513 states and 536 transitions. Second operand 3 states. [2018-10-15 15:08:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:50,507 INFO L93 Difference]: Finished difference Result 567 states and 590 transitions. [2018-10-15 15:08:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:50,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2018-10-15 15:08:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:50,514 INFO L225 Difference]: With dead ends: 567 [2018-10-15 15:08:50,514 INFO L226 Difference]: Without dead ends: 567 [2018-10-15 15:08:50,515 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:08:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-10-15 15:08:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2018-10-15 15:08:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-10-15 15:08:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 590 transitions. [2018-10-15 15:08:50,525 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 590 transitions. Word has length 295 [2018-10-15 15:08:50,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:50,526 INFO L481 AbstractCegarLoop]: Abstraction has 567 states and 590 transitions. [2018-10-15 15:08:50,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:50,526 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 590 transitions. [2018-10-15 15:08:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-15 15:08:50,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:50,532 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2018-10-15 15:08:50,532 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:50,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:50,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1974761205, now seen corresponding path program 1 times [2018-10-15 15:08:50,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 184 proven. 27 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-15 15:08:50,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:08:50,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:08:50,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:08:50,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:08:50,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:08:50,811 INFO L87 Difference]: Start difference. First operand 567 states and 590 transitions. Second operand 4 states. [2018-10-15 15:08:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:51,239 INFO L93 Difference]: Finished difference Result 933 states and 977 transitions. [2018-10-15 15:08:51,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:08:51,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2018-10-15 15:08:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:51,247 INFO L225 Difference]: With dead ends: 933 [2018-10-15 15:08:51,248 INFO L226 Difference]: Without dead ends: 913 [2018-10-15 15:08:51,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:08:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-10-15 15:08:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 711. [2018-10-15 15:08:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2018-10-15 15:08:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 755 transitions. [2018-10-15 15:08:51,264 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 755 transitions. Word has length 327 [2018-10-15 15:08:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:51,265 INFO L481 AbstractCegarLoop]: Abstraction has 711 states and 755 transitions. [2018-10-15 15:08:51,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:08:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 755 transitions. [2018-10-15 15:08:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-15 15:08:51,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:51,272 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2018-10-15 15:08:51,272 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:51,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:51,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1969151969, now seen corresponding path program 1 times [2018-10-15 15:08:51,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-10-15 15:08:51,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:51,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:51,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:51,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:51,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:51,468 INFO L87 Difference]: Start difference. First operand 711 states and 755 transitions. Second operand 3 states. [2018-10-15 15:08:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:52,701 INFO L93 Difference]: Finished difference Result 801 states and 845 transitions. [2018-10-15 15:08:52,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:52,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2018-10-15 15:08:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:52,707 INFO L225 Difference]: With dead ends: 801 [2018-10-15 15:08:52,707 INFO L226 Difference]: Without dead ends: 801 [2018-10-15 15:08:52,708 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:08:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-15 15:08:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-15 15:08:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-15 15:08:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 845 transitions. [2018-10-15 15:08:52,722 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 845 transitions. Word has length 366 [2018-10-15 15:08:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:52,723 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 845 transitions. [2018-10-15 15:08:52,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 845 transitions. [2018-10-15 15:08:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 15:08:52,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:52,727 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 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] [2018-10-15 15:08:52,727 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:52,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:52,728 INFO L82 PathProgramCache]: Analyzing trace with hash -78706059, now seen corresponding path program 1 times [2018-10-15 15:08:52,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2018-10-15 15:08:52,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:52,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:52,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:52,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:52,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:52,943 INFO L87 Difference]: Start difference. First operand 801 states and 845 transitions. Second operand 3 states. [2018-10-15 15:08:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:53,195 INFO L93 Difference]: Finished difference Result 897 states and 941 transitions. [2018-10-15 15:08:53,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:53,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2018-10-15 15:08:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:53,200 INFO L225 Difference]: With dead ends: 897 [2018-10-15 15:08:53,200 INFO L226 Difference]: Without dead ends: 897 [2018-10-15 15:08:53,201 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:08:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-10-15 15:08:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2018-10-15 15:08:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-10-15 15:08:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 941 transitions. [2018-10-15 15:08:53,217 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 941 transitions. Word has length 402 [2018-10-15 15:08:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:53,218 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 941 transitions. [2018-10-15 15:08:53,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 941 transitions. [2018-10-15 15:08:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-15 15:08:53,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:53,222 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 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] [2018-10-15 15:08:53,223 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:53,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash 986142421, now seen corresponding path program 1 times [2018-10-15 15:08:53,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-10-15 15:08:53,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:53,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:53,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:53,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:53,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:53,422 INFO L87 Difference]: Start difference. First operand 897 states and 941 transitions. Second operand 3 states. [2018-10-15 15:08:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:54,338 INFO L93 Difference]: Finished difference Result 999 states and 1043 transitions. [2018-10-15 15:08:54,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:54,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2018-10-15 15:08:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:54,344 INFO L225 Difference]: With dead ends: 999 [2018-10-15 15:08:54,345 INFO L226 Difference]: Without dead ends: 999 [2018-10-15 15:08:54,345 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:08:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-10-15 15:08:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 999. [2018-10-15 15:08:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2018-10-15 15:08:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1043 transitions. [2018-10-15 15:08:54,361 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1043 transitions. Word has length 440 [2018-10-15 15:08:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:54,361 INFO L481 AbstractCegarLoop]: Abstraction has 999 states and 1043 transitions. [2018-10-15 15:08:54,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1043 transitions. [2018-10-15 15:08:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-10-15 15:08:54,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:54,366 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 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] [2018-10-15 15:08:54,366 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:54,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:54,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2011520395, now seen corresponding path program 1 times [2018-10-15 15:08:54,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-10-15 15:08:54,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:54,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:54,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:54,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:54,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:54,603 INFO L87 Difference]: Start difference. First operand 999 states and 1043 transitions. Second operand 3 states. [2018-10-15 15:08:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:54,824 INFO L93 Difference]: Finished difference Result 1107 states and 1151 transitions. [2018-10-15 15:08:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:54,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 482 [2018-10-15 15:08:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:54,831 INFO L225 Difference]: With dead ends: 1107 [2018-10-15 15:08:54,831 INFO L226 Difference]: Without dead ends: 1107 [2018-10-15 15:08:54,832 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:08:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-10-15 15:08:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2018-10-15 15:08:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1107 states. [2018-10-15 15:08:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1151 transitions. [2018-10-15 15:08:54,856 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1151 transitions. Word has length 482 [2018-10-15 15:08:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:54,857 INFO L481 AbstractCegarLoop]: Abstraction has 1107 states and 1151 transitions. [2018-10-15 15:08:54,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1151 transitions. [2018-10-15 15:08:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-15 15:08:54,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:54,865 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 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] [2018-10-15 15:08:54,865 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:54,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:54,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1196575194, now seen corresponding path program 1 times [2018-10-15 15:08:54,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2018-10-15 15:08:55,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:55,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:55,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:55,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:55,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:55,307 INFO L87 Difference]: Start difference. First operand 1107 states and 1151 transitions. Second operand 3 states. [2018-10-15 15:08:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:55,567 INFO L93 Difference]: Finished difference Result 1417 states and 1465 transitions. [2018-10-15 15:08:55,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:55,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 534 [2018-10-15 15:08:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:55,575 INFO L225 Difference]: With dead ends: 1417 [2018-10-15 15:08:55,575 INFO L226 Difference]: Without dead ends: 1408 [2018-10-15 15:08:55,576 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:08:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-10-15 15:08:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1408. [2018-10-15 15:08:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2018-10-15 15:08:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1456 transitions. [2018-10-15 15:08:55,599 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1456 transitions. Word has length 534 [2018-10-15 15:08:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:55,600 INFO L481 AbstractCegarLoop]: Abstraction has 1408 states and 1456 transitions. [2018-10-15 15:08:55,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1456 transitions. [2018-10-15 15:08:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-10-15 15:08:55,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:55,606 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 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] [2018-10-15 15:08:55,607 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:55,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1484358287, now seen corresponding path program 1 times [2018-10-15 15:08:55,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-10-15 15:08:55,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:55,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:55,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:55,879 INFO L87 Difference]: Start difference. First operand 1408 states and 1456 transitions. Second operand 3 states. [2018-10-15 15:08:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:56,076 INFO L93 Difference]: Finished difference Result 1773 states and 1840 transitions. [2018-10-15 15:08:56,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:56,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 535 [2018-10-15 15:08:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:56,085 INFO L225 Difference]: With dead ends: 1773 [2018-10-15 15:08:56,085 INFO L226 Difference]: Without dead ends: 1773 [2018-10-15 15:08:56,085 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:08:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2018-10-15 15:08:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1764. [2018-10-15 15:08:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1764 states. [2018-10-15 15:08:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 1831 transitions. [2018-10-15 15:08:56,113 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 1831 transitions. Word has length 535 [2018-10-15 15:08:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:56,114 INFO L481 AbstractCegarLoop]: Abstraction has 1764 states and 1831 transitions. [2018-10-15 15:08:56,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 1831 transitions. [2018-10-15 15:08:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-10-15 15:08:56,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:56,122 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:56,122 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:56,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:56,123 INFO L82 PathProgramCache]: Analyzing trace with hash 396528182, now seen corresponding path program 1 times [2018-10-15 15:08:56,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2108 backedges. 927 proven. 0 refuted. 0 times theorem prover too weak. 1181 trivial. 0 not checked. [2018-10-15 15:08:56,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:56,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:56,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:56,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:56,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:56,552 INFO L87 Difference]: Start difference. First operand 1764 states and 1831 transitions. Second operand 3 states. [2018-10-15 15:08:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:56,801 INFO L93 Difference]: Finished difference Result 1802 states and 1837 transitions. [2018-10-15 15:08:56,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:56,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 630 [2018-10-15 15:08:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:56,810 INFO L225 Difference]: With dead ends: 1802 [2018-10-15 15:08:56,810 INFO L226 Difference]: Without dead ends: 1802 [2018-10-15 15:08:56,810 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:08:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-10-15 15:08:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1585. [2018-10-15 15:08:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2018-10-15 15:08:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 1620 transitions. [2018-10-15 15:08:56,835 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 1620 transitions. Word has length 630 [2018-10-15 15:08:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:56,835 INFO L481 AbstractCegarLoop]: Abstraction has 1585 states and 1620 transitions. [2018-10-15 15:08:56,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1620 transitions. [2018-10-15 15:08:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2018-10-15 15:08:56,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:56,844 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-15 15:08:56,845 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:56,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:56,845 INFO L82 PathProgramCache]: Analyzing trace with hash 454160808, now seen corresponding path program 1 times [2018-10-15 15:08:56,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4215 backedges. 2444 proven. 27 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2018-10-15 15:08:57,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:08:57,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:08:57,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:08:57,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:08:57,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:08:57,304 INFO L87 Difference]: Start difference. First operand 1585 states and 1620 transitions. Second operand 4 states. [2018-10-15 15:08:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:57,738 INFO L93 Difference]: Finished difference Result 1044 states and 1061 transitions. [2018-10-15 15:08:57,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:08:57,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 823 [2018-10-15 15:08:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:57,740 INFO L225 Difference]: With dead ends: 1044 [2018-10-15 15:08:57,740 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:08:57,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:08:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:08:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:08:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:08:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:08:57,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 823 [2018-10-15 15:08:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:57,742 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:08:57,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:08:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:08:57,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:08:57,748 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:08:57 BoogieIcfgContainer [2018-10-15 15:08:57,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:08:57,749 INFO L168 Benchmark]: Toolchain (without parser) took 12294.12 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 582.0 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -342.0 MB). Peak memory consumption was 240.0 MB. Max. memory is 7.1 GB. [2018-10-15 15:08:57,752 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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:08:57,753 INFO L168 Benchmark]: Boogie Preprocessor took 76.54 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:08:57,753 INFO L168 Benchmark]: RCFGBuilder took 1327.17 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:08:57,754 INFO L168 Benchmark]: TraceAbstraction took 10886.06 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 582.0 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -394.8 MB). Peak memory consumption was 187.1 MB. Max. memory is 7.1 GB. [2018-10-15 15:08:57,758 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.23 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 76.54 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 1327.17 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 10886.06 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 582.0 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -394.8 MB). Peak memory consumption was 187.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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, 266 locations, 1 error locations. SAFE Result, 10.8s OverallTime, 15 OverallIterations, 19 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4442 SDtfs, 509 SDslu, 3791 SDs, 0 SdLazy, 1156 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1764occurred in iteration=13, 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, 15 MinimizatonAttempts, 433 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5870 NumberOfCodeBlocks, 5870 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5855 ConstructedInterpolants, 0 QuantifiedInterpolants, 3548575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 13292/13346 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/s3_srvr_1.BV.c.cil.c_21.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-08-57-770.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.BV.c.cil.c_21.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-08-57-770.csv Received shutdown request...