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-06.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 22:23:35,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 22:23:35,801 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 22:23:35,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 22:23:35,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 22:23:35,819 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 22:23:35,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 22:23:35,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 22:23:35,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 22:23:35,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 22:23:35,829 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 22:23:35,829 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 22:23:35,832 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 22:23:35,833 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 22:23:35,834 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 22:23:35,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 22:23:35,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 22:23:35,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 22:23:35,849 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 22:23:35,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 22:23:35,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 22:23:35,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 22:23:35,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 22:23:35,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 22:23:35,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 22:23:35,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 22:23:35,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 22:23:35,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 22:23:35,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 22:23:35,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 22:23:35,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 22:23:35,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 22:23:35,866 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 22:23:35,866 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 22:23:35,868 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 22:23:35,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 22:23:35,870 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:35,887 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 22:23:35,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 22:23:35,889 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 22:23:35,889 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 22:23:35,890 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 22:23:35,890 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 22:23:35,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 22:23:35,890 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 22:23:35,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 22:23:35,891 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 22:23:35,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 22:23:35,891 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 22:23:35,891 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 22:23:35,892 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 22:23:35,893 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 22:23:35,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 22:23:35,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 22:23:35,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 22:23:35,971 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 22:23:35,972 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 22:23:35,972 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-06.bpl [2018-10-14 22:23:35,973 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-06.bpl' [2018-10-14 22:23:36,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 22:23:36,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 22:23:36,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 22:23:36,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 22:23:36,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 22:23:36,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:36" (1/1) ... [2018-10-14 22:23:36,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:36" (1/1) ... [2018-10-14 22:23:36,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:36" (1/1) ... [2018-10-14 22:23:36,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:36" (1/1) ... [2018-10-14 22:23:36,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:36" (1/1) ... [2018-10-14 22:23:36,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:36" (1/1) ... [2018-10-14 22:23:36,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:36" (1/1) ... [2018-10-14 22:23:36,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 22:23:36,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 22:23:36,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 22:23:36,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 22:23:36,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:36" (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:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 22:23:36,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 22:23:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-14 22:23:36,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-14 22:23:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-14 22:23:36,620 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 22:23:36,623 INFO L202 PluginConnector]: Adding new model speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:23:36 BoogieIcfgContainer [2018-10-14 22:23:36,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 22:23:36,623 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 22:23:36,623 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 22:23:36,624 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 22:23:36,627 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:23:36" (1/1) ... [2018-10-14 22:23:36,634 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 22:23:36,634 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 22:23:36,670 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 22:23:36,716 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 22:23:36,749 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 22:23:36,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 22:23:43,599 INFO L315 AbstractInterpreter]: Visited 36 different actions 163 times. Merged at 22 different actions 92 times. Never widened. Found 41 fixpoints after 7 different actions. Largest state had 25 variables. [2018-10-14 22:23:43,603 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 22:23:43,610 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 22:23:43,683 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 22:23:43,684 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-10-14 22:23:43,684 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 22:23:43,685 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 12 [2018-10-14 22:23:43,685 INFO L248 HeapPartitionManager]: # location blocks :6 [2018-10-14 22:23:43,686 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 22:23:43,717 INFO L202 PluginConnector]: Adding new model speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 10:23:43 BasicIcfg [2018-10-14 22:23:43,717 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 22:23:43,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 22:23:43,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 22:23:43,722 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 22:23:43,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:23:36" (1/3) ... [2018-10-14 22:23:43,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e25175e and model type speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:23:43, skipping insertion in model container [2018-10-14 22:23:43,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:23:36" (2/3) ... [2018-10-14 22:23:43,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e25175e and model type speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:23:43, skipping insertion in model container [2018-10-14 22:23:43,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 10:23:43" (3/3) ... [2018-10-14 22:23:43,725 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 22:23:43,735 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 22:23:43,743 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-10-14 22:23:43,760 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-10-14 22:23:43,785 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 22:23:43,786 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 22:23:43,786 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 22:23:43,787 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 22:23:43,787 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 22:23:43,787 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 22:23:43,787 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 22:23:43,787 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 22:23:43,788 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 22:23:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-10-14 22:23:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-14 22:23:43,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:43,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:23:43,810 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:43,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash -491297622, now seen corresponding path program 1 times [2018-10-14 22:23:43,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:44,054 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:23:44,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:23:44,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:23:44,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:23:44,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:23:44,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:23:44,078 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-10-14 22:23:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:44,193 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2018-10-14 22:23:44,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:23:44,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-14 22:23:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:44,271 INFO L225 Difference]: With dead ends: 44 [2018-10-14 22:23:44,271 INFO L226 Difference]: Without dead ends: 38 [2018-10-14 22:23:44,273 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:23:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-14 22:23:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-10-14 22:23:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-14 22:23:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-10-14 22:23:44,311 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 14 [2018-10-14 22:23:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:44,311 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-10-14 22:23:44,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:23:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-10-14 22:23:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-14 22:23:44,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:44,312 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:23:44,313 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:44,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:44,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1949643083, now seen corresponding path program 1 times [2018-10-14 22:23:44,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:44,441 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:23:44,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:23:44,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:23:44,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:23:44,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:23:44,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:23:44,446 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2018-10-14 22:23:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:44,545 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2018-10-14 22:23:44,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:23:44,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-14 22:23:44,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:44,547 INFO L225 Difference]: With dead ends: 42 [2018-10-14 22:23:44,549 INFO L226 Difference]: Without dead ends: 42 [2018-10-14 22:23:44,550 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:23:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-14 22:23:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-10-14 22:23:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-14 22:23:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 57 transitions. [2018-10-14 22:23:44,558 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 57 transitions. Word has length 15 [2018-10-14 22:23:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:44,560 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 57 transitions. [2018-10-14 22:23:44,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:23:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 57 transitions. [2018-10-14 22:23:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-14 22:23:44,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:44,561 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:23:44,561 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:44,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash 309391463, now seen corresponding path program 1 times [2018-10-14 22:23:44,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:44,762 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:23:44,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:23:44,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:23:44,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:23:44,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:23:44,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:23:44,767 INFO L87 Difference]: Start difference. First operand 33 states and 57 transitions. Second operand 4 states. [2018-10-14 22:23:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:44,934 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2018-10-14 22:23:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:23:44,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-14 22:23:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:44,938 INFO L225 Difference]: With dead ends: 43 [2018-10-14 22:23:44,938 INFO L226 Difference]: Without dead ends: 43 [2018-10-14 22:23:44,938 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:23:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-14 22:23:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-14 22:23:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-14 22:23:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-10-14 22:23:44,943 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2018-10-14 22:23:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:44,944 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-10-14 22:23:44,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:23:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-10-14 22:23:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-14 22:23:44,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:44,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:23:44,946 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:44,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:44,946 INFO L82 PathProgramCache]: Analyzing trace with hash 309393612, now seen corresponding path program 1 times [2018-10-14 22:23:44,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:45,039 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:23:45,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:23:45,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:23:45,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:23:45,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:23:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:23:45,041 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2018-10-14 22:23:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:45,118 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2018-10-14 22:23:45,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:23:45,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-14 22:23:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:45,120 INFO L225 Difference]: With dead ends: 42 [2018-10-14 22:23:45,120 INFO L226 Difference]: Without dead ends: 42 [2018-10-14 22:23:45,121 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:23:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-14 22:23:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-10-14 22:23:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-14 22:23:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 59 transitions. [2018-10-14 22:23:45,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 59 transitions. Word has length 16 [2018-10-14 22:23:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:45,127 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 59 transitions. [2018-10-14 22:23:45,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:23:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 59 transitions. [2018-10-14 22:23:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-14 22:23:45,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:45,128 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:23:45,128 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:45,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1001201903, now seen corresponding path program 1 times [2018-10-14 22:23:45,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:45,285 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:23:45,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:23:45,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:23:45,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:23:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:23:45,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:23:45,286 INFO L87 Difference]: Start difference. First operand 35 states and 59 transitions. Second operand 4 states. [2018-10-14 22:23:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:45,434 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2018-10-14 22:23:45,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:23:45,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-14 22:23:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:45,436 INFO L225 Difference]: With dead ends: 43 [2018-10-14 22:23:45,436 INFO L226 Difference]: Without dead ends: 43 [2018-10-14 22:23:45,436 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:23:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-14 22:23:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-14 22:23:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-14 22:23:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-10-14 22:23:45,440 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 17 [2018-10-14 22:23:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:45,441 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-10-14 22:23:45,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:23:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-10-14 22:23:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-14 22:23:45,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:45,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:23:45,442 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:45,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1001267565, now seen corresponding path program 1 times [2018-10-14 22:23:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:45,510 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:23:45,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:23:45,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:23:45,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:23:45,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:23:45,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:23:45,511 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2018-10-14 22:23:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:45,581 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2018-10-14 22:23:45,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:23:45,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-14 22:23:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:45,582 INFO L225 Difference]: With dead ends: 42 [2018-10-14 22:23:45,583 INFO L226 Difference]: Without dead ends: 42 [2018-10-14 22:23:45,583 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:23:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-14 22:23:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-10-14 22:23:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-14 22:23:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2018-10-14 22:23:45,588 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 17 [2018-10-14 22:23:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:45,588 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2018-10-14 22:23:45,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:23:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-10-14 22:23:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-14 22:23:45,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:45,589 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:23:45,590 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:45,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash 972517895, now seen corresponding path program 1 times [2018-10-14 22:23:45,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:45,678 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:23:45,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:23:45,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:23:45,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:23:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:23:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:23:45,680 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 4 states. [2018-10-14 22:23:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:45,745 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2018-10-14 22:23:45,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:23:45,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-14 22:23:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:45,748 INFO L225 Difference]: With dead ends: 43 [2018-10-14 22:23:45,748 INFO L226 Difference]: Without dead ends: 43 [2018-10-14 22:23:45,748 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:23:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-14 22:23:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-14 22:23:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-14 22:23:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-10-14 22:23:45,754 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2018-10-14 22:23:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:45,755 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-10-14 22:23:45,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:23:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-10-14 22:23:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-14 22:23:45,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:45,759 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:23:45,759 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:45,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:45,759 INFO L82 PathProgramCache]: Analyzing trace with hash 974523630, now seen corresponding path program 1 times [2018-10-14 22:23:45,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:45,786 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:23:45,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:23:45,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:23:45,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:23:45,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:23:45,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:23:45,788 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2018-10-14 22:23:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:45,810 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2018-10-14 22:23:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:23:45,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-14 22:23:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:45,813 INFO L225 Difference]: With dead ends: 42 [2018-10-14 22:23:45,813 INFO L226 Difference]: Without dead ends: 42 [2018-10-14 22:23:45,814 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:23:45,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-14 22:23:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-10-14 22:23:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-14 22:23:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2018-10-14 22:23:45,820 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 18 [2018-10-14 22:23:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:45,821 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2018-10-14 22:23:45,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:23:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2018-10-14 22:23:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-14 22:23:45,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:45,822 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:23:45,822 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:45,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:45,823 INFO L82 PathProgramCache]: Analyzing trace with hash 84207379, now seen corresponding path program 1 times [2018-10-14 22:23:45,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:45,913 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:23:45,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:23:45,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:23:45,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:23:45,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:23:45,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:23:45,916 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 4 states. [2018-10-14 22:23:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:46,051 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2018-10-14 22:23:46,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:23:46,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-10-14 22:23:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:46,053 INFO L225 Difference]: With dead ends: 43 [2018-10-14 22:23:46,053 INFO L226 Difference]: Without dead ends: 43 [2018-10-14 22:23:46,053 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:23:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-14 22:23:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-14 22:23:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-14 22:23:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-10-14 22:23:46,056 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 19 [2018-10-14 22:23:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:46,057 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-10-14 22:23:46,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:23:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-10-14 22:23:46,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-14 22:23:46,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:46,058 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:23:46,058 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:46,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash 145461647, now seen corresponding path program 1 times [2018-10-14 22:23:46,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:46,120 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:23:46,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:23:46,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:23:46,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:23:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:23:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:23:46,121 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2018-10-14 22:23:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:46,139 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2018-10-14 22:23:46,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:23:46,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-14 22:23:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:46,140 INFO L225 Difference]: With dead ends: 42 [2018-10-14 22:23:46,140 INFO L226 Difference]: Without dead ends: 37 [2018-10-14 22:23:46,141 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:23:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-14 22:23:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-14 22:23:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-14 22:23:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2018-10-14 22:23:46,145 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 19 [2018-10-14 22:23:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:46,146 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2018-10-14 22:23:46,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:23:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2018-10-14 22:23:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-14 22:23:46,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:46,147 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:23:46,147 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:46,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1655909209, now seen corresponding path program 1 times [2018-10-14 22:23:46,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:46,207 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:23:46,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:23:46,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:23:46,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:23:46,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:23:46,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:23:46,209 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 4 states. [2018-10-14 22:23:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:46,229 INFO L93 Difference]: Finished difference Result 37 states and 57 transitions. [2018-10-14 22:23:46,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:23:46,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-14 22:23:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:46,230 INFO L225 Difference]: With dead ends: 37 [2018-10-14 22:23:46,230 INFO L226 Difference]: Without dead ends: 33 [2018-10-14 22:23:46,231 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:23:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-14 22:23:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2018-10-14 22:23:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-14 22:23:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2018-10-14 22:23:46,234 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 20 [2018-10-14 22:23:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:46,234 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-10-14 22:23:46,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:23:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2018-10-14 22:23:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-14 22:23:46,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:23:46,236 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:23:46,236 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:23:46,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:23:46,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1093925943, now seen corresponding path program 1 times [2018-10-14 22:23:46,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:23:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:23:46,274 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:23:46,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:23:46,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:23:46,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:23:46,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:23:46,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:23:46,276 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand 4 states. [2018-10-14 22:23:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:23:46,307 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2018-10-14 22:23:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:23:46,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-10-14 22:23:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:23:46,308 INFO L225 Difference]: With dead ends: 22 [2018-10-14 22:23:46,308 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 22:23:46,309 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:23:46,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 22:23:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 22:23:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 22:23:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 22:23:46,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-10-14 22:23:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:23:46,311 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 22:23:46,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:23:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 22:23:46,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 22:23:46,316 INFO L202 PluginConnector]: Adding new model speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:23:46 BasicIcfg [2018-10-14 22:23:46,316 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 22:23:46,317 INFO L168 Benchmark]: Toolchain (without parser) took 10293.63 ms. Allocated memory was 1.6 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -992.5 MB). Peak memory consumption was 48.2 MB. Max. memory is 17.8 GB. [2018-10-14 22:23:46,318 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:23:46,319 INFO L168 Benchmark]: Boogie Preprocessor took 62.06 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:23:46,319 INFO L168 Benchmark]: RCFGBuilder took 535.66 ms. Allocated memory is still 1.6 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:23:46,320 INFO L168 Benchmark]: IcfgTransformer took 7094.35 ms. Allocated memory was 1.6 GB in the beginning and 1.8 GB in the end (delta: 269.0 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 408.7 MB). Peak memory consumption was 677.6 MB. Max. memory is 17.8 GB. [2018-10-14 22:23:46,321 INFO L168 Benchmark]: TraceAbstraction took 2597.59 ms. Allocated memory was 1.8 GB in the beginning and 2.6 GB in the end (delta: 771.8 MB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:23:46,325 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.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. * Boogie Preprocessor took 62.06 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. * RCFGBuilder took 535.66 ms. Allocated memory is still 1.6 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 7094.35 ms. Allocated memory was 1.6 GB in the beginning and 1.8 GB in the end (delta: 269.0 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 408.7 MB). Peak memory consumption was 677.6 MB. Max. memory is 17.8 GB. * TraceAbstraction took 2597.59 ms. Allocated memory was 1.8 GB in the beginning and 2.6 GB in the end (delta: 771.8 MB). Free memory was 1.0 GB in the beginning and 2.5 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 : 30 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 254 LocStat_NO_SUPPORTING_DISEQUALITIES : 1602 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 6197.12 APPLY_RETURN(MILLISECONDS) : 99.00 #APPLY_NORMAL : 155 #APPLY_RETURN : 8 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 36 different actions 163 times. Merged at 22 different actions 92 times. Never widened. Found 41 fixpoints after 7 different actions. Largest state had 25 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 6 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: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 53]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 6 error locations. SAFE Result, 2.5s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 394 SDtfs, 209 SDslu, 399 SDs, 0 SdLazy, 97 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=8, 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, 12 MinimizatonAttempts, 105 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 9354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 0/6 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-06.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-14_22-23-46-342.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-06.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-14_22-23-46-342.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-06.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-14_22-23-46-342.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...