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-04.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d80e71f [2018-10-13 17:51:57,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-13 17:51:57,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-13 17:51:57,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-13 17:51:57,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-13 17:51:57,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-13 17:51:57,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-13 17:51:57,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-13 17:51:57,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-13 17:51:57,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-13 17:51:57,639 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-13 17:51:57,639 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-13 17:51:57,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-13 17:51:57,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-13 17:51:57,651 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-13 17:51:57,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-13 17:51:57,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-13 17:51:57,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-13 17:51:57,659 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-13 17:51:57,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-13 17:51:57,663 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-13 17:51:57,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-13 17:51:57,668 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-13 17:51:57,668 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-13 17:51:57,668 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-13 17:51:57,671 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-13 17:51:57,671 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-13 17:51:57,675 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-13 17:51:57,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-13 17:51:57,679 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-13 17:51:57,679 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-13 17:51:57,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-13 17:51:57,681 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-13 17:51:57,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-13 17:51:57,683 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-13 17:51:57,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-13 17:51:57,684 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-13 17:51:57,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-13 17:51:57,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-13 17:51:57,698 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-13 17:51:57,699 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-13 17:51:57,700 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-13 17:51:57,700 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-13 17:51:57,700 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-13 17:51:57,701 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-13 17:51:57,701 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-13 17:51:57,701 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-13 17:51:57,701 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-13 17:51:57,701 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-13 17:51:57,701 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-13 17:51:57,703 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-13 17:51:57,703 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-13 17:51:57,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-13 17:51:57,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-13 17:51:57,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-13 17:51:57,790 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-13 17:51:57,791 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-13 17:51:57,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-04.bpl [2018-10-13 17:51:57,792 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-04.bpl' [2018-10-13 17:51:57,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-13 17:51:57,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-13 17:51:57,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-13 17:51:57,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-13 17:51:57,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-13 17:51:57,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:51:57" (1/1) ... [2018-10-13 17:51:57,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:51:57" (1/1) ... [2018-10-13 17:51:57,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:51:57" (1/1) ... [2018-10-13 17:51:57,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:51:57" (1/1) ... [2018-10-13 17:51:57,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:51:57" (1/1) ... [2018-10-13 17:51:57,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:51:57" (1/1) ... [2018-10-13 17:51:57,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:51:57" (1/1) ... [2018-10-13 17:51:57,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-13 17:51:57,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-13 17:51:57,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-13 17:51:57,899 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-13 17:51:57,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:51:57" (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-13 17:51:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-13 17:51:57,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-13 17:51:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-13 17:51:57,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-13 17:51:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-13 17:51:58,337 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-13 17:51:58,338 INFO L202 PluginConnector]: Adding new model speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:58 BoogieIcfgContainer [2018-10-13 17:51:58,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-13 17:51:58,338 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-13 17:51:58,339 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-13 17:51:58,340 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-13 17:51:58,344 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:58" (1/1) ... [2018-10-13 17:51:58,353 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-13 17:51:58,353 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-13 17:51:58,389 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-13 17:51:58,444 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-13 17:51:58,460 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-13 17:51:58,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-13 17:52:13,629 INFO L315 AbstractInterpreter]: Visited 26 different actions 90 times. Merged at 16 different actions 52 times. Never widened. Found 16 fixpoints after 4 different actions. Largest state had 19 variables. [2018-10-13 17:52:13,631 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-13 17:52:13,635 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-13 17:52:14,137 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-13 17:52:14,138 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-10-13 17:52:14,138 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-13 17:52:14,139 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 8 [2018-10-13 17:52:14,139 INFO L248 HeapPartitionManager]: # location blocks :4 [2018-10-13 17:52:14,140 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-13 17:52:14,159 INFO L202 PluginConnector]: Adding new model speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 13.10 05:52:14 BasicIcfg [2018-10-13 17:52:14,160 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-13 17:52:14,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-13 17:52:14,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-13 17:52:14,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-13 17:52:14,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:51:57" (1/3) ... [2018-10-13 17:52:14,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7838cd46 and model type speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:52:14, skipping insertion in model container [2018-10-13 17:52:14,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:58" (2/3) ... [2018-10-13 17:52:14,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7838cd46 and model type speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:52:14, skipping insertion in model container [2018-10-13 17:52:14,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 13.10 05:52:14" (3/3) ... [2018-10-13 17:52:14,168 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-13 17:52:14,177 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-13 17:52:14,185 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-13 17:52:14,202 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-10-13 17:52:14,228 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-13 17:52:14,229 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-13 17:52:14,229 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-13 17:52:14,229 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-13 17:52:14,229 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-13 17:52:14,230 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-13 17:52:14,230 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-13 17:52:14,230 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-13 17:52:14,230 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-13 17:52:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-13 17:52:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-13 17:52:14,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:52:14,250 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:52:14,251 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:52:14,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:52:14,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1219435736, now seen corresponding path program 1 times [2018-10-13 17:52:14,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:52:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:52:14,488 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-13 17:52:14,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 17:52:14,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 17:52:14,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 17:52:14,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 17:52:14,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 17:52:14,505 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-10-13 17:52:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:52:14,578 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-10-13 17:52:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 17:52:14,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-13 17:52:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:52:14,590 INFO L225 Difference]: With dead ends: 32 [2018-10-13 17:52:14,591 INFO L226 Difference]: Without dead ends: 26 [2018-10-13 17:52:14,649 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-13 17:52:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-13 17:52:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-10-13 17:52:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-13 17:52:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-10-13 17:52:14,686 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 10 [2018-10-13 17:52:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:52:14,687 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-10-13 17:52:14,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 17:52:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-10-13 17:52:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-13 17:52:14,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:52:14,688 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:52:14,688 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:52:14,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:52:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 852197987, now seen corresponding path program 1 times [2018-10-13 17:52:14,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:52:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:52:14,757 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-13 17:52:14,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 17:52:14,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 17:52:14,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 17:52:14,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 17:52:14,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 17:52:14,759 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-10-13 17:52:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:52:14,783 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2018-10-13 17:52:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 17:52:14,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-13 17:52:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:52:14,784 INFO L225 Difference]: With dead ends: 30 [2018-10-13 17:52:14,784 INFO L226 Difference]: Without dead ends: 30 [2018-10-13 17:52:14,785 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-13 17:52:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-13 17:52:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-10-13 17:52:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-13 17:52:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 41 transitions. [2018-10-13 17:52:14,790 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 41 transitions. Word has length 11 [2018-10-13 17:52:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:52:14,791 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 41 transitions. [2018-10-13 17:52:14,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 17:52:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 41 transitions. [2018-10-13 17:52:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-13 17:52:14,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:52:14,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:52:14,792 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:52:14,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:52:14,793 INFO L82 PathProgramCache]: Analyzing trace with hash 648331877, now seen corresponding path program 1 times [2018-10-13 17:52:14,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:52:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:52:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-13 17:52:14,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 17:52:14,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 17:52:14,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 17:52:14,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 17:52:14,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 17:52:14,899 INFO L87 Difference]: Start difference. First operand 25 states and 41 transitions. Second operand 4 states. [2018-10-13 17:52:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:52:14,935 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2018-10-13 17:52:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 17:52:14,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-13 17:52:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:52:14,937 INFO L225 Difference]: With dead ends: 31 [2018-10-13 17:52:14,937 INFO L226 Difference]: Without dead ends: 31 [2018-10-13 17:52:14,937 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-13 17:52:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-13 17:52:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-10-13 17:52:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-13 17:52:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-10-13 17:52:14,941 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 12 [2018-10-13 17:52:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:52:14,943 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-10-13 17:52:14,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 17:52:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-10-13 17:52:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-13 17:52:14,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:52:14,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:52:14,944 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:52:14,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:52:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash 648333962, now seen corresponding path program 1 times [2018-10-13 17:52:14,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:52:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:52:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-13 17:52:15,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 17:52:15,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 17:52:15,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 17:52:15,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 17:52:15,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 17:52:15,013 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-10-13 17:52:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:52:15,057 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2018-10-13 17:52:15,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 17:52:15,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-13 17:52:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:52:15,059 INFO L225 Difference]: With dead ends: 30 [2018-10-13 17:52:15,059 INFO L226 Difference]: Without dead ends: 30 [2018-10-13 17:52:15,059 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-13 17:52:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-13 17:52:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-10-13 17:52:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-13 17:52:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 43 transitions. [2018-10-13 17:52:15,063 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 43 transitions. Word has length 12 [2018-10-13 17:52:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:52:15,064 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 43 transitions. [2018-10-13 17:52:15,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 17:52:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. [2018-10-13 17:52:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-13 17:52:15,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:52:15,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:52:15,065 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:52:15,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:52:15,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1376547193, now seen corresponding path program 1 times [2018-10-13 17:52:15,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:52:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:52:15,160 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-13 17:52:15,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 17:52:15,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 17:52:15,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 17:52:15,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 17:52:15,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 17:52:15,162 INFO L87 Difference]: Start difference. First operand 27 states and 43 transitions. Second operand 4 states. [2018-10-13 17:52:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:52:15,260 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2018-10-13 17:52:15,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 17:52:15,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-13 17:52:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:52:15,261 INFO L225 Difference]: With dead ends: 31 [2018-10-13 17:52:15,261 INFO L226 Difference]: Without dead ends: 31 [2018-10-13 17:52:15,262 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-13 17:52:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-13 17:52:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-10-13 17:52:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-13 17:52:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-10-13 17:52:15,265 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-10-13 17:52:15,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:52:15,265 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-10-13 17:52:15,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 17:52:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-10-13 17:52:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-13 17:52:15,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:52:15,267 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:52:15,267 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:52:15,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:52:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1376483515, now seen corresponding path program 1 times [2018-10-13 17:52:15,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:52:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:52:15,318 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-13 17:52:15,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 17:52:15,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 17:52:15,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 17:52:15,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 17:52:15,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 17:52:15,319 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-10-13 17:52:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:52:15,330 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2018-10-13 17:52:15,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 17:52:15,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-13 17:52:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:52:15,331 INFO L225 Difference]: With dead ends: 30 [2018-10-13 17:52:15,331 INFO L226 Difference]: Without dead ends: 27 [2018-10-13 17:52:15,332 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-13 17:52:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-13 17:52:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-10-13 17:52:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-13 17:52:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2018-10-13 17:52:15,336 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 13 [2018-10-13 17:52:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:52:15,336 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. [2018-10-13 17:52:15,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 17:52:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2018-10-13 17:52:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-13 17:52:15,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:52:15,337 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:52:15,337 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:52:15,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:52:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash 276739909, now seen corresponding path program 1 times [2018-10-13 17:52:15,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:52:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:52:15,382 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-13 17:52:15,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 17:52:15,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 17:52:15,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 17:52:15,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 17:52:15,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 17:52:15,383 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand 4 states. [2018-10-13 17:52:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:52:15,516 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-10-13 17:52:15,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 17:52:15,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-13 17:52:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:52:15,518 INFO L225 Difference]: With dead ends: 27 [2018-10-13 17:52:15,518 INFO L226 Difference]: Without dead ends: 25 [2018-10-13 17:52:15,518 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-13 17:52:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-13 17:52:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-10-13 17:52:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-13 17:52:15,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-10-13 17:52:15,521 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 14 [2018-10-13 17:52:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:52:15,521 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-10-13 17:52:15,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 17:52:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2018-10-13 17:52:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-13 17:52:15,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:52:15,522 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:52:15,523 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:52:15,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:52:15,523 INFO L82 PathProgramCache]: Analyzing trace with hash -10073749, now seen corresponding path program 1 times [2018-10-13 17:52:15,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:52:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:52:15,581 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-13 17:52:15,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 17:52:15,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 17:52:15,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 17:52:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 17:52:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 17:52:15,583 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 4 states. [2018-10-13 17:52:15,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:52:15,598 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-10-13 17:52:15,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 17:52:15,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-13 17:52:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:52:15,600 INFO L225 Difference]: With dead ends: 16 [2018-10-13 17:52:15,600 INFO L226 Difference]: Without dead ends: 0 [2018-10-13 17:52:15,600 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-13 17:52:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-13 17:52:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-13 17:52:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-13 17:52:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-13 17:52:15,602 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-10-13 17:52:15,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:52:15,602 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-13 17:52:15,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 17:52:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-13 17:52:15,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-13 17:52:15,607 INFO L202 PluginConnector]: Adding new model speedup-poc03-04.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:52:15 BasicIcfg [2018-10-13 17:52:15,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-13 17:52:15,608 INFO L168 Benchmark]: Toolchain (without parser) took 17770.96 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 32.9 MB. Max. memory is 17.8 GB. [2018-10-13 17:52:15,609 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 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-13 17:52:15,610 INFO L168 Benchmark]: Boogie Preprocessor took 59.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-13 17:52:15,610 INFO L168 Benchmark]: RCFGBuilder took 439.12 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-13 17:52:15,611 INFO L168 Benchmark]: IcfgTransformer took 15821.39 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 900.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -747.7 MB). Peak memory consumption was 152.5 MB. Max. memory is 17.8 GB. [2018-10-13 17:52:15,612 INFO L168 Benchmark]: TraceAbstraction took 1446.54 ms. Allocated memory was 2.4 GB in the beginning and 3.2 GB in the end (delta: 767.6 MB). Free memory was 2.2 GB in the beginning and 3.1 GB in the end (delta: -908.3 MB). There was no memory consumed. Max. memory is 17.8 GB. [2018-10-13 17:52:15,616 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.17 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 59.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. * RCFGBuilder took 439.12 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 15821.39 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 900.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -747.7 MB). Peak memory consumption was 152.5 MB. Max. memory is 17.8 GB. * TraceAbstraction took 1446.54 ms. Allocated memory was 2.4 GB in the beginning and 3.2 GB in the end (delta: 767.6 MB). Free memory was 2.2 GB in the beginning and 3.1 GB in the end (delta: -908.3 MB). There was no memory consumed. Max. memory is 17.8 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 12 LocStat_NO_SUPPORTING_EQUALITIES : 207 LocStat_NO_SUPPORTING_DISEQUALITIES : 504 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 33 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 10657.89 APPLY_RETURN(MILLISECONDS) : 1225.00 #APPLY_NORMAL : 84 #APPLY_RETURN : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 26 different actions 90 times. Merged at 16 different actions 52 times. Never widened. Found 16 fixpoints after 4 different actions. Largest state had 19 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 4 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: 58]: 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: 61]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 4 error locations. SAFE Result, 1.3s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 173 SDtfs, 88 SDslu, 168 SDs, 0 SdLazy, 63 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, 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, 8 MinimizatonAttempts, 45 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 3108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 0/4 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-04.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-13_17-52-15-634.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-04.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-13_17-52-15-634.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-04.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-13_17-52-15-634.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...