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-14.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 22:26:00,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 22:26:01,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 22:26:01,016 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 22:26:01,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 22:26:01,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 22:26:01,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 22:26:01,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 22:26:01,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 22:26:01,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 22:26:01,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 22:26:01,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 22:26:01,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 22:26:01,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 22:26:01,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 22:26:01,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 22:26:01,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 22:26:01,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 22:26:01,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 22:26:01,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 22:26:01,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 22:26:01,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 22:26:01,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 22:26:01,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 22:26:01,064 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 22:26:01,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 22:26:01,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 22:26:01,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 22:26:01,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 22:26:01,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 22:26:01,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 22:26:01,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 22:26:01,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 22:26:01,071 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 22:26:01,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 22:26:01,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 22:26:01,075 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:26:01,090 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 22:26:01,090 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 22:26:01,091 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 22:26:01,091 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 22:26:01,091 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 22:26:01,091 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 22:26:01,095 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 22:26:01,096 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 22:26:01,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 22:26:01,096 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 22:26:01,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 22:26:01,097 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 22:26:01,097 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 22:26:01,098 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 22:26:01,098 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 22:26:01,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 22:26:01,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 22:26:01,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 22:26:01,182 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 22:26:01,182 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 22:26:01,183 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-14.bpl [2018-10-14 22:26:01,183 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-14.bpl' [2018-10-14 22:26:01,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 22:26:01,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 22:26:01,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 22:26:01,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 22:26:01,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 22:26:01,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:26:01" (1/1) ... [2018-10-14 22:26:01,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:26:01" (1/1) ... [2018-10-14 22:26:01,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:26:01" (1/1) ... [2018-10-14 22:26:01,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:26:01" (1/1) ... [2018-10-14 22:26:01,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:26:01" (1/1) ... [2018-10-14 22:26:01,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:26:01" (1/1) ... [2018-10-14 22:26:01,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:26:01" (1/1) ... [2018-10-14 22:26:01,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 22:26:01,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 22:26:01,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 22:26:01,330 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 22:26:01,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:26:01" (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:26:01,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 22:26:01,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 22:26:01,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-14 22:26:01,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-14 22:26:01,400 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-14 22:26:01,940 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 22:26:01,941 INFO L202 PluginConnector]: Adding new model speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:26:01 BoogieIcfgContainer [2018-10-14 22:26:01,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 22:26:01,942 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 22:26:01,942 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 22:26:01,943 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 22:26:01,947 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:26:01" (1/1) ... [2018-10-14 22:26:01,954 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 22:26:01,954 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 22:26:01,999 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 22:26:02,061 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 22:26:02,094 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 22:26:02,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 22:28:19,667 INFO L315 AbstractInterpreter]: Visited 76 different actions 707 times. Merged at 46 different actions 436 times. Never widened. Found 209 fixpoints after 15 different actions. Largest state had 49 variables. [2018-10-14 22:28:19,675 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 22:28:19,683 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 22:28:20,031 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 22:28:20,031 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-10-14 22:28:20,032 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 22:28:20,032 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 28 [2018-10-14 22:28:20,032 INFO L248 HeapPartitionManager]: # location blocks :14 [2018-10-14 22:28:20,033 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 22:28:20,102 INFO L202 PluginConnector]: Adding new model speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 10:28:20 BasicIcfg [2018-10-14 22:28:20,102 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 22:28:20,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 22:28:20,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 22:28:20,106 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 22:28:20,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:26:01" (1/3) ... [2018-10-14 22:28:20,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438cbed2 and model type speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:28:20, skipping insertion in model container [2018-10-14 22:28:20,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:26:01" (2/3) ... [2018-10-14 22:28:20,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438cbed2 and model type speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:28:20, skipping insertion in model container [2018-10-14 22:28:20,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 10:28:20" (3/3) ... [2018-10-14 22:28:20,110 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 22:28:20,121 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 22:28:20,128 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-14 22:28:20,145 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-10-14 22:28:20,168 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 22:28:20,168 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 22:28:20,169 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 22:28:20,169 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 22:28:20,169 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 22:28:20,169 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 22:28:20,170 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 22:28:20,170 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 22:28:20,170 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 22:28:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-10-14 22:28:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-14 22:28:20,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:20,193 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] [2018-10-14 22:28:20,194 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:20,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1017889102, now seen corresponding path program 1 times [2018-10-14 22:28:20,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:20,498 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:28:20,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:20,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:20,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:20,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:20,592 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-10-14 22:28:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:20,705 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2018-10-14 22:28:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:20,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-14 22:28:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:20,726 INFO L225 Difference]: With dead ends: 92 [2018-10-14 22:28:20,726 INFO L226 Difference]: Without dead ends: 86 [2018-10-14 22:28:20,731 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:28:20,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-14 22:28:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-10-14 22:28:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:20,774 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 30 [2018-10-14 22:28:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:20,774 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:20,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-14 22:28:20,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:20,776 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] [2018-10-14 22:28:20,776 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:20,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:20,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1489790741, now seen corresponding path program 1 times [2018-10-14 22:28:20,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:20,856 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:28:20,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:20,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:20,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:20,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:20,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:20,860 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:20,916 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:20,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:20,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-14 22:28:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:20,918 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:20,918 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:20,919 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:28:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2018-10-14 22:28:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-14 22:28:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 121 transitions. [2018-10-14 22:28:20,928 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 121 transitions. Word has length 31 [2018-10-14 22:28:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:20,929 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 121 transitions. [2018-10-14 22:28:20,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 121 transitions. [2018-10-14 22:28:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-14 22:28:20,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:20,931 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] [2018-10-14 22:28:20,931 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:20,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1061125231, now seen corresponding path program 1 times [2018-10-14 22:28:20,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:21,033 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:28:21,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:21,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:21,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:21,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:21,035 INFO L87 Difference]: Start difference. First operand 65 states and 121 transitions. Second operand 4 states. [2018-10-14 22:28:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:21,179 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:21,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-10-14 22:28:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:21,182 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:21,182 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:21,182 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:28:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:21,190 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 32 [2018-10-14 22:28:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:21,191 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:21,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-14 22:28:21,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:21,192 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] [2018-10-14 22:28:21,192 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:21,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1061127636, now seen corresponding path program 1 times [2018-10-14 22:28:21,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:21,303 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:28:21,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:21,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:21,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:21,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:21,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:21,304 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:21,347 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:21,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:21,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-14 22:28:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:21,350 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:21,350 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:21,350 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:28:21,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2018-10-14 22:28:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-14 22:28:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 123 transitions. [2018-10-14 22:28:21,367 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 123 transitions. Word has length 32 [2018-10-14 22:28:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:21,367 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 123 transitions. [2018-10-14 22:28:21,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 123 transitions. [2018-10-14 22:28:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-14 22:28:21,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:21,371 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] [2018-10-14 22:28:21,371 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:21,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:21,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1464854897, now seen corresponding path program 1 times [2018-10-14 22:28:21,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:21,467 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:28:21,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:21,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:21,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:21,469 INFO L87 Difference]: Start difference. First operand 67 states and 123 transitions. Second operand 4 states. [2018-10-14 22:28:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:21,512 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:21,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:21,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-10-14 22:28:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:21,515 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:21,515 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:21,516 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:28:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:21,522 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 33 [2018-10-14 22:28:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:21,523 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:21,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-14 22:28:21,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:21,525 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] [2018-10-14 22:28:21,526 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:21,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:21,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1464781299, now seen corresponding path program 1 times [2018-10-14 22:28:21,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:21,612 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:28:21,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:21,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:21,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:21,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:21,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:21,615 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:21,668 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:21,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:21,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-10-14 22:28:21,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:21,670 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:21,671 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:21,672 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:28:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 69. [2018-10-14 22:28:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-14 22:28:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 125 transitions. [2018-10-14 22:28:21,677 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 125 transitions. Word has length 33 [2018-10-14 22:28:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:21,678 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 125 transitions. [2018-10-14 22:28:21,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 125 transitions. [2018-10-14 22:28:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-14 22:28:21,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:21,679 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] [2018-10-14 22:28:21,680 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:21,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:21,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1834168591, now seen corresponding path program 1 times [2018-10-14 22:28:21,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:21,753 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:28:21,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:21,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:21,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:21,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:21,756 INFO L87 Difference]: Start difference. First operand 69 states and 125 transitions. Second operand 4 states. [2018-10-14 22:28:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:21,810 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:21,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-10-14 22:28:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:21,812 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:21,812 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:21,812 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:28:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:21,817 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 34 [2018-10-14 22:28:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:21,817 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:21,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-14 22:28:21,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:21,819 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] [2018-10-14 22:28:21,819 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:21,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:21,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1836420342, now seen corresponding path program 1 times [2018-10-14 22:28:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:21,897 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:28:21,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:21,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:21,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:21,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:21,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:21,899 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:21,972 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:21,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:21,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-14 22:28:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:21,975 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:21,975 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:21,976 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:28:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2018-10-14 22:28:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-14 22:28:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 127 transitions. [2018-10-14 22:28:21,983 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 127 transitions. Word has length 34 [2018-10-14 22:28:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:21,987 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 127 transitions. [2018-10-14 22:28:21,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 127 transitions. [2018-10-14 22:28:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-14 22:28:21,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:21,993 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:28:21,993 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:21,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:21,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1025575347, now seen corresponding path program 1 times [2018-10-14 22:28:21,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:22,100 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:28:22,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:22,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:22,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:22,102 INFO L87 Difference]: Start difference. First operand 71 states and 127 transitions. Second operand 4 states. [2018-10-14 22:28:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:22,211 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:22,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-10-14 22:28:22,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:22,212 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:22,212 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:22,213 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:28:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:22,216 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 35 [2018-10-14 22:28:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:22,216 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:22,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-14 22:28:22,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:22,218 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:28:22,218 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:22,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:22,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1094456111, now seen corresponding path program 1 times [2018-10-14 22:28:22,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:22,283 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:28:22,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:22,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:22,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:22,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:22,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:22,284 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:22,297 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:22,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:22,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-14 22:28:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:22,299 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:22,299 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:22,300 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:28:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2018-10-14 22:28:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-14 22:28:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 129 transitions. [2018-10-14 22:28:22,304 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 129 transitions. Word has length 35 [2018-10-14 22:28:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:22,304 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 129 transitions. [2018-10-14 22:28:22,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2018-10-14 22:28:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-14 22:28:22,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:22,306 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] [2018-10-14 22:28:22,306 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:22,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1756694191, now seen corresponding path program 1 times [2018-10-14 22:28:22,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:22,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:28:22,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:22,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:22,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:22,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:22,428 INFO L87 Difference]: Start difference. First operand 73 states and 129 transitions. Second operand 4 states. [2018-10-14 22:28:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:22,554 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:22,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:22,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-10-14 22:28:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:22,557 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:22,557 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:22,557 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:28:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:22,561 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 36 [2018-10-14 22:28:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:22,561 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:22,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-14 22:28:22,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:22,564 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] [2018-10-14 22:28:22,564 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:22,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:22,564 INFO L82 PathProgramCache]: Analyzing trace with hash -431598568, now seen corresponding path program 1 times [2018-10-14 22:28:22,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:22,669 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:28:22,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:22,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:22,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:22,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:22,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:22,673 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:22,723 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:22,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-14 22:28:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:22,724 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:22,724 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:22,725 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:28:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2018-10-14 22:28:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-14 22:28:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 131 transitions. [2018-10-14 22:28:22,729 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 131 transitions. Word has length 36 [2018-10-14 22:28:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:22,729 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 131 transitions. [2018-10-14 22:28:22,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 131 transitions. [2018-10-14 22:28:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-14 22:28:22,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:22,731 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:28:22,731 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:22,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -489550889, now seen corresponding path program 1 times [2018-10-14 22:28:22,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:22,890 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:28:22,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:22,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:22,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:22,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:22,892 INFO L87 Difference]: Start difference. First operand 75 states and 131 transitions. Second operand 4 states. [2018-10-14 22:28:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:22,975 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:22,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-14 22:28:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:22,976 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:22,977 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:22,977 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:28:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:22,981 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 37 [2018-10-14 22:28:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:22,981 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:22,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-14 22:28:22,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:22,982 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:28:22,982 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:22,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:22,983 INFO L82 PathProgramCache]: Analyzing trace with hash -494653359, now seen corresponding path program 1 times [2018-10-14 22:28:22,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:23,020 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:28:23,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:23,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:23,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:23,021 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:23,031 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:23,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:23,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-14 22:28:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:23,033 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:23,033 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:23,034 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:28:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2018-10-14 22:28:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-14 22:28:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 133 transitions. [2018-10-14 22:28:23,037 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 133 transitions. Word has length 37 [2018-10-14 22:28:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:23,037 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 133 transitions. [2018-10-14 22:28:23,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2018-10-14 22:28:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-14 22:28:23,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:23,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] [2018-10-14 22:28:23,039 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:23,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:23,039 INFO L82 PathProgramCache]: Analyzing trace with hash -548364977, now seen corresponding path program 1 times [2018-10-14 22:28:23,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:23,099 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:28:23,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:23,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:23,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:23,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:23,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:23,100 INFO L87 Difference]: Start difference. First operand 77 states and 133 transitions. Second operand 4 states. [2018-10-14 22:28:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:23,136 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:23,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:23,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-10-14 22:28:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:23,137 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:23,137 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:23,138 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:28:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:23,141 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 38 [2018-10-14 22:28:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:23,141 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:23,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-14 22:28:23,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:23,142 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] [2018-10-14 22:28:23,143 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:23,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:23,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1845615418, now seen corresponding path program 1 times [2018-10-14 22:28:23,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:23,227 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:28:23,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:23,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:23,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:23,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:23,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:23,229 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:23,309 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:23,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:23,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-14 22:28:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:23,310 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:23,310 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:23,311 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:28:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:23,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2018-10-14 22:28:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-14 22:28:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-10-14 22:28:23,314 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 38 [2018-10-14 22:28:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:23,314 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2018-10-14 22:28:23,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2018-10-14 22:28:23,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-14 22:28:23,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:23,315 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] [2018-10-14 22:28:23,316 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:23,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:23,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1626899205, now seen corresponding path program 1 times [2018-10-14 22:28:23,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:23,470 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:28:23,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:23,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:23,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:23,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:23,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:23,472 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand 4 states. [2018-10-14 22:28:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:23,626 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:23,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:23,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-10-14 22:28:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:23,628 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:23,628 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:23,628 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:28:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:23,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:23,636 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 39 [2018-10-14 22:28:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:23,636 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:23,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-14 22:28:23,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:23,637 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] [2018-10-14 22:28:23,638 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:23,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:23,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1379503475, now seen corresponding path program 1 times [2018-10-14 22:28:23,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:23,726 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:28:23,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:23,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:23,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:23,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:23,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:23,728 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:23,810 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:23,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:23,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-14 22:28:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:23,812 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:23,812 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:23,813 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:28:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2018-10-14 22:28:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-14 22:28:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 137 transitions. [2018-10-14 22:28:23,817 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 137 transitions. Word has length 39 [2018-10-14 22:28:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:23,817 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 137 transitions. [2018-10-14 22:28:23,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 137 transitions. [2018-10-14 22:28:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-14 22:28:23,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:23,818 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] [2018-10-14 22:28:23,820 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:23,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:23,820 INFO L82 PathProgramCache]: Analyzing trace with hash 909219055, now seen corresponding path program 1 times [2018-10-14 22:28:23,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:23,923 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:28:23,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:23,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:23,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:23,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:23,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:23,924 INFO L87 Difference]: Start difference. First operand 81 states and 137 transitions. Second operand 4 states. [2018-10-14 22:28:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:23,971 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:23,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:23,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-10-14 22:28:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:23,974 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:23,974 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:23,974 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:28:23,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:23,977 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 40 [2018-10-14 22:28:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:23,977 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:23,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-14 22:28:23,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:23,978 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] [2018-10-14 22:28:23,978 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:23,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:23,979 INFO L82 PathProgramCache]: Analyzing trace with hash -185064868, now seen corresponding path program 1 times [2018-10-14 22:28:23,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:24,035 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:28:24,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:24,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:24,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:24,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:24,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:24,037 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:24,073 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:24,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:24,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-14 22:28:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:24,075 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:24,075 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:24,076 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:28:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-10-14 22:28:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-14 22:28:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 139 transitions. [2018-10-14 22:28:24,079 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 139 transitions. Word has length 40 [2018-10-14 22:28:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:24,080 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 139 transitions. [2018-10-14 22:28:24,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-10-14 22:28:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-14 22:28:24,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:24,081 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] [2018-10-14 22:28:24,081 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:24,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash 619035935, now seen corresponding path program 1 times [2018-10-14 22:28:24,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:24,174 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:28:24,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:24,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:24,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:24,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:24,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:24,175 INFO L87 Difference]: Start difference. First operand 83 states and 139 transitions. Second operand 4 states. [2018-10-14 22:28:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:24,193 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:24,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:24,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-10-14 22:28:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:24,196 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:24,196 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:24,196 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:28:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:24,199 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 41 [2018-10-14 22:28:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:24,199 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:24,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-14 22:28:24,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:24,200 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] [2018-10-14 22:28:24,201 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:24,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:24,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1442043243, now seen corresponding path program 1 times [2018-10-14 22:28:24,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:24,267 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:28:24,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:24,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:24,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:24,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:24,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:24,268 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:24,295 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:24,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:24,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-14 22:28:24,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:24,299 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:24,299 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:24,299 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:28:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2018-10-14 22:28:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-14 22:28:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 141 transitions. [2018-10-14 22:28:24,301 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 141 transitions. Word has length 41 [2018-10-14 22:28:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:24,301 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 141 transitions. [2018-10-14 22:28:24,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 141 transitions. [2018-10-14 22:28:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-14 22:28:24,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:24,302 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:28:24,302 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:24,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2139327887, now seen corresponding path program 1 times [2018-10-14 22:28:24,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:24,468 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:28:24,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:24,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:24,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:24,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:24,469 INFO L87 Difference]: Start difference. First operand 85 states and 141 transitions. Second operand 4 states. [2018-10-14 22:28:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:24,609 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:24,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:24,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-10-14 22:28:24,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:24,611 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:24,611 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:24,611 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:28:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:24,613 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 42 [2018-10-14 22:28:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:24,614 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:24,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-14 22:28:24,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:24,615 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:28:24,615 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:24,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:24,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1753667202, now seen corresponding path program 1 times [2018-10-14 22:28:24,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:24,692 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:28:24,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:24,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:24,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:24,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:24,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:24,694 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:24,767 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:24,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:24,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-14 22:28:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:24,769 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:24,769 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 22:28:24,769 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:28:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 22:28:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-10-14 22:28:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-14 22:28:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 143 transitions. [2018-10-14 22:28:24,772 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 143 transitions. Word has length 42 [2018-10-14 22:28:24,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:24,772 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 143 transitions. [2018-10-14 22:28:24,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 143 transitions. [2018-10-14 22:28:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-14 22:28:24,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:24,773 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:28:24,774 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:24,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:24,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1601252419, now seen corresponding path program 1 times [2018-10-14 22:28:24,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:24,818 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:28:24,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:24,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:24,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:24,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:24,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:24,819 INFO L87 Difference]: Start difference. First operand 87 states and 143 transitions. Second operand 4 states. [2018-10-14 22:28:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:24,857 INFO L93 Difference]: Finished difference Result 91 states and 145 transitions. [2018-10-14 22:28:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:24,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-10-14 22:28:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:24,860 INFO L225 Difference]: With dead ends: 91 [2018-10-14 22:28:24,861 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 22:28:24,861 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:28:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 22:28:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2018-10-14 22:28:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 22:28:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2018-10-14 22:28:24,864 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 43 [2018-10-14 22:28:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:24,864 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-10-14 22:28:24,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2018-10-14 22:28:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-14 22:28:24,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:24,865 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:28:24,865 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:24,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1470891959, now seen corresponding path program 1 times [2018-10-14 22:28:24,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:24,930 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:28:24,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:28:24,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:28:24,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:28:24,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:28:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:28:24,932 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand 3 states. [2018-10-14 22:28:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:24,982 INFO L93 Difference]: Finished difference Result 90 states and 144 transitions. [2018-10-14 22:28:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:28:24,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-14 22:28:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:24,983 INFO L225 Difference]: With dead ends: 90 [2018-10-14 22:28:24,983 INFO L226 Difference]: Without dead ends: 77 [2018-10-14 22:28:24,984 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:28:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-14 22:28:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-10-14 22:28:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:28:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 130 transitions. [2018-10-14 22:28:24,986 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 130 transitions. Word has length 43 [2018-10-14 22:28:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:24,986 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 130 transitions. [2018-10-14 22:28:24,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:28:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2018-10-14 22:28:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-14 22:28:24,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:24,987 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:28:24,987 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:24,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1888626479, now seen corresponding path program 1 times [2018-10-14 22:28:24,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:25,087 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:28:25,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:25,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:25,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:25,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:25,089 INFO L87 Difference]: Start difference. First operand 76 states and 130 transitions. Second operand 4 states. [2018-10-14 22:28:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:25,108 INFO L93 Difference]: Finished difference Result 77 states and 129 transitions. [2018-10-14 22:28:25,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:25,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-10-14 22:28:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:25,111 INFO L225 Difference]: With dead ends: 77 [2018-10-14 22:28:25,111 INFO L226 Difference]: Without dead ends: 65 [2018-10-14 22:28:25,112 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:28:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-14 22:28:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2018-10-14 22:28:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-14 22:28:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-10-14 22:28:25,114 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 44 [2018-10-14 22:28:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:25,114 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-10-14 22:28:25,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2018-10-14 22:28:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-14 22:28:25,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:28:25,115 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:28:25,116 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr11ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:28:25,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:28:25,116 INFO L82 PathProgramCache]: Analyzing trace with hash -74569113, now seen corresponding path program 1 times [2018-10-14 22:28:25,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:28:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:28:25,258 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:28:25,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:28:25,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:28:25,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:28:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:28:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:28:25,260 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 4 states. [2018-10-14 22:28:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:28:25,360 INFO L93 Difference]: Finished difference Result 46 states and 72 transitions. [2018-10-14 22:28:25,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:28:25,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-10-14 22:28:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:28:25,361 INFO L225 Difference]: With dead ends: 46 [2018-10-14 22:28:25,362 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 22:28:25,362 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:28:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 22:28:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 22:28:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 22:28:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 22:28:25,363 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-10-14 22:28:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:28:25,363 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 22:28:25,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:28:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 22:28:25,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 22:28:25,367 INFO L202 PluginConnector]: Adding new model speedup-poc03-14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:28:25 BasicIcfg [2018-10-14 22:28:25,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 22:28:25,368 INFO L168 Benchmark]: Toolchain (without parser) took 144117.98 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.3 GB in the end (delta: -829.2 MB). Peak memory consumption was 254.0 MB. Max. memory is 17.8 GB. [2018-10-14 22:28:25,369 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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:28:25,370 INFO L168 Benchmark]: Boogie Preprocessor took 76.72 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:28:25,370 INFO L168 Benchmark]: RCFGBuilder took 612.24 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:28:25,371 INFO L168 Benchmark]: IcfgTransformer took 138160.27 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 420.0 MB). Free memory was 1.4 GB in the beginning and 928.1 MB in the end (delta: 518.9 MB). Peak memory consumption was 938.9 MB. Max. memory is 17.8 GB. [2018-10-14 22:28:25,372 INFO L168 Benchmark]: TraceAbstraction took 5264.66 ms. Allocated memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: 663.2 MB). Free memory was 928.1 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:28:25,375 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.22 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 76.72 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 612.24 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 138160.27 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 420.0 MB). Free memory was 1.4 GB in the beginning and 928.1 MB in the end (delta: 518.9 MB). Peak memory consumption was 938.9 MB. Max. memory is 17.8 GB. * TraceAbstraction took 5264.66 ms. Allocated memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: 663.2 MB). Free memory was 928.1 MB in the beginning and 2.3 GB in the end (delta: -1.4 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 : 62 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1030 LocStat_NO_SUPPORTING_DISEQUALITIES : 19114 LocStat_NO_DISJUNCTIONS : -124 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 78 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 103 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 78 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 133937.80 APPLY_RETURN(MILLISECONDS) : 213.02 #APPLY_NORMAL : 691 #APPLY_RETURN : 16 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 76 different actions 707 times. Merged at 46 different actions 436 times. Never widened. Found 209 fixpoints after 15 different actions. Largest state had 49 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 14 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: 91]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 82]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 87]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 93]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 85]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 89]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 83]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 90]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 92]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 88]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 81]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 86]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 80]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 84]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 14 error locations. SAFE Result, 5.2s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2198 SDtfs, 1213 SDslu, 2323 SDs, 0 SdLazy, 233 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=24, 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, 28 MinimizatonAttempts, 585 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1022 ConstructedInterpolants, 0 QuantifiedInterpolants, 103698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 0/14 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-14.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-14_22-28-25-389.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-14.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-14_22-28-25-389.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-14.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-14_22-28-25-389.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...