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/20181010-MemSafetyPathprograms/memset2_true-valid-memsafety_true-termination.c_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:36:56,125 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:36:56,127 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:36:56,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:36:56,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:36:56,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:36:56,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:36:56,150 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:36:56,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:36:56,153 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:36:56,154 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:36:56,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:36:56,155 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:36:56,156 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:36:56,157 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:36:56,158 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:36:56,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:36:56,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:36:56,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:36:56,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:36:56,165 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:36:56,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:36:56,174 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:36:56,174 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:36:56,174 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:36:56,175 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:36:56,179 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:36:56,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:36:56,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:36:56,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:36:56,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:36:56,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:36:56,187 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:36:56,187 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:36:56,190 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:36:56,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:36:56,191 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-10 15:36:56,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:36:56,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:36:56,210 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:36:56,211 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:36:56,211 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:36:56,211 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:36:56,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:36:56,212 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:36:56,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:36:56,212 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:36:56,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:36:56,213 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:36:56,213 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:36:56,214 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:36:56,214 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:36:56,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:36:56,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:36:56,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:36:56,282 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:36:56,282 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:36:56,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/memset2_true-valid-memsafety_true-termination.c_4.bpl [2018-10-10 15:36:56,283 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/memset2_true-valid-memsafety_true-termination.c_4.bpl' [2018-10-10 15:36:56,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:36:56,346 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:36:56,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:36:56,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:36:56,347 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:36:56,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:36:56" (1/1) ... [2018-10-10 15:36:56,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:36:56" (1/1) ... [2018-10-10 15:36:56,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:36:56" (1/1) ... [2018-10-10 15:36:56,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:36:56" (1/1) ... [2018-10-10 15:36:56,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:36:56" (1/1) ... [2018-10-10 15:36:56,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:36:56" (1/1) ... [2018-10-10 15:36:56,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:36:56" (1/1) ... [2018-10-10 15:36:56,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:36:56,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:36:56,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:36:56,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:36:56,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:36:56" (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-10 15:36:56,461 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:36:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:36:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:36:56,852 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:36:56,853 INFO L202 PluginConnector]: Adding new model memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:36:56 BoogieIcfgContainer [2018-10-10 15:36:56,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:36:56,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:36:56,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:36:56,857 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:36:56,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:36:56" (1/2) ... [2018-10-10 15:36:56,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431290f9 and model type memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:36:56, skipping insertion in model container [2018-10-10 15:36:56,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:36:56" (2/2) ... [2018-10-10 15:36:56,861 INFO L112 eAbstractionObserver]: Analyzing ICFG memset2_true-valid-memsafety_true-termination.c_4.bpl [2018-10-10 15:36:56,872 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:36:56,884 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:36:56,902 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:36:56,937 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:36:56,938 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:36:56,938 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:36:56,938 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:36:56,938 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:36:56,938 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:36:56,939 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:36:56,939 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:36:56,939 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:36:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-10-10 15:36:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-10 15:36:56,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:36:56,982 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] [2018-10-10 15:36:56,984 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:36:56,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:36:56,990 INFO L82 PathProgramCache]: Analyzing trace with hash 180571921, now seen corresponding path program 1 times [2018-10-10 15:36:57,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:36:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:36:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:36:57,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:36:57,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:36:57,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:36:57,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:36:57,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:36:57,294 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2018-10-10 15:36:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:36:57,387 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-10 15:36:57,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:36:57,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-10-10 15:36:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:36:57,401 INFO L225 Difference]: With dead ends: 39 [2018-10-10 15:36:57,401 INFO L226 Difference]: Without dead ends: 39 [2018-10-10 15:36:57,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:36:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-10 15:36:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-10 15:36:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-10 15:36:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-10 15:36:57,442 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-10-10 15:36:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:36:57,442 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-10 15:36:57,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:36:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-10 15:36:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-10 15:36:57,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:36:57,444 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] [2018-10-10 15:36:57,444 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:36:57,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:36:57,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1856720466, now seen corresponding path program 1 times [2018-10-10 15:36:57,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:36:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:36:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:36:57,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:36:57,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:36:57,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:36:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:36:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:36:57,563 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 5 states. [2018-10-10 15:36:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:36:57,757 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-10 15:36:57,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:36:57,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-10 15:36:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:36:57,760 INFO L225 Difference]: With dead ends: 41 [2018-10-10 15:36:57,760 INFO L226 Difference]: Without dead ends: 41 [2018-10-10 15:36:57,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:36:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-10 15:36:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-10-10 15:36:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-10 15:36:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-10 15:36:57,767 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-10-10 15:36:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:36:57,768 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-10 15:36:57,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:36:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-10 15:36:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-10 15:36:57,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:36:57,770 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 15:36:57,770 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:36:57,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:36:57,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2022736211, now seen corresponding path program 2 times [2018-10-10 15:36:57,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:36:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:36:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:36:58,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:36:58,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:36:58,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:36:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:36:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:36:58,047 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 6 states. [2018-10-10 15:36:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:36:58,174 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-10 15:36:58,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:36:58,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-10-10 15:36:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:36:58,176 INFO L225 Difference]: With dead ends: 43 [2018-10-10 15:36:58,176 INFO L226 Difference]: Without dead ends: 43 [2018-10-10 15:36:58,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:36:58,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-10 15:36:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-10 15:36:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-10 15:36:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-10 15:36:58,188 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-10-10 15:36:58,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:36:58,189 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-10 15:36:58,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:36:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-10 15:36:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 15:36:58,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:36:58,192 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:36:58,193 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:36:58,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:36:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1644890092, now seen corresponding path program 3 times [2018-10-10 15:36:58,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:36:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:36:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:36:58,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:36:58,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:36:58,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:36:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:36:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:36:58,402 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 7 states. [2018-10-10 15:36:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:36:58,529 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-10 15:36:58,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:36:58,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-10 15:36:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:36:58,535 INFO L225 Difference]: With dead ends: 45 [2018-10-10 15:36:58,535 INFO L226 Difference]: Without dead ends: 45 [2018-10-10 15:36:58,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:36:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-10 15:36:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-10 15:36:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-10 15:36:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-10 15:36:58,542 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-10-10 15:36:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:36:58,543 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-10 15:36:58,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:36:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-10 15:36:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-10 15:36:58,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:36:58,545 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:36:58,545 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:36:58,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:36:58,546 INFO L82 PathProgramCache]: Analyzing trace with hash -65617259, now seen corresponding path program 4 times [2018-10-10 15:36:58,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:36:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:36:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:36:58,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:36:58,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:36:58,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:36:58,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:36:58,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:36:58,669 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 8 states. [2018-10-10 15:36:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:36:59,179 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-10 15:36:59,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:36:59,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-10-10 15:36:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:36:59,182 INFO L225 Difference]: With dead ends: 47 [2018-10-10 15:36:59,182 INFO L226 Difference]: Without dead ends: 47 [2018-10-10 15:36:59,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:36:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-10 15:36:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-10 15:36:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-10 15:36:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-10 15:36:59,187 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-10-10 15:36:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:36:59,188 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-10 15:36:59,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:36:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-10 15:36:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 15:36:59,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:36:59,189 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:36:59,190 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:36:59,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:36:59,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1492119766, now seen corresponding path program 5 times [2018-10-10 15:36:59,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:36:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:36:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:36:59,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:36:59,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:36:59,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:36:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:36:59,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:36:59,374 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 9 states. [2018-10-10 15:36:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:36:59,552 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-10 15:36:59,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:36:59,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-10-10 15:36:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:36:59,555 INFO L225 Difference]: With dead ends: 49 [2018-10-10 15:36:59,555 INFO L226 Difference]: Without dead ends: 49 [2018-10-10 15:36:59,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:36:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-10 15:36:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-10 15:36:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-10 15:36:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-10 15:36:59,561 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-10-10 15:36:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:36:59,562 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-10 15:36:59,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:36:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-10 15:36:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 15:36:59,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:36:59,563 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:36:59,564 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:36:59,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:36:59,564 INFO L82 PathProgramCache]: Analyzing trace with hash -466185513, now seen corresponding path program 6 times [2018-10-10 15:36:59,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:36:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:36:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:36:59,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:36:59,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:36:59,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:36:59,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:36:59,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:36:59,742 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 10 states. [2018-10-10 15:37:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:00,227 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-10 15:37:00,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:37:00,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-10-10 15:37:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:00,230 INFO L225 Difference]: With dead ends: 51 [2018-10-10 15:37:00,230 INFO L226 Difference]: Without dead ends: 51 [2018-10-10 15:37:00,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:37:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-10 15:37:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-10 15:37:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-10 15:37:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-10 15:37:00,235 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-10-10 15:37:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:00,236 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-10 15:37:00,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:37:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-10 15:37:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-10 15:37:00,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:00,237 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:00,238 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:00,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1201882984, now seen corresponding path program 7 times [2018-10-10 15:37:00,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:00,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:00,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:37:00,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:37:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:37:00,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:37:00,549 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 11 states. [2018-10-10 15:37:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:00,723 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-10 15:37:00,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:37:00,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-10-10 15:37:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:00,725 INFO L225 Difference]: With dead ends: 53 [2018-10-10 15:37:00,725 INFO L226 Difference]: Without dead ends: 53 [2018-10-10 15:37:00,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:37:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-10 15:37:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-10 15:37:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-10 15:37:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-10 15:37:00,731 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-10-10 15:37:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:00,731 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-10 15:37:00,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:37:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-10 15:37:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 15:37:00,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:00,733 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:00,733 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:00,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash 462451225, now seen corresponding path program 8 times [2018-10-10 15:37:00,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:00,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:00,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:37:00,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:37:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:37:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:37:00,927 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 12 states. [2018-10-10 15:37:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:01,092 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-10 15:37:01,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:37:01,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-10-10 15:37:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:01,094 INFO L225 Difference]: With dead ends: 55 [2018-10-10 15:37:01,094 INFO L226 Difference]: Without dead ends: 55 [2018-10-10 15:37:01,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:37:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-10 15:37:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-10 15:37:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-10 15:37:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-10 15:37:01,100 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-10-10 15:37:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:01,100 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-10 15:37:01,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:37:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-10 15:37:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-10 15:37:01,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:01,102 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:01,102 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:01,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:01,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2135175334, now seen corresponding path program 9 times [2018-10-10 15:37:01,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:01,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:01,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:37:01,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:37:01,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:37:01,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:37:01,324 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 13 states. [2018-10-10 15:37:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:01,525 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-10 15:37:01,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:37:01,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-10-10 15:37:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:01,527 INFO L225 Difference]: With dead ends: 57 [2018-10-10 15:37:01,527 INFO L226 Difference]: Without dead ends: 57 [2018-10-10 15:37:01,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:37:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-10 15:37:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-10 15:37:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-10 15:37:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-10 15:37:01,532 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-10-10 15:37:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:01,532 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-10 15:37:01,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:37:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-10 15:37:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-10 15:37:01,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:01,534 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:01,534 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:01,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:01,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1216667739, now seen corresponding path program 10 times [2018-10-10 15:37:01,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:01,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:01,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:37:01,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:37:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:37:01,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:37:01,827 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 14 states. [2018-10-10 15:37:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:02,118 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-10 15:37:02,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:37:02,129 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-10-10 15:37:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:02,130 INFO L225 Difference]: With dead ends: 59 [2018-10-10 15:37:02,130 INFO L226 Difference]: Without dead ends: 59 [2018-10-10 15:37:02,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:37:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-10 15:37:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-10 15:37:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-10 15:37:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-10 15:37:02,135 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-10-10 15:37:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:02,136 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-10 15:37:02,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:37:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-10 15:37:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 15:37:02,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:02,137 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:02,138 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:02,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1112388892, now seen corresponding path program 11 times [2018-10-10 15:37:02,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:02,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:02,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:37:02,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:37:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:37:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:37:02,964 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 15 states. [2018-10-10 15:37:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:03,440 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-10 15:37:03,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:37:03,441 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-10-10 15:37:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:03,442 INFO L225 Difference]: With dead ends: 61 [2018-10-10 15:37:03,442 INFO L226 Difference]: Without dead ends: 61 [2018-10-10 15:37:03,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:37:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-10 15:37:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-10 15:37:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-10 15:37:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-10 15:37:03,447 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-10-10 15:37:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:03,448 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-10 15:37:03,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:37:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-10 15:37:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-10 15:37:03,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:03,449 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:03,449 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:03,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:03,450 INFO L82 PathProgramCache]: Analyzing trace with hash -315335267, now seen corresponding path program 12 times [2018-10-10 15:37:03,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:03,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:03,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:37:03,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:37:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:37:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:37:03,820 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 16 states. [2018-10-10 15:37:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:04,190 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-10 15:37:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:37:04,190 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-10-10 15:37:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:04,191 INFO L225 Difference]: With dead ends: 63 [2018-10-10 15:37:04,192 INFO L226 Difference]: Without dead ends: 63 [2018-10-10 15:37:04,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:37:04,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-10 15:37:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-10 15:37:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-10 15:37:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-10 15:37:04,196 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-10-10 15:37:04,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:04,197 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-10 15:37:04,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:37:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-10 15:37:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 15:37:04,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:04,198 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:04,198 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:04,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:04,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2031282654, now seen corresponding path program 13 times [2018-10-10 15:37:04,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:04,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:04,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:37:04,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:37:04,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:37:04,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:37:04,418 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 17 states. [2018-10-10 15:37:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:04,860 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-10 15:37:04,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:37:04,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-10-10 15:37:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:04,862 INFO L225 Difference]: With dead ends: 65 [2018-10-10 15:37:04,862 INFO L226 Difference]: Without dead ends: 65 [2018-10-10 15:37:04,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:37:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-10 15:37:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-10-10 15:37:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-10 15:37:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-10 15:37:04,866 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-10-10 15:37:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:04,867 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-10 15:37:04,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:37:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-10 15:37:04,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-10 15:37:04,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:04,868 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:04,868 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:04,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:04,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2021692961, now seen corresponding path program 14 times [2018-10-10 15:37:04,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:05,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:05,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:37:05,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:37:05,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:37:05,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:37:05,144 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 18 states. [2018-10-10 15:37:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:05,589 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-10 15:37:05,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:37:05,590 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-10-10 15:37:05,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:05,590 INFO L225 Difference]: With dead ends: 67 [2018-10-10 15:37:05,590 INFO L226 Difference]: Without dead ends: 67 [2018-10-10 15:37:05,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:37:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-10 15:37:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-10 15:37:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-10 15:37:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-10 15:37:05,596 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-10-10 15:37:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:05,596 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-10 15:37:05,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:37:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-10 15:37:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-10 15:37:05,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:05,597 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:05,597 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:05,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1395921504, now seen corresponding path program 15 times [2018-10-10 15:37:05,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:06,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:06,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:37:06,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:37:06,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:37:06,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:37:06,149 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 19 states. [2018-10-10 15:37:06,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:06,545 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-10 15:37:06,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:37:06,546 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-10-10 15:37:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:06,547 INFO L225 Difference]: With dead ends: 69 [2018-10-10 15:37:06,547 INFO L226 Difference]: Without dead ends: 69 [2018-10-10 15:37:06,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:37:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-10 15:37:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-10-10 15:37:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-10 15:37:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-10 15:37:06,553 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-10-10 15:37:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:06,553 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-10 15:37:06,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:37:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-10 15:37:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-10 15:37:06,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:06,554 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:06,555 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:06,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1324972767, now seen corresponding path program 16 times [2018-10-10 15:37:06,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:06,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:06,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:37:06,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:37:06,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:37:06,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:37:06,843 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 20 states. [2018-10-10 15:37:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:07,182 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-10 15:37:07,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:37:07,182 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-10-10 15:37:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:07,183 INFO L225 Difference]: With dead ends: 71 [2018-10-10 15:37:07,183 INFO L226 Difference]: Without dead ends: 71 [2018-10-10 15:37:07,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:37:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-10 15:37:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-10-10 15:37:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-10 15:37:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-10 15:37:07,187 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-10-10 15:37:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:07,187 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-10 15:37:07,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:37:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-10 15:37:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-10 15:37:07,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:07,188 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:07,189 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:07,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1862713246, now seen corresponding path program 17 times [2018-10-10 15:37:07,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:07,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:07,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:37:07,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:37:07,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:37:07,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:37:07,478 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 21 states. [2018-10-10 15:37:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:07,930 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-10 15:37:07,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:37:07,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-10-10 15:37:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:07,931 INFO L225 Difference]: With dead ends: 73 [2018-10-10 15:37:07,931 INFO L226 Difference]: Without dead ends: 73 [2018-10-10 15:37:07,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:37:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-10 15:37:07,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-10 15:37:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-10 15:37:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-10 15:37:07,934 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-10-10 15:37:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:07,935 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-10 15:37:07,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:37:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-10 15:37:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-10 15:37:07,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:07,936 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:07,936 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:07,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:07,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1059729251, now seen corresponding path program 18 times [2018-10-10 15:37:07,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:08,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:08,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:37:08,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:37:08,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:37:08,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:37:08,491 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 22 states. [2018-10-10 15:37:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:08,910 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-10 15:37:08,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:37:08,911 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-10-10 15:37:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:08,912 INFO L225 Difference]: With dead ends: 75 [2018-10-10 15:37:08,912 INFO L226 Difference]: Without dead ends: 75 [2018-10-10 15:37:08,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:37:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-10 15:37:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-10 15:37:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-10 15:37:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-10 15:37:08,917 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-10-10 15:37:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:08,917 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-10 15:37:08,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:37:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-10 15:37:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 15:37:08,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:08,918 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:08,919 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:08,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:08,919 INFO L82 PathProgramCache]: Analyzing trace with hash 618357284, now seen corresponding path program 19 times [2018-10-10 15:37:08,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:09,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:09,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:37:09,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:37:09,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:37:09,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:37:09,952 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 23 states. [2018-10-10 15:37:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:10,380 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-10 15:37:10,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:37:10,381 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-10-10 15:37:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:10,382 INFO L225 Difference]: With dead ends: 77 [2018-10-10 15:37:10,382 INFO L226 Difference]: Without dead ends: 77 [2018-10-10 15:37:10,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:37:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-10 15:37:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-10-10 15:37:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-10 15:37:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-10 15:37:10,385 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-10-10 15:37:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:10,385 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-10 15:37:10,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:37:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-10 15:37:10,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 15:37:10,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:10,386 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:10,387 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:10,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1661659301, now seen corresponding path program 20 times [2018-10-10 15:37:10,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:11,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:11,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:37:11,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:37:11,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:37:11,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:37:11,328 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 24 states. [2018-10-10 15:37:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:11,736 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-10 15:37:11,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:37:11,737 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-10-10 15:37:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:11,738 INFO L225 Difference]: With dead ends: 79 [2018-10-10 15:37:11,738 INFO L226 Difference]: Without dead ends: 79 [2018-10-10 15:37:11,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:37:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-10 15:37:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-10-10 15:37:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-10 15:37:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-10 15:37:11,741 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-10-10 15:37:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:11,741 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-10 15:37:11,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:37:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-10 15:37:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 15:37:11,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:11,742 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:11,743 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:11,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:11,743 INFO L82 PathProgramCache]: Analyzing trace with hash -747449626, now seen corresponding path program 21 times [2018-10-10 15:37:11,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:12,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:12,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:37:12,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:37:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:37:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:37:12,839 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 25 states. [2018-10-10 15:37:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:13,302 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-10 15:37:13,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:37:13,309 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-10-10 15:37:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:13,310 INFO L225 Difference]: With dead ends: 81 [2018-10-10 15:37:13,310 INFO L226 Difference]: Without dead ends: 81 [2018-10-10 15:37:13,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:37:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-10 15:37:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-10-10 15:37:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-10 15:37:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-10 15:37:13,313 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-10-10 15:37:13,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:13,313 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-10 15:37:13,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:37:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-10 15:37:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 15:37:13,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:13,314 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:13,315 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:13,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:13,315 INFO L82 PathProgramCache]: Analyzing trace with hash -913755929, now seen corresponding path program 22 times [2018-10-10 15:37:13,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:13,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:13,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:37:13,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:37:13,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:37:13,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:37:13,714 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 26 states. [2018-10-10 15:37:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:14,240 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-10 15:37:14,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:37:14,240 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-10-10 15:37:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:14,241 INFO L225 Difference]: With dead ends: 83 [2018-10-10 15:37:14,241 INFO L226 Difference]: Without dead ends: 83 [2018-10-10 15:37:14,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:37:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-10 15:37:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-10-10 15:37:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-10 15:37:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-10 15:37:14,245 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-10-10 15:37:14,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:14,246 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-10 15:37:14,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:37:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-10 15:37:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-10 15:37:14,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:14,247 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:14,247 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:14,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1820323160, now seen corresponding path program 23 times [2018-10-10 15:37:14,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:14,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:14,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:37:14,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:37:14,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:37:14,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:37:14,662 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 27 states. [2018-10-10 15:37:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:15,269 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-10 15:37:15,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:37:15,269 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 81 [2018-10-10 15:37:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:15,270 INFO L225 Difference]: With dead ends: 85 [2018-10-10 15:37:15,270 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 15:37:15,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:37:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 15:37:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-10-10 15:37:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-10 15:37:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-10 15:37:15,274 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-10-10 15:37:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:15,275 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-10 15:37:15,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:37:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-10 15:37:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-10 15:37:15,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:15,276 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:15,276 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:15,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:15,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1153071063, now seen corresponding path program 24 times [2018-10-10 15:37:15,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:16,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:16,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:37:16,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:37:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:37:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:37:16,006 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 28 states. [2018-10-10 15:37:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:16,582 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-10 15:37:16,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:37:16,582 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 83 [2018-10-10 15:37:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:16,583 INFO L225 Difference]: With dead ends: 87 [2018-10-10 15:37:16,583 INFO L226 Difference]: Without dead ends: 87 [2018-10-10 15:37:16,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:37:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-10 15:37:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-10-10 15:37:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-10 15:37:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-10 15:37:16,587 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-10-10 15:37:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:16,587 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-10 15:37:16,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:37:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-10 15:37:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 15:37:16,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:16,589 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:16,589 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:16,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:16,589 INFO L82 PathProgramCache]: Analyzing trace with hash 126067050, now seen corresponding path program 25 times [2018-10-10 15:37:16,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:17,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:17,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:37:17,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:37:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:37:17,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:37:17,077 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 29 states. [2018-10-10 15:37:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:17,740 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-10 15:37:17,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:37:17,748 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-10-10 15:37:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:17,748 INFO L225 Difference]: With dead ends: 89 [2018-10-10 15:37:17,749 INFO L226 Difference]: Without dead ends: 89 [2018-10-10 15:37:17,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:37:17,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-10 15:37:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-10-10 15:37:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-10 15:37:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-10 15:37:17,751 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-10-10 15:37:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:17,751 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-10 15:37:17,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:37:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-10 15:37:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-10 15:37:17,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:17,752 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:17,753 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:17,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1017146987, now seen corresponding path program 26 times [2018-10-10 15:37:17,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:18,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:18,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:37:18,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:37:18,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:37:18,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:37:18,226 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 30 states. [2018-10-10 15:37:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:18,854 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-10 15:37:18,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:37:18,855 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-10-10 15:37:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:18,856 INFO L225 Difference]: With dead ends: 91 [2018-10-10 15:37:18,856 INFO L226 Difference]: Without dead ends: 91 [2018-10-10 15:37:18,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:37:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-10 15:37:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-10-10 15:37:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-10 15:37:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-10 15:37:18,860 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-10-10 15:37:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:18,860 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-10 15:37:18,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:37:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-10 15:37:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 15:37:18,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:18,861 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:18,861 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:18,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1648492756, now seen corresponding path program 27 times [2018-10-10 15:37:18,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:19,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:19,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:37:19,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:37:19,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:37:19,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:37:19,360 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 31 states. [2018-10-10 15:37:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:20,151 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-10 15:37:20,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:37:20,152 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-10-10 15:37:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:20,153 INFO L225 Difference]: With dead ends: 93 [2018-10-10 15:37:20,153 INFO L226 Difference]: Without dead ends: 93 [2018-10-10 15:37:20,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:37:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-10 15:37:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-10-10 15:37:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-10 15:37:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-10 15:37:20,157 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-10-10 15:37:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:20,157 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-10 15:37:20,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:37:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-10 15:37:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-10 15:37:20,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:20,158 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:20,159 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:20,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash 767189933, now seen corresponding path program 28 times [2018-10-10 15:37:20,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:20,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:20,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:37:20,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:37:20,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:37:20,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:37:20,656 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 32 states. [2018-10-10 15:37:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:21,995 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-10 15:37:21,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:37:21,996 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-10-10 15:37:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:21,997 INFO L225 Difference]: With dead ends: 95 [2018-10-10 15:37:21,997 INFO L226 Difference]: Without dead ends: 95 [2018-10-10 15:37:21,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:37:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-10 15:37:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-10 15:37:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-10 15:37:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-10 15:37:22,001 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-10-10 15:37:22,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:22,001 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-10 15:37:22,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:37:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-10 15:37:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-10 15:37:22,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:22,002 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:22,002 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:22,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:22,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1339053074, now seen corresponding path program 29 times [2018-10-10 15:37:22,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:22,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:22,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:37:22,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:37:22,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:37:22,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:37:22,609 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 33 states. [2018-10-10 15:37:23,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:23,385 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-10 15:37:23,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:37:23,385 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 93 [2018-10-10 15:37:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:23,386 INFO L225 Difference]: With dead ends: 97 [2018-10-10 15:37:23,387 INFO L226 Difference]: Without dead ends: 97 [2018-10-10 15:37:23,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:37:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-10 15:37:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-10-10 15:37:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-10 15:37:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-10 15:37:23,390 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-10-10 15:37:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:23,390 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-10 15:37:23,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:37:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-10 15:37:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 15:37:23,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:23,391 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:23,391 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:23,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:23,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1785980911, now seen corresponding path program 30 times [2018-10-10 15:37:23,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:23,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:23,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:37:23,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:37:23,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:37:23,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:37:23,978 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 34 states. [2018-10-10 15:37:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:24,770 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-10 15:37:24,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:37:24,770 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 95 [2018-10-10 15:37:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:24,771 INFO L225 Difference]: With dead ends: 99 [2018-10-10 15:37:24,771 INFO L226 Difference]: Without dead ends: 99 [2018-10-10 15:37:24,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:37:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-10 15:37:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-10-10 15:37:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-10 15:37:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-10 15:37:24,775 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-10-10 15:37:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:24,776 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-10 15:37:24,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:37:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-10 15:37:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 15:37:24,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:24,777 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:24,777 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:24,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1533466704, now seen corresponding path program 31 times [2018-10-10 15:37:24,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:25,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:25,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:37:25,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:37:25,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:37:25,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:37:25,595 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 35 states. [2018-10-10 15:37:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:26,831 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-10 15:37:26,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:37:26,831 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 97 [2018-10-10 15:37:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:26,832 INFO L225 Difference]: With dead ends: 101 [2018-10-10 15:37:26,832 INFO L226 Difference]: Without dead ends: 101 [2018-10-10 15:37:26,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:37:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-10 15:37:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-10 15:37:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-10 15:37:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-10 15:37:26,837 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-10-10 15:37:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:26,838 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-10 15:37:26,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:37:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-10 15:37:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 15:37:26,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:26,838 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:26,839 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:26,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash -361923791, now seen corresponding path program 32 times [2018-10-10 15:37:26,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:27,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:27,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:37:27,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:37:27,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:37:27,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:37:27,558 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 36 states. [2018-10-10 15:37:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:28,429 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-10 15:37:28,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:37:28,430 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-10-10 15:37:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:28,431 INFO L225 Difference]: With dead ends: 103 [2018-10-10 15:37:28,431 INFO L226 Difference]: Without dead ends: 103 [2018-10-10 15:37:28,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:37:28,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-10 15:37:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-10-10 15:37:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-10 15:37:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-10 15:37:28,435 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-10-10 15:37:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:28,436 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-10 15:37:28,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:37:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-10 15:37:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-10 15:37:28,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:28,437 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:28,437 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:28,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:28,437 INFO L82 PathProgramCache]: Analyzing trace with hash 209384050, now seen corresponding path program 33 times [2018-10-10 15:37:28,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:29,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:29,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:37:29,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:37:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:37:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:37:29,146 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 37 states. [2018-10-10 15:37:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:30,082 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-10 15:37:30,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:37:30,082 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 101 [2018-10-10 15:37:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:30,083 INFO L225 Difference]: With dead ends: 105 [2018-10-10 15:37:30,083 INFO L226 Difference]: Without dead ends: 105 [2018-10-10 15:37:30,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:37:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-10 15:37:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-10-10 15:37:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-10 15:37:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-10 15:37:30,086 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-10-10 15:37:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:30,087 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-10 15:37:30,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:37:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-10 15:37:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 15:37:30,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:30,088 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:30,088 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:30,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:30,088 INFO L82 PathProgramCache]: Analyzing trace with hash -519594637, now seen corresponding path program 34 times [2018-10-10 15:37:30,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:31,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:31,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:37:31,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:37:31,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:37:31,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:37:31,255 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 38 states. [2018-10-10 15:37:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:32,378 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-10 15:37:32,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:37:32,378 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 103 [2018-10-10 15:37:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:32,379 INFO L225 Difference]: With dead ends: 107 [2018-10-10 15:37:32,380 INFO L226 Difference]: Without dead ends: 107 [2018-10-10 15:37:32,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:37:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-10 15:37:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-10-10 15:37:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-10 15:37:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-10 15:37:32,382 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-10-10 15:37:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:32,382 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-10 15:37:32,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:37:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-10 15:37:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-10 15:37:32,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:32,384 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:32,384 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:32,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:32,384 INFO L82 PathProgramCache]: Analyzing trace with hash -988443596, now seen corresponding path program 35 times [2018-10-10 15:37:32,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:33,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:33,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:37:33,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:37:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:37:33,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:37:33,116 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 39 states. [2018-10-10 15:37:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:34,139 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-10 15:37:34,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:37:34,141 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 105 [2018-10-10 15:37:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:34,141 INFO L225 Difference]: With dead ends: 109 [2018-10-10 15:37:34,141 INFO L226 Difference]: Without dead ends: 109 [2018-10-10 15:37:34,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:37:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-10 15:37:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-10-10 15:37:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-10 15:37:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-10 15:37:34,145 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-10-10 15:37:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:34,145 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-10 15:37:34,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:37:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-10 15:37:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 15:37:34,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:34,146 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:34,146 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:34,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash -580727115, now seen corresponding path program 36 times [2018-10-10 15:37:34,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:35,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:35,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:37:35,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:37:35,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:37:35,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:37:35,292 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 40 states. [2018-10-10 15:37:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:36,608 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-10 15:37:36,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:37:36,608 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 107 [2018-10-10 15:37:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:36,609 INFO L225 Difference]: With dead ends: 111 [2018-10-10 15:37:36,609 INFO L226 Difference]: Without dead ends: 111 [2018-10-10 15:37:36,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:37:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-10 15:37:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-10-10 15:37:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 15:37:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-10 15:37:36,613 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-10-10 15:37:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:36,613 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-10 15:37:36,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:37:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-10 15:37:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 15:37:36,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:36,614 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:36,614 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:36,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:36,615 INFO L82 PathProgramCache]: Analyzing trace with hash 392787190, now seen corresponding path program 37 times [2018-10-10 15:37:36,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:37,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:37,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:37:37,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:37:37,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:37:37,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:37:37,996 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 41 states. [2018-10-10 15:37:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:39,603 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 15:37:39,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:37:39,603 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 109 [2018-10-10 15:37:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:39,604 INFO L225 Difference]: With dead ends: 113 [2018-10-10 15:37:39,604 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 15:37:39,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:37:39,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 15:37:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-10-10 15:37:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-10 15:37:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-10 15:37:39,608 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-10-10 15:37:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:39,608 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-10 15:37:39,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:37:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-10 15:37:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 15:37:39,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:39,609 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:39,609 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:39,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash -362836233, now seen corresponding path program 38 times [2018-10-10 15:37:39,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:40,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:40,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:37:40,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:37:40,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:37:40,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:37:40,974 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 42 states. [2018-10-10 15:37:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:42,346 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-10 15:37:42,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:37:42,347 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-10-10 15:37:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:42,348 INFO L225 Difference]: With dead ends: 115 [2018-10-10 15:37:42,348 INFO L226 Difference]: Without dead ends: 115 [2018-10-10 15:37:42,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:37:42,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-10 15:37:42,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-10-10 15:37:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 15:37:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-10 15:37:42,352 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-10-10 15:37:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:42,352 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-10 15:37:42,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:37:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-10 15:37:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 15:37:42,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:42,354 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:42,354 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:42,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:42,354 INFO L82 PathProgramCache]: Analyzing trace with hash -667472712, now seen corresponding path program 39 times [2018-10-10 15:37:42,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:43,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:43,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:37:43,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:37:43,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:37:43,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:37:43,405 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 43 states. [2018-10-10 15:37:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:44,695 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-10 15:37:44,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:37:44,696 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-10-10 15:37:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:44,697 INFO L225 Difference]: With dead ends: 116 [2018-10-10 15:37:44,697 INFO L226 Difference]: Without dead ends: 116 [2018-10-10 15:37:44,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:37:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-10 15:37:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-10-10 15:37:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 15:37:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-10 15:37:44,700 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-10-10 15:37:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:44,700 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-10 15:37:44,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:37:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-10 15:37:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 15:37:44,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:44,701 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:37:44,702 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:44,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1365352903, now seen corresponding path program 40 times [2018-10-10 15:37:44,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2018-10-10 15:37:44,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:37:44,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 15:37:44,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:37:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:37:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:37:44,995 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 9 states. [2018-10-10 15:37:45,644 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-10 15:37:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:45,786 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-10 15:37:45,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:37:45,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-10-10 15:37:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:45,787 INFO L225 Difference]: With dead ends: 114 [2018-10-10 15:37:45,787 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:37:45,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:37:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:37:45,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:37:45,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:37:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:37:45,788 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2018-10-10 15:37:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:45,789 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:37:45,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:37:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:37:45,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:37:45,795 INFO L202 PluginConnector]: Adding new model memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:37:45 BoogieIcfgContainer [2018-10-10 15:37:45,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:37:45,796 INFO L168 Benchmark]: Toolchain (without parser) took 49450.94 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 457.2 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -379.7 MB). Peak memory consumption was 77.5 MB. Max. memory is 7.1 GB. [2018-10-10 15:37:45,798 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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-10 15:37:45,798 INFO L168 Benchmark]: Boogie Preprocessor took 45.30 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-10 15:37:45,799 INFO L168 Benchmark]: RCFGBuilder took 460.27 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 15:37:45,799 INFO L168 Benchmark]: TraceAbstraction took 48941.48 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 457.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -400.8 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2018-10-10 15:37:45,802 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.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. * Boogie Preprocessor took 45.30 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 460.27 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48941.48 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 457.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -400.8 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: 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, 39 locations, 1 error locations. SAFE Result, 48.8s OverallTime, 41 OverallIterations, 40 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1303 SDtfs, 2319 SDslu, 20359 SDs, 0 SdLazy, 5378 SolverSat, 873 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1738 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1655 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10679 ImplicationChecksByTransitivity, 38.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=40, 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.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 39 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.9s InterpolantComputationTime, 3075 NumberOfCodeBlocks, 3075 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3034 ConstructedInterpolants, 0 QuantifiedInterpolants, 912982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 1600/22140 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/memset2_true-valid-memsafety_true-termination.c_4.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-37-45-813.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/memset2_true-valid-memsafety_true-termination.c_4.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-37-45-813.csv Received shutdown request...