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-08.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 22:23:48,773 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 22:23:48,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 22:23:48,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 22:23:48,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 22:23:48,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 22:23:48,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 22:23:48,803 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 22:23:48,805 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 22:23:48,806 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 22:23:48,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 22:23:48,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 22:23:48,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 22:23:48,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 22:23:48,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 22:23:48,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 22:23:48,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 22:23:48,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 22:23:48,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 22:23:48,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 22:23:48,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 22:23:48,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 22:23:48,841 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 22:23:48,842 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 22:23:48,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 22:23:48,845 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 22:23:48,846 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 22:23:48,847 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 22:23:48,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 22:23:48,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 22:23:48,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 22:23:48,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 22:23:48,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 22:23:48,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 22:23:48,856 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 22:23:48,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 22:23:48,857 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:23:48,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 22:23:48,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 22:23:48,873 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 22:23:48,873 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 22:23:48,873 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 22:23:48,874 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 22:23:48,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 22:23:48,875 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 22:23:48,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 22:23:48,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 22:23:48,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 22:23:48,875 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 22:23:48,876 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 22:23:48,877 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 22:23:48,877 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 22:23:48,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 22:23:48,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 22:23:48,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 22:23:48,956 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 22:23:48,956 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 22:23:48,957 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-08.bpl [2018-10-14 22:23:48,957 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-08.bpl' [2018-10-14 22:23:49,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 22:23:49,014 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 22:23:49,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 22:23:49,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 22:23:49,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 22:23:49,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:49" (1/1) ... [2018-10-14 22:23:49,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:49" (1/1) ... [2018-10-14 22:23:49,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:49" (1/1) ... [2018-10-14 22:23:49,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:49" (1/1) ... [2018-10-14 22:23:49,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:49" (1/1) ... [2018-10-14 22:23:49,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:49" (1/1) ... [2018-10-14 22:23:49,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:49" (1/1) ... [2018-10-14 22:23:49,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 22:23:49,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 22:23:49,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 22:23:49,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 22:23:49,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:49" (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:23:49,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 22:23:49,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 22:23:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-14 22:23:49,147 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-14 22:23:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-14 22:23:49,602 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 22:23:49,603 INFO L202 PluginConnector]: Adding new model speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:23:49 BoogieIcfgContainer [2018-10-14 22:23:49,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 22:23:49,604 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 22:23:49,604 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 22:23:49,605 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 22:23:49,609 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:23:49" (1/1) ... [2018-10-14 22:23:49,617 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 22:23:49,617 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 22:23:49,655 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 22:23:49,701 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 22:23:49,724 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 22:23:49,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 22:24:04,306 INFO L315 AbstractInterpreter]: Visited 46 different actions 263 times. Merged at 28 different actions 154 times. Never widened. Found 71 fixpoints after 9 different actions. Largest state had 31 variables. [2018-10-14 22:24:04,308 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 22:24:04,313 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 22:24:04,434 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 22:24:04,435 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-10-14 22:24:04,435 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 22:24:04,436 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 16 [2018-10-14 22:24:04,436 INFO L248 HeapPartitionManager]: # location blocks :8 [2018-10-14 22:24:04,437 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 22:24:04,470 INFO L202 PluginConnector]: Adding new model speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 10:24:04 BasicIcfg [2018-10-14 22:24:04,471 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 22:24:04,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 22:24:04,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 22:24:04,477 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 22:24:04,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:49" (1/3) ... [2018-10-14 22:24:04,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526b5ba4 and model type speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:24:04, skipping insertion in model container [2018-10-14 22:24:04,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:23:49" (2/3) ... [2018-10-14 22:24:04,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526b5ba4 and model type speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:24:04, skipping insertion in model container [2018-10-14 22:24:04,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 10:24:04" (3/3) ... [2018-10-14 22:24:04,485 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 22:24:04,498 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 22:24:04,507 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-10-14 22:24:04,526 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-10-14 22:24:04,551 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 22:24:04,551 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 22:24:04,552 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 22:24:04,552 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 22:24:04,552 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 22:24:04,552 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 22:24:04,552 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 22:24:04,553 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 22:24:04,553 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 22:24:04,568 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-14 22:24:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-14 22:24:04,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:04,579 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:24:04,581 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:04,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1677019180, now seen corresponding path program 1 times [2018-10-14 22:24:04,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:04,900 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:24:04,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:24:04,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:24:04,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:24:04,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:24:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:24:05,000 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-10-14 22:24:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:05,147 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-10-14 22:24:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:24:05,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-14 22:24:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:05,164 INFO L225 Difference]: With dead ends: 56 [2018-10-14 22:24:05,168 INFO L226 Difference]: Without dead ends: 50 [2018-10-14 22:24:05,170 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:24:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-14 22:24:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2018-10-14 22:24:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-14 22:24:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-14 22:24:05,213 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 18 [2018-10-14 22:24:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:05,213 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-14 22:24:05,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:24:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-14 22:24:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-14 22:24:05,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:05,215 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:24:05,216 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:05,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:05,216 INFO L82 PathProgramCache]: Analyzing trace with hash 447987251, now seen corresponding path program 1 times [2018-10-14 22:24:05,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:05,338 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:24:05,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:24:05,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:24:05,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:24:05,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:24:05,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:24:05,343 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-14 22:24:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:05,442 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-14 22:24:05,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:24:05,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-14 22:24:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:05,444 INFO L225 Difference]: With dead ends: 54 [2018-10-14 22:24:05,444 INFO L226 Difference]: Without dead ends: 54 [2018-10-14 22:24:05,445 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:24:05,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-14 22:24:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2018-10-14 22:24:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-14 22:24:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2018-10-14 22:24:05,458 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 19 [2018-10-14 22:24:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:05,459 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2018-10-14 22:24:05,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:24:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2018-10-14 22:24:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-14 22:24:05,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:05,460 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] [2018-10-14 22:24:05,462 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:05,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:05,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1002700905, now seen corresponding path program 1 times [2018-10-14 22:24:05,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:05,674 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:24:05,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:24:05,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:24:05,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:24:05,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:24:05,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:24:05,676 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 4 states. [2018-10-14 22:24:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:05,859 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-14 22:24:05,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:24:05,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-14 22:24:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:05,867 INFO L225 Difference]: With dead ends: 55 [2018-10-14 22:24:05,867 INFO L226 Difference]: Without dead ends: 55 [2018-10-14 22:24:05,867 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:24:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-14 22:24:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-14 22:24:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-14 22:24:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-14 22:24:05,874 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 20 [2018-10-14 22:24:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:05,877 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-14 22:24:05,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:24:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-14 22:24:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-14 22:24:05,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:05,878 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] [2018-10-14 22:24:05,878 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:05,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1002703118, now seen corresponding path program 1 times [2018-10-14 22:24:05,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:05,970 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:24:05,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:24:05,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:24:05,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:24:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:24:05,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:24:05,971 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-14 22:24:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:06,058 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-14 22:24:06,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:24:06,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-14 22:24:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:06,060 INFO L225 Difference]: With dead ends: 54 [2018-10-14 22:24:06,060 INFO L226 Difference]: Without dead ends: 54 [2018-10-14 22:24:06,061 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:24:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-14 22:24:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2018-10-14 22:24:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-14 22:24:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2018-10-14 22:24:06,067 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 20 [2018-10-14 22:24:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:06,068 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 75 transitions. [2018-10-14 22:24:06,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:24:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 75 transitions. [2018-10-14 22:24:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-14 22:24:06,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:06,069 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] [2018-10-14 22:24:06,069 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:06,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:06,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1018958167, now seen corresponding path program 1 times [2018-10-14 22:24:06,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:06,197 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:24:06,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:24:06,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:24:06,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:24:06,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:24:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:24:06,199 INFO L87 Difference]: Start difference. First operand 43 states and 75 transitions. Second operand 4 states. [2018-10-14 22:24:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:06,329 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-14 22:24:06,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:24:06,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-10-14 22:24:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:06,332 INFO L225 Difference]: With dead ends: 55 [2018-10-14 22:24:06,332 INFO L226 Difference]: Without dead ends: 55 [2018-10-14 22:24:06,334 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:24:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-14 22:24:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-14 22:24:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-14 22:24:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-14 22:24:06,341 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 21 [2018-10-14 22:24:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:06,344 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-14 22:24:06,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:24:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-14 22:24:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-14 22:24:06,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:06,346 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] [2018-10-14 22:24:06,346 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:06,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1019025813, now seen corresponding path program 1 times [2018-10-14 22:24:06,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:06,434 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:24:06,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:24:06,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:24:06,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:24:06,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:24:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:24:06,436 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-14 22:24:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:06,526 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-14 22:24:06,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:24:06,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-14 22:24:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:06,527 INFO L225 Difference]: With dead ends: 54 [2018-10-14 22:24:06,527 INFO L226 Difference]: Without dead ends: 54 [2018-10-14 22:24:06,528 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:24:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-14 22:24:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-10-14 22:24:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-14 22:24:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 77 transitions. [2018-10-14 22:24:06,533 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 77 transitions. Word has length 21 [2018-10-14 22:24:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:06,533 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 77 transitions. [2018-10-14 22:24:06,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:24:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2018-10-14 22:24:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-14 22:24:06,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:06,534 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] [2018-10-14 22:24:06,535 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:06,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1522962121, now seen corresponding path program 1 times [2018-10-14 22:24:06,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:06,671 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:24:06,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:24:06,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:24:06,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:24:06,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:24:06,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:24:06,673 INFO L87 Difference]: Start difference. First operand 45 states and 77 transitions. Second operand 4 states. [2018-10-14 22:24:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:06,728 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-14 22:24:06,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:24:06,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-10-14 22:24:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:06,731 INFO L225 Difference]: With dead ends: 55 [2018-10-14 22:24:06,731 INFO L226 Difference]: Without dead ends: 55 [2018-10-14 22:24:06,731 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:24:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-14 22:24:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-14 22:24:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-14 22:24:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-14 22:24:06,735 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 22 [2018-10-14 22:24:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:06,736 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-14 22:24:06,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:24:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-14 22:24:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-14 22:24:06,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:06,737 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] [2018-10-14 22:24:06,737 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:06,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:06,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029360, now seen corresponding path program 1 times [2018-10-14 22:24:06,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:06,813 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:24:06,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:24:06,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:24:06,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:24:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:24:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:24:06,814 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-14 22:24:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:06,837 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-14 22:24:06,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:24:06,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-14 22:24:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:06,840 INFO L225 Difference]: With dead ends: 54 [2018-10-14 22:24:06,840 INFO L226 Difference]: Without dead ends: 54 [2018-10-14 22:24:06,840 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:24:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-14 22:24:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-10-14 22:24:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-14 22:24:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2018-10-14 22:24:06,846 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 22 [2018-10-14 22:24:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:06,847 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 79 transitions. [2018-10-14 22:24:06,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:24:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 79 transitions. [2018-10-14 22:24:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-14 22:24:06,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:06,848 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] [2018-10-14 22:24:06,848 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:06,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash -31890757, now seen corresponding path program 1 times [2018-10-14 22:24:06,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:06,921 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:24:06,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:24:06,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:24:06,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:24:06,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:24:06,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:24:06,922 INFO L87 Difference]: Start difference. First operand 47 states and 79 transitions. Second operand 4 states. [2018-10-14 22:24:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:06,953 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-14 22:24:06,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:24:06,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-14 22:24:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:06,954 INFO L225 Difference]: With dead ends: 55 [2018-10-14 22:24:06,955 INFO L226 Difference]: Without dead ends: 55 [2018-10-14 22:24:06,955 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:24:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-14 22:24:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-14 22:24:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-14 22:24:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-14 22:24:06,958 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 23 [2018-10-14 22:24:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:06,959 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-14 22:24:06,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:24:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-14 22:24:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-14 22:24:06,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:06,960 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] [2018-10-14 22:24:06,960 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:06,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:06,961 INFO L82 PathProgramCache]: Analyzing trace with hash 31270135, now seen corresponding path program 1 times [2018-10-14 22:24:06,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:07,016 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:24:07,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:24:07,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:24:07,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:24:07,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:24:07,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:24:07,017 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-14 22:24:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:07,043 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-14 22:24:07,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:24:07,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-14 22:24:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:07,045 INFO L225 Difference]: With dead ends: 54 [2018-10-14 22:24:07,045 INFO L226 Difference]: Without dead ends: 54 [2018-10-14 22:24:07,048 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:24:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-14 22:24:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2018-10-14 22:24:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-14 22:24:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 81 transitions. [2018-10-14 22:24:07,055 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 81 transitions. Word has length 23 [2018-10-14 22:24:07,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:07,055 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 81 transitions. [2018-10-14 22:24:07,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:24:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2018-10-14 22:24:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-14 22:24:07,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:07,056 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] [2018-10-14 22:24:07,057 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:07,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash -959984087, now seen corresponding path program 1 times [2018-10-14 22:24:07,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:07,106 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:24:07,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:24:07,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:24:07,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:24:07,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:24:07,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:24:07,109 INFO L87 Difference]: Start difference. First operand 49 states and 81 transitions. Second operand 4 states. [2018-10-14 22:24:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:07,157 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-14 22:24:07,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:24:07,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-10-14 22:24:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:07,158 INFO L225 Difference]: With dead ends: 55 [2018-10-14 22:24:07,158 INFO L226 Difference]: Without dead ends: 55 [2018-10-14 22:24:07,159 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:24:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-14 22:24:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-14 22:24:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-14 22:24:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-14 22:24:07,162 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 24 [2018-10-14 22:24:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:07,163 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-14 22:24:07,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:24:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-14 22:24:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-14 22:24:07,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:07,164 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] [2018-10-14 22:24:07,165 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:07,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash 969374418, now seen corresponding path program 1 times [2018-10-14 22:24:07,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:07,202 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:24:07,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:24:07,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:24:07,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:24:07,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:24:07,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:24:07,205 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-14 22:24:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:07,216 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-14 22:24:07,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:24:07,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-14 22:24:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:07,218 INFO L225 Difference]: With dead ends: 54 [2018-10-14 22:24:07,218 INFO L226 Difference]: Without dead ends: 54 [2018-10-14 22:24:07,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:24:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-14 22:24:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-14 22:24:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-14 22:24:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2018-10-14 22:24:07,223 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 24 [2018-10-14 22:24:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:07,223 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 83 transitions. [2018-10-14 22:24:07,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:24:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2018-10-14 22:24:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-14 22:24:07,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:07,225 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] [2018-10-14 22:24:07,225 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:07,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1192768287, now seen corresponding path program 1 times [2018-10-14 22:24:07,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:07,266 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:24:07,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:24:07,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:24:07,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:24:07,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:24:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:24:07,267 INFO L87 Difference]: Start difference. First operand 51 states and 83 transitions. Second operand 4 states. [2018-10-14 22:24:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:07,298 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-14 22:24:07,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:24:07,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-10-14 22:24:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:07,300 INFO L225 Difference]: With dead ends: 55 [2018-10-14 22:24:07,300 INFO L226 Difference]: Without dead ends: 55 [2018-10-14 22:24:07,300 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:24:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-14 22:24:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-14 22:24:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-14 22:24:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-14 22:24:07,304 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 25 [2018-10-14 22:24:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:07,305 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-14 22:24:07,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:24:07,305 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-14 22:24:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-14 22:24:07,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:07,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] [2018-10-14 22:24:07,307 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:07,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:07,307 INFO L82 PathProgramCache]: Analyzing trace with hash -14163879, now seen corresponding path program 1 times [2018-10-14 22:24:07,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:07,352 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:24:07,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:24:07,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:24:07,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:24:07,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:24:07,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:24:07,354 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-14 22:24:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:07,361 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-14 22:24:07,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:24:07,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-14 22:24:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:07,363 INFO L225 Difference]: With dead ends: 54 [2018-10-14 22:24:07,363 INFO L226 Difference]: Without dead ends: 47 [2018-10-14 22:24:07,363 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:24:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-14 22:24:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-14 22:24:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-14 22:24:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2018-10-14 22:24:07,367 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 25 [2018-10-14 22:24:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:07,369 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. [2018-10-14 22:24:07,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:24:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2018-10-14 22:24:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-14 22:24:07,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:07,370 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] [2018-10-14 22:24:07,370 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:07,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:07,370 INFO L82 PathProgramCache]: Analyzing trace with hash 63921801, now seen corresponding path program 1 times [2018-10-14 22:24:07,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:07,445 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:24:07,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:24:07,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:24:07,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:24:07,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:24:07,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:24:07,446 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand 4 states. [2018-10-14 22:24:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:07,467 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2018-10-14 22:24:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:24:07,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-10-14 22:24:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:07,468 INFO L225 Difference]: With dead ends: 47 [2018-10-14 22:24:07,468 INFO L226 Difference]: Without dead ends: 41 [2018-10-14 22:24:07,469 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:24:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-14 22:24:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-10-14 22:24:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-14 22:24:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2018-10-14 22:24:07,472 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 26 [2018-10-14 22:24:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:07,472 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-10-14 22:24:07,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:24:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2018-10-14 22:24:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-14 22:24:07,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:24:07,473 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] [2018-10-14 22:24:07,473 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:24:07,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:24:07,474 INFO L82 PathProgramCache]: Analyzing trace with hash 174121603, now seen corresponding path program 1 times [2018-10-14 22:24:07,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:24:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:24:07,529 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:24:07,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:24:07,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:24:07,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:24:07,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:24:07,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:24:07,531 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 4 states. [2018-10-14 22:24:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:24:07,586 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2018-10-14 22:24:07,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:24:07,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-10-14 22:24:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:24:07,586 INFO L225 Difference]: With dead ends: 28 [2018-10-14 22:24:07,586 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 22:24:07,587 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:24:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 22:24:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 22:24:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 22:24:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 22:24:07,588 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-10-14 22:24:07,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:24:07,588 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 22:24:07,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:24:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 22:24:07,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 22:24:07,592 INFO L202 PluginConnector]: Adding new model speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:24:07 BasicIcfg [2018-10-14 22:24:07,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 22:24:07,593 INFO L168 Benchmark]: Toolchain (without parser) took 18580.14 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 90.6 MB. Max. memory is 17.8 GB. [2018-10-14 22:24:07,595 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:24:07,595 INFO L168 Benchmark]: Boogie Preprocessor took 69.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:24:07,596 INFO L168 Benchmark]: RCFGBuilder took 516.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 17.8 GB. [2018-10-14 22:24:07,597 INFO L168 Benchmark]: IcfgTransformer took 14866.71 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 539.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 252.8 MB). Peak memory consumption was 792.3 MB. Max. memory is 17.8 GB. [2018-10-14 22:24:07,598 INFO L168 Benchmark]: TraceAbstraction took 3120.89 ms. Allocated memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: 836.2 MB). Free memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:24:07,602 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 69.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. * RCFGBuilder took 516.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 17.8 GB. * IcfgTransformer took 14866.71 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 539.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 252.8 MB). Peak memory consumption was 792.3 MB. Max. memory is 17.8 GB. * TraceAbstraction took 3120.89 ms. Allocated memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: 836.2 MB). Free memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: -1.6 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 : 38 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 400 LocStat_NO_SUPPORTING_DISEQUALITIES : 3692 LocStat_NO_DISJUNCTIONS : -76 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 48 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 61 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 48 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 13391.48 APPLY_RETURN(MILLISECONDS) : 125.77 #APPLY_NORMAL : 253 #APPLY_RETURN : 10 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 46 different actions 263 times. Merged at 28 different actions 154 times. Never widened. Found 71 fixpoints after 9 different actions. Largest state had 31 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 8 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: 59]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 61]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 57]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 56]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 58]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 63]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 62]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 8 error locations. SAFE Result, 3.0s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 382 SDslu, 730 SDs, 0 SdLazy, 131 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=12, 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.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 189 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 344 ConstructedInterpolants, 0 QuantifiedInterpolants, 20904 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 0/8 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-08.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-14_22-24-07-621.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-08.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-14_22-24-07-621.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-08.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-14_22-24-07-621.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...