java -Xmx20000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc03-20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 22:38:34,406 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 22:38:34,408 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 22:38:34,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 22:38:34,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 22:38:34,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 22:38:34,422 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 22:38:34,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 22:38:34,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 22:38:34,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 22:38:34,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 22:38:34,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 22:38:34,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 22:38:34,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 22:38:34,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 22:38:34,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 22:38:34,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 22:38:34,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 22:38:34,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 22:38:34,438 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 22:38:34,439 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 22:38:34,440 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 22:38:34,443 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 22:38:34,443 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 22:38:34,443 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 22:38:34,444 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 22:38:34,445 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 22:38:34,446 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 22:38:34,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 22:38:34,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 22:38:34,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 22:38:34,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 22:38:34,449 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 22:38:34,449 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 22:38:34,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 22:38:34,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 22:38:34,451 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-14 22:38:34,464 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 22:38:34,464 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 22:38:34,465 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 22:38:34,465 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 22:38:34,466 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 22:38:34,466 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 22:38:34,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 22:38:34,470 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 22:38:34,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 22:38:34,470 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 22:38:34,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 22:38:34,471 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 22:38:34,471 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 22:38:34,472 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 22:38:34,472 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 22:38:34,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 22:38:34,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 22:38:34,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 22:38:34,567 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 22:38:34,568 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 22:38:34,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-20.bpl [2018-10-14 22:38:34,569 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-20.bpl' [2018-10-14 22:38:34,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 22:38:34,654 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 22:38:34,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 22:38:34,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 22:38:34,655 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 22:38:34,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:38:34" (1/1) ... [2018-10-14 22:38:34,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:38:34" (1/1) ... [2018-10-14 22:38:34,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:38:34" (1/1) ... [2018-10-14 22:38:34,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:38:34" (1/1) ... [2018-10-14 22:38:34,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:38:34" (1/1) ... [2018-10-14 22:38:34,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:38:34" (1/1) ... [2018-10-14 22:38:34,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:38:34" (1/1) ... [2018-10-14 22:38:34,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 22:38:34,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 22:38:34,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 22:38:34,745 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 22:38:34,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:38:34" (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-14 22:38:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 22:38:34,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 22:38:34,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-14 22:38:34,812 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-14 22:38:34,812 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-14 22:38:35,454 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 22:38:35,455 INFO L202 PluginConnector]: Adding new model speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:38:35 BoogieIcfgContainer [2018-10-14 22:38:35,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 22:38:35,456 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 22:38:35,456 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 22:38:35,457 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 22:38:35,460 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:38:35" (1/1) ... [2018-10-14 22:38:35,467 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 22:38:35,467 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 22:38:35,521 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 22:38:35,585 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 22:38:35,624 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 22:38:35,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 22:49:42,083 INFO L315 AbstractInterpreter]: Visited 106 different actions 1367 times. Merged at 64 different actions 862 times. Never widened. Found 419 fixpoints after 21 different actions. Largest state had 67 variables. [2018-10-14 22:49:42,085 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 22:49:42,096 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 22:49:42,965 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 22:49:42,967 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-10-14 22:49:42,967 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 22:49:42,967 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 40 [2018-10-14 22:49:42,967 INFO L248 HeapPartitionManager]: # location blocks :20 [2018-10-14 22:49:42,969 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 22:49:43,070 INFO L202 PluginConnector]: Adding new model speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 10:49:43 BasicIcfg [2018-10-14 22:49:43,071 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 22:49:43,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 22:49:43,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 22:49:43,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 22:49:43,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:38:34" (1/3) ... [2018-10-14 22:49:43,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692fe3a and model type speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:49:43, skipping insertion in model container [2018-10-14 22:49:43,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:38:35" (2/3) ... [2018-10-14 22:49:43,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692fe3a and model type speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:49:43, skipping insertion in model container [2018-10-14 22:49:43,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 10:49:43" (3/3) ... [2018-10-14 22:49:43,080 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 22:49:43,093 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 22:49:43,102 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2018-10-14 22:49:43,119 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2018-10-14 22:49:43,144 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 22:49:43,145 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 22:49:43,145 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 22:49:43,145 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 22:49:43,145 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 22:49:43,145 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 22:49:43,146 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 22:49:43,146 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 22:49:43,146 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 22:49:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-10-14 22:49:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-14 22:49:43,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:43,178 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:43,180 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:43,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1855956792, now seen corresponding path program 1 times [2018-10-14 22:49:43,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:43,575 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-10-14 22:49:43,589 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-14 22:49:43,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:43,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:43,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:43,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:43,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:43,614 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2018-10-14 22:49:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:43,741 INFO L93 Difference]: Finished difference Result 128 states and 167 transitions. [2018-10-14 22:49:43,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:43,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-14 22:49:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:43,756 INFO L225 Difference]: With dead ends: 128 [2018-10-14 22:49:43,756 INFO L226 Difference]: Without dead ends: 122 [2018-10-14 22:49:43,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-14 22:49:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2018-10-14 22:49:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:43,802 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 42 [2018-10-14 22:49:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:43,802 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:43,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-14 22:49:43,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:43,804 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:43,805 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:43,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:43,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1700086179, now seen corresponding path program 1 times [2018-10-14 22:49:43,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:49:43,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:43,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:43,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:43,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:43,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:43,913 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:43,983 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:43,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-14 22:49:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:43,988 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:43,988 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:43,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 89. [2018-10-14 22:49:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-14 22:49:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 169 transitions. [2018-10-14 22:49:44,003 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 169 transitions. Word has length 43 [2018-10-14 22:49:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:44,007 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 169 transitions. [2018-10-14 22:49:44,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 169 transitions. [2018-10-14 22:49:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-14 22:49:44,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:44,009 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:44,010 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:44,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:44,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1163061877, now seen corresponding path program 1 times [2018-10-14 22:49:44,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:44,129 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-14 22:49:44,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:44,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:44,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:44,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:44,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:44,131 INFO L87 Difference]: Start difference. First operand 89 states and 169 transitions. Second operand 4 states. [2018-10-14 22:49:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:44,186 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:44,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:44,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-10-14 22:49:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:44,192 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:44,192 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:44,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:44,201 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 44 [2018-10-14 22:49:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:44,203 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:44,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-14 22:49:44,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:44,204 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:44,208 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:44,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1163064474, now seen corresponding path program 1 times [2018-10-14 22:49:44,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:44,290 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-14 22:49:44,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:44,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:44,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:44,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:44,292 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:44,385 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:44,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:44,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-14 22:49:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:44,389 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:44,389 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:44,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:44,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 91. [2018-10-14 22:49:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-14 22:49:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 171 transitions. [2018-10-14 22:49:44,407 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 171 transitions. Word has length 44 [2018-10-14 22:49:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:44,408 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 171 transitions. [2018-10-14 22:49:44,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 171 transitions. [2018-10-14 22:49:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-14 22:49:44,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:44,412 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:44,413 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:44,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1695181255, now seen corresponding path program 1 times [2018-10-14 22:49:44,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:44,572 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-14 22:49:44,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:44,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:44,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:44,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:44,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:44,574 INFO L87 Difference]: Start difference. First operand 91 states and 171 transitions. Second operand 4 states. [2018-10-14 22:49:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:44,625 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:44,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-10-14 22:49:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:44,627 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:44,627 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:44,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:44,634 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 45 [2018-10-14 22:49:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:44,634 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:44,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-14 22:49:44,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:44,636 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:44,636 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:44,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1695260805, now seen corresponding path program 1 times [2018-10-14 22:49:44,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:44,718 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-14 22:49:44,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:44,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:44,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:44,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:44,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:44,720 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:44,739 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:44,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:44,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-14 22:49:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:44,743 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:44,743 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:44,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2018-10-14 22:49:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-14 22:49:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 173 transitions. [2018-10-14 22:49:44,750 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 173 transitions. Word has length 45 [2018-10-14 22:49:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:44,750 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 173 transitions. [2018-10-14 22:49:44,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2018-10-14 22:49:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-14 22:49:44,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:44,752 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:44,752 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:44,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1011041621, now seen corresponding path program 1 times [2018-10-14 22:49:44,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:44,896 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-14 22:49:44,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:44,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:44,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:44,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:44,897 INFO L87 Difference]: Start difference. First operand 93 states and 173 transitions. Second operand 4 states. [2018-10-14 22:49:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:45,030 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:45,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:45,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-10-14 22:49:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:45,032 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:45,032 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:45,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:45,037 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 46 [2018-10-14 22:49:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:45,037 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:45,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:45,038 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-14 22:49:45,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:45,039 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:45,039 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:45,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:45,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1013477884, now seen corresponding path program 1 times [2018-10-14 22:49:45,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:45,140 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-14 22:49:45,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:45,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:45,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:45,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:45,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:45,142 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:45,216 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:45,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:45,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-14 22:49:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:45,218 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:45,218 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:45,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2018-10-14 22:49:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-14 22:49:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 175 transitions. [2018-10-14 22:49:45,224 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 175 transitions. Word has length 46 [2018-10-14 22:49:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:45,224 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 175 transitions. [2018-10-14 22:49:45,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2018-10-14 22:49:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-14 22:49:45,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:45,226 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:45,226 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:45,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1278443179, now seen corresponding path program 1 times [2018-10-14 22:49:45,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:45,281 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-14 22:49:45,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:45,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:45,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:45,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:45,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:45,283 INFO L87 Difference]: Start difference. First operand 95 states and 175 transitions. Second operand 4 states. [2018-10-14 22:49:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:45,336 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:45,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:45,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-10-14 22:49:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:45,339 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:45,339 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:45,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:45,343 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 47 [2018-10-14 22:49:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:45,344 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:45,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-14 22:49:45,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:45,345 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:45,346 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:45,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:45,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1353043815, now seen corresponding path program 1 times [2018-10-14 22:49:45,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:45,395 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-14 22:49:45,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:45,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:45,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:45,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:45,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:45,397 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:45,413 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:45,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:45,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-14 22:49:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:45,415 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:45,415 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:45,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2018-10-14 22:49:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-14 22:49:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 177 transitions. [2018-10-14 22:49:45,420 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 177 transitions. Word has length 47 [2018-10-14 22:49:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:45,421 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 177 transitions. [2018-10-14 22:49:45,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2018-10-14 22:49:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-14 22:49:45,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:45,422 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:45,423 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:45,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:45,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1005662517, now seen corresponding path program 1 times [2018-10-14 22:49:45,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:45,507 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-14 22:49:45,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:45,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:45,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:45,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:45,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:45,508 INFO L87 Difference]: Start difference. First operand 97 states and 177 transitions. Second operand 4 states. [2018-10-14 22:49:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:45,537 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:45,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:45,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-10-14 22:49:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:45,539 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:45,539 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:45,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:45,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:45,543 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 48 [2018-10-14 22:49:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:45,544 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:45,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-14 22:49:45,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:45,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:45,546 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:45,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1005314210, now seen corresponding path program 1 times [2018-10-14 22:49:45,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:45,653 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-14 22:49:45,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:45,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:45,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:45,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:45,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:45,654 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:45,692 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:45,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:45,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-10-14 22:49:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:45,694 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:45,694 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:45,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:45,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:45,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2018-10-14 22:49:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-14 22:49:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 179 transitions. [2018-10-14 22:49:45,698 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 179 transitions. Word has length 48 [2018-10-14 22:49:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:45,699 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 179 transitions. [2018-10-14 22:49:45,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 179 transitions. [2018-10-14 22:49:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-14 22:49:45,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:45,700 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:45,701 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:45,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1998271119, now seen corresponding path program 1 times [2018-10-14 22:49:45,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:45,797 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-14 22:49:45,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:45,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:45,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:45,798 INFO L87 Difference]: Start difference. First operand 99 states and 179 transitions. Second operand 4 states. [2018-10-14 22:49:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:45,904 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:45,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:45,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-10-14 22:49:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:45,906 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:45,906 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:45,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:45,910 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 49 [2018-10-14 22:49:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:45,910 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:45,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-14 22:49:45,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:45,911 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:45,914 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:45,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:45,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1099968951, now seen corresponding path program 1 times [2018-10-14 22:49:45,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:46,017 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-14 22:49:46,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:46,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:46,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:46,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:46,018 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:46,099 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:46,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:46,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-10-14 22:49:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:46,100 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:46,100 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:46,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2018-10-14 22:49:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-14 22:49:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 181 transitions. [2018-10-14 22:49:46,104 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 181 transitions. Word has length 49 [2018-10-14 22:49:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:46,105 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 181 transitions. [2018-10-14 22:49:46,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 181 transitions. [2018-10-14 22:49:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-14 22:49:46,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:46,106 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:46,106 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:46,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash -735293931, now seen corresponding path program 1 times [2018-10-14 22:49:46,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:46,251 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-14 22:49:46,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:46,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:46,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:46,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:46,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:46,252 INFO L87 Difference]: Start difference. First operand 101 states and 181 transitions. Second operand 4 states. [2018-10-14 22:49:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:46,373 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:46,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:46,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-10-14 22:49:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:46,374 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:46,374 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:46,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:46,379 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 50 [2018-10-14 22:49:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:46,379 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:46,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-14 22:49:46,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:46,380 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:46,380 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:46,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:46,381 INFO L82 PathProgramCache]: Analyzing trace with hash 260701376, now seen corresponding path program 1 times [2018-10-14 22:49:46,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:46,459 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-14 22:49:46,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:46,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:46,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:46,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:46,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:46,461 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:46,503 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:46,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:46,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-14 22:49:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:46,506 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:46,506 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:46,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2018-10-14 22:49:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-14 22:49:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 183 transitions. [2018-10-14 22:49:46,510 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 183 transitions. Word has length 50 [2018-10-14 22:49:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:46,511 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 183 transitions. [2018-10-14 22:49:46,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 183 transitions. [2018-10-14 22:49:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-14 22:49:46,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:46,512 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:46,512 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:46,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1168237939, now seen corresponding path program 1 times [2018-10-14 22:49:46,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:46,602 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-14 22:49:46,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:46,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:46,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:46,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:46,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:46,604 INFO L87 Difference]: Start difference. First operand 103 states and 183 transitions. Second operand 4 states. [2018-10-14 22:49:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:46,645 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:46,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:46,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-14 22:49:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:46,648 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:46,648 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:46,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:46,652 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 51 [2018-10-14 22:49:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:46,652 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:46,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-14 22:49:46,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:46,653 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:46,654 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:46,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:46,654 INFO L82 PathProgramCache]: Analyzing trace with hash -508191445, now seen corresponding path program 1 times [2018-10-14 22:49:46,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:46,748 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-14 22:49:46,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:46,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:46,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:46,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:46,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:46,750 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:46,830 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:46,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:46,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-10-14 22:49:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:46,831 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:46,831 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:46,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:46,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 105. [2018-10-14 22:49:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-14 22:49:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 185 transitions. [2018-10-14 22:49:46,835 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 185 transitions. Word has length 51 [2018-10-14 22:49:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:46,835 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 185 transitions. [2018-10-14 22:49:46,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 185 transitions. [2018-10-14 22:49:46,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-14 22:49:46,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:46,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:46,837 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:46,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:46,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1659124725, now seen corresponding path program 1 times [2018-10-14 22:49:46,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:46,897 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-14 22:49:46,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:46,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:46,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:46,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:46,898 INFO L87 Difference]: Start difference. First operand 105 states and 185 transitions. Second operand 4 states. [2018-10-14 22:49:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:46,964 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:46,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:46,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-10-14 22:49:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:46,965 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:46,966 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:46,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:46,970 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 52 [2018-10-14 22:49:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:46,971 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:46,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-14 22:49:46,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:46,972 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:46,972 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:46,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:46,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1425934882, now seen corresponding path program 1 times [2018-10-14 22:49:46,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:47,059 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-14 22:49:47,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:47,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:47,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:47,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:47,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:47,061 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:47,113 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:47,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:47,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-14 22:49:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:47,114 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:47,114 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:47,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2018-10-14 22:49:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-14 22:49:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 187 transitions. [2018-10-14 22:49:47,118 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 187 transitions. Word has length 52 [2018-10-14 22:49:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:47,119 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 187 transitions. [2018-10-14 22:49:47,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 187 transitions. [2018-10-14 22:49:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-14 22:49:47,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:47,120 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:47,120 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:47,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:47,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1903691945, now seen corresponding path program 1 times [2018-10-14 22:49:47,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:47,219 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-14 22:49:47,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:47,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:47,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:47,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:47,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:47,221 INFO L87 Difference]: Start difference. First operand 107 states and 187 transitions. Second operand 4 states. [2018-10-14 22:49:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:47,252 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:47,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:47,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-10-14 22:49:47,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:47,256 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:47,256 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:47,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:47,260 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 53 [2018-10-14 22:49:47,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:47,261 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:47,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-14 22:49:47,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:47,262 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:47,262 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:47,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:47,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1254308877, now seen corresponding path program 1 times [2018-10-14 22:49:47,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:47,330 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-14 22:49:47,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:47,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:47,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:47,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:47,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:47,332 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:47,353 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:47,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:47,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-10-14 22:49:47,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:47,357 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:47,357 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:47,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-10-14 22:49:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-14 22:49:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 189 transitions. [2018-10-14 22:49:47,361 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 189 transitions. Word has length 53 [2018-10-14 22:49:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:47,361 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 189 transitions. [2018-10-14 22:49:47,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 189 transitions. [2018-10-14 22:49:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-14 22:49:47,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:47,362 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:47,362 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:47,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:47,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1244175061, now seen corresponding path program 1 times [2018-10-14 22:49:47,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:47,481 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-14 22:49:47,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:47,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:47,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:47,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:47,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:47,482 INFO L87 Difference]: Start difference. First operand 109 states and 189 transitions. Second operand 4 states. [2018-10-14 22:49:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:47,645 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:47,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:47,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-10-14 22:49:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:47,646 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:47,646 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:47,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:47,650 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 54 [2018-10-14 22:49:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:47,650 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:47,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:47,650 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-14 22:49:47,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:47,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:47,651 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:47,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:47,652 INFO L82 PathProgramCache]: Analyzing trace with hash 228870020, now seen corresponding path program 1 times [2018-10-14 22:49:47,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:47,727 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-14 22:49:47,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:47,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:47,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:47,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:47,728 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:47,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:47,800 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:47,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:47,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-14 22:49:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:47,802 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:47,802 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:47,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 111. [2018-10-14 22:49:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-14 22:49:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 191 transitions. [2018-10-14 22:49:47,805 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 191 transitions. Word has length 54 [2018-10-14 22:49:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:47,805 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 191 transitions. [2018-10-14 22:49:47,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 191 transitions. [2018-10-14 22:49:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-14 22:49:47,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:47,807 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:47,807 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:47,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash -378681285, now seen corresponding path program 1 times [2018-10-14 22:49:47,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:47,959 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-14 22:49:47,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:47,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:47,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:47,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:47,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:47,961 INFO L87 Difference]: Start difference. First operand 111 states and 191 transitions. Second operand 4 states. [2018-10-14 22:49:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:48,083 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:48,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:48,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-10-14 22:49:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:48,084 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:48,085 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:48,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:48,087 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 55 [2018-10-14 22:49:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:48,088 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:48,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-14 22:49:48,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:48,089 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:48,089 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:48,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1494963473, now seen corresponding path program 1 times [2018-10-14 22:49:48,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:48,140 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-14 22:49:48,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:48,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:48,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:48,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:48,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:48,141 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:48,159 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:48,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:48,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-10-14 22:49:48,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:48,160 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:48,161 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:48,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2018-10-14 22:49:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-14 22:49:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 193 transitions. [2018-10-14 22:49:48,165 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 193 transitions. Word has length 55 [2018-10-14 22:49:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:48,165 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 193 transitions. [2018-10-14 22:49:48,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 193 transitions. [2018-10-14 22:49:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-14 22:49:48,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:48,166 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:48,166 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:48,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:48,167 INFO L82 PathProgramCache]: Analyzing trace with hash 640223925, now seen corresponding path program 1 times [2018-10-14 22:49:48,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:48,323 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-14 22:49:48,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:48,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:48,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:48,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:48,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:48,325 INFO L87 Difference]: Start difference. First operand 113 states and 193 transitions. Second operand 4 states. [2018-10-14 22:49:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:48,472 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:48,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:48,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-10-14 22:49:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:48,474 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:48,474 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:48,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:48,477 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 56 [2018-10-14 22:49:48,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:48,478 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:48,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-14 22:49:48,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:48,478 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:48,479 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:48,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:48,479 INFO L82 PathProgramCache]: Analyzing trace with hash 900773094, now seen corresponding path program 1 times [2018-10-14 22:49:48,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:48,557 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-14 22:49:48,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:48,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:48,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:48,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:48,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:48,558 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:48,627 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:48,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-10-14 22:49:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:48,628 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:48,628 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:48,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2018-10-14 22:49:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-14 22:49:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 195 transitions. [2018-10-14 22:49:48,632 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 195 transitions. Word has length 56 [2018-10-14 22:49:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:48,632 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 195 transitions. [2018-10-14 22:49:48,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 195 transitions. [2018-10-14 22:49:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-14 22:49:48,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:48,633 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:48,633 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:48,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:48,634 INFO L82 PathProgramCache]: Analyzing trace with hash -120342497, now seen corresponding path program 1 times [2018-10-14 22:49:48,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:48,785 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-14 22:49:48,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:48,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:48,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:48,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:48,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:48,787 INFO L87 Difference]: Start difference. First operand 115 states and 195 transitions. Second operand 4 states. [2018-10-14 22:49:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:48,928 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:48,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:48,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-10-14 22:49:48,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:48,930 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:48,930 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:48,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:48,938 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 57 [2018-10-14 22:49:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:48,938 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:48,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-14 22:49:48,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:48,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:48,939 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:48,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2140804655, now seen corresponding path program 1 times [2018-10-14 22:49:48,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:49,011 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-14 22:49:49,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:49,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:49,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:49,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:49,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:49,012 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:49,084 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:49,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:49,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-10-14 22:49:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:49,086 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:49,086 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:49,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2018-10-14 22:49:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-14 22:49:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 197 transitions. [2018-10-14 22:49:49,091 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 197 transitions. Word has length 57 [2018-10-14 22:49:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:49,091 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 197 transitions. [2018-10-14 22:49:49,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 197 transitions. [2018-10-14 22:49:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-14 22:49:49,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:49,092 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:49,092 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:49,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash 53816213, now seen corresponding path program 1 times [2018-10-14 22:49:49,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:49,243 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-14 22:49:49,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:49,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:49,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:49,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:49,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:49,244 INFO L87 Difference]: Start difference. First operand 117 states and 197 transitions. Second operand 4 states. [2018-10-14 22:49:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:49,390 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:49,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:49,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-10-14 22:49:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:49,392 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:49,392 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:49,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:49,397 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 58 [2018-10-14 22:49:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:49,397 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:49,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-14 22:49:49,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:49,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:49,398 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:49,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:49,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1940434360, now seen corresponding path program 1 times [2018-10-14 22:49:49,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:49,480 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-14 22:49:49,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:49,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:49,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:49,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:49,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:49,481 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:49,555 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:49,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:49,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-14 22:49:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:49,557 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:49,557 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:49,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-10-14 22:49:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-14 22:49:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 199 transitions. [2018-10-14 22:49:49,562 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 199 transitions. Word has length 58 [2018-10-14 22:49:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:49,562 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 199 transitions. [2018-10-14 22:49:49,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 199 transitions. [2018-10-14 22:49:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-14 22:49:49,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:49,565 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:49,565 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:49,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:49,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1273354493, now seen corresponding path program 1 times [2018-10-14 22:49:49,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:49,726 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-14 22:49:49,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:49,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:49,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:49,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:49,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:49,729 INFO L87 Difference]: Start difference. First operand 119 states and 199 transitions. Second operand 4 states. [2018-10-14 22:49:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:49,883 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:49,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:49,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-10-14 22:49:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:49,885 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:49,885 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:49,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:49,889 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 59 [2018-10-14 22:49:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:49,890 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:49,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-14 22:49:49,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:49,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:49,891 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:49,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:49,892 INFO L82 PathProgramCache]: Analyzing trace with hash -23922509, now seen corresponding path program 1 times [2018-10-14 22:49:49,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:49,966 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-14 22:49:49,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:49,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:49,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:49,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:49,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:49,967 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:50,037 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:50,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:50,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-10-14 22:49:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:50,039 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:50,039 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:50,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2018-10-14 22:49:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-14 22:49:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 201 transitions. [2018-10-14 22:49:50,042 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 201 transitions. Word has length 59 [2018-10-14 22:49:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:50,043 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 201 transitions. [2018-10-14 22:49:50,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 201 transitions. [2018-10-14 22:49:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-14 22:49:50,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:50,044 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:50,044 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:50,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1816355467, now seen corresponding path program 1 times [2018-10-14 22:49:50,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:50,206 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-14 22:49:50,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:50,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:50,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:50,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:50,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:50,207 INFO L87 Difference]: Start difference. First operand 121 states and 201 transitions. Second operand 4 states. [2018-10-14 22:49:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:50,348 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:50,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:50,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-10-14 22:49:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:50,350 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:50,350 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:50,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:50,353 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 60 [2018-10-14 22:49:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:50,353 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:50,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-14 22:49:50,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:50,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:50,355 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:50,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash -741597270, now seen corresponding path program 1 times [2018-10-14 22:49:50,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:50,437 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-14 22:49:50,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:50,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:50,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:50,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:50,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:50,438 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:50,515 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:50,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:50,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-14 22:49:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:50,516 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:50,517 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 22:49:50,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 22:49:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-10-14 22:49:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-14 22:49:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 203 transitions. [2018-10-14 22:49:50,520 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 203 transitions. Word has length 60 [2018-10-14 22:49:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:50,521 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 203 transitions. [2018-10-14 22:49:50,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 203 transitions. [2018-10-14 22:49:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-14 22:49:50,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:50,522 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:50,522 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:50,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:50,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1316915993, now seen corresponding path program 1 times [2018-10-14 22:49:50,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:50,675 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-14 22:49:50,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:50,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:50,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:50,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:50,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:50,677 INFO L87 Difference]: Start difference. First operand 123 states and 203 transitions. Second operand 4 states. [2018-10-14 22:49:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:50,818 INFO L93 Difference]: Finished difference Result 127 states and 205 transitions. [2018-10-14 22:49:50,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:50,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-10-14 22:49:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:50,820 INFO L225 Difference]: With dead ends: 127 [2018-10-14 22:49:50,820 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 22:49:50,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 22:49:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-10-14 22:49:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 22:49:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2018-10-14 22:49:50,822 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 61 [2018-10-14 22:49:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:50,823 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2018-10-14 22:49:50,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2018-10-14 22:49:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-14 22:49:50,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:50,824 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:50,824 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:50,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:50,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1514678379, now seen corresponding path program 1 times [2018-10-14 22:49:50,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:50,906 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-14 22:49:50,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:49:50,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:49:50,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:49:50,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:49:50,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:50,907 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand 3 states. [2018-10-14 22:49:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:50,959 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-10-14 22:49:50,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:49:50,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-10-14 22:49:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:50,960 INFO L225 Difference]: With dead ends: 126 [2018-10-14 22:49:50,961 INFO L226 Difference]: Without dead ends: 107 [2018-10-14 22:49:50,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:49:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-14 22:49:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-10-14 22:49:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-14 22:49:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 184 transitions. [2018-10-14 22:49:50,964 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 184 transitions. Word has length 61 [2018-10-14 22:49:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:50,964 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 184 transitions. [2018-10-14 22:49:50,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:49:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 184 transitions. [2018-10-14 22:49:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-14 22:49:50,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:50,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:50,966 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:50,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:50,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1716453461, now seen corresponding path program 1 times [2018-10-14 22:49:50,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:51,115 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-14 22:49:51,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:51,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:51,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:51,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:51,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:51,117 INFO L87 Difference]: Start difference. First operand 106 states and 184 transitions. Second operand 4 states. [2018-10-14 22:49:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:51,262 INFO L93 Difference]: Finished difference Result 107 states and 183 transitions. [2018-10-14 22:49:51,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:51,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-10-14 22:49:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:51,264 INFO L225 Difference]: With dead ends: 107 [2018-10-14 22:49:51,264 INFO L226 Difference]: Without dead ends: 89 [2018-10-14 22:49:51,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-14 22:49:51,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2018-10-14 22:49:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-14 22:49:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2018-10-14 22:49:51,266 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 103 transitions. Word has length 62 [2018-10-14 22:49:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:51,266 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 103 transitions. [2018-10-14 22:49:51,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 103 transitions. [2018-10-14 22:49:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-14 22:49:51,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:49:51,267 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:49:51,267 INFO L424 AbstractCegarLoop]: === Iteration 40 === [mainErr18ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr19ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:49:51,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:49:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1881801163, now seen corresponding path program 1 times [2018-10-14 22:49:51,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:49:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:49:51,427 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-14 22:49:51,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:49:51,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:49:51,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:49:51,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:49:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:51,428 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. Second operand 4 states. [2018-10-14 22:49:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:49:51,482 INFO L93 Difference]: Finished difference Result 64 states and 102 transitions. [2018-10-14 22:49:51,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:49:51,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-10-14 22:49:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:49:51,483 INFO L225 Difference]: With dead ends: 64 [2018-10-14 22:49:51,483 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 22:49:51,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:49:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 22:49:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 22:49:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 22:49:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 22:49:51,483 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-10-14 22:49:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:49:51,484 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 22:49:51,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:49:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 22:49:51,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 22:49:51,488 INFO L202 PluginConnector]: Adding new model speedup-poc03-20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:49:51 BasicIcfg [2018-10-14 22:49:51,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 22:49:51,489 INFO L168 Benchmark]: Toolchain (without parser) took 676836.18 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -549.0 MB). Peak memory consumption was 512.7 MB. Max. memory is 17.8 GB. [2018-10-14 22:49:51,492 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:49:51,496 INFO L168 Benchmark]: Boogie Preprocessor took 89.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:49:51,496 INFO L168 Benchmark]: RCFGBuilder took 710.85 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 17.8 GB. [2018-10-14 22:49:51,499 INFO L168 Benchmark]: IcfgTransformer took 667615.77 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 535.8 MB). Free memory was 1.4 GB in the beginning and 786.4 MB in the end (delta: 642.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 17.8 GB. [2018-10-14 22:49:51,499 INFO L168 Benchmark]: TraceAbstraction took 8415.58 ms. Allocated memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: 525.9 MB). Free memory was 786.4 MB in the beginning and 2.0 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:49:51,502 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. * Boogie Preprocessor took 89.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. * RCFGBuilder took 710.85 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 17.8 GB. * IcfgTransformer took 667615.77 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 535.8 MB). Free memory was 1.4 GB in the beginning and 786.4 MB in the end (delta: 642.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 17.8 GB. * TraceAbstraction took 8415.58 ms. Allocated memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: 525.9 MB). Free memory was 786.4 MB in the beginning and 2.0 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 17.8 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 86 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1948 LocStat_NO_SUPPORTING_DISEQUALITIES : 54984 LocStat_NO_DISJUNCTIONS : -172 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 108 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 145 TransStat_NO_SUPPORTING_DISEQUALITIES : 20 TransStat_NO_DISJUNCTIONS : 108 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 654983.37 APPLY_RETURN(MILLISECONDS) : 628.89 #APPLY_NORMAL : 1345 #APPLY_RETURN : 22 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 106 different actions 1367 times. Merged at 64 different actions 862 times. Never widened. Found 419 fixpoints after 21 different actions. Largest state had 67 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 20 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : null COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : null COUNT_ARRAY_READS for [#memory_int] : null * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 123]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 108]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 117]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 116]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 124]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 105]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 111]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 118]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 110]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 109]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 115]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 106]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 113]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 122]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 112]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 121]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 107]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 114]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 120]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 119]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 20 error locations. SAFE Result, 8.3s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4517 SDtfs, 2512 SDslu, 4816 SDs, 0 SdLazy, 335 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=36, 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, 40 MinimizatonAttempts, 1197 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2100 NumberOfCodeBlocks, 2100 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2060 ConstructedInterpolants, 0 QuantifiedInterpolants, 292980 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 20 PerfectInterpolantSequences, 0/20 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/speedup-poc03-20.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-14_22-49-51-520.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-20.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-14_22-49-51-520.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-20.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-14_22-49-51-520.csv The toolchain threw an exception: class java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" RESULT: An exception occured during the execution of Ultimate: The toolchain threw an exception java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark.createCsvProvider(AbsIntBenchmark.java:42) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.writeCsvLogs(CommandLineController.java:342) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.displayToolchainResults(CommandLineController.java:325) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:343) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at sun.reflect.Reflection.ensureMemberAccess(Reflection.java:102) at java.lang.reflect.AccessibleObject.slowCheckMemberAccess(AccessibleObject.java:296) at java.lang.reflect.AccessibleObject.checkAccess(AccessibleObject.java:288) at java.lang.reflect.Field.get(Field.java:390) at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:275) ... 6 more Received shutdown request...