java -Xmx8000000000 -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/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:20:01,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:20:01,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:20:01,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:20:01,591 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:20:01,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:20:01,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:20:01,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:20:01,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:20:01,601 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:20:01,602 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:20:01,602 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:20:01,603 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:20:01,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:20:01,605 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:20:01,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:20:01,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:20:01,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:20:01,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:20:01,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:20:01,615 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:20:01,616 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:20:01,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:20:01,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:20:01,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:20:01,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:20:01,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:20:01,622 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:20:01,623 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:20:01,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:20:01,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:20:01,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:20:01,626 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:20:01,626 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:20:01,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:20:01,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:20:01,628 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-10 16:20:01,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:20:01,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:20:01,650 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:20:01,650 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:20:01,650 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:20:01,650 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:20:01,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:20:01,651 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:20:01,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:20:01,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:20:01,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:20:01,654 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:20:01,654 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:20:01,655 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:20:01,655 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:20:01,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:20:01,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:20:01,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:20:01,734 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:20:01,735 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:20:01,736 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_5.bpl [2018-10-10 16:20:01,736 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_5.bpl' [2018-10-10 16:20:01,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:20:01,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:20:01,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:20:01,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:20:01,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:20:01,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:01" (1/1) ... [2018-10-10 16:20:01,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:01" (1/1) ... [2018-10-10 16:20:01,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:01" (1/1) ... [2018-10-10 16:20:01,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:01" (1/1) ... [2018-10-10 16:20:01,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:01" (1/1) ... [2018-10-10 16:20:01,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:01" (1/1) ... [2018-10-10 16:20:01,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:01" (1/1) ... [2018-10-10 16:20:01,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:20:01,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:20:01,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:20:01,882 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:20:01,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 16:20:01,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:20:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:20:01,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:20:02,492 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:20:02,493 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:20:02 BoogieIcfgContainer [2018-10-10 16:20:02,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:20:02,494 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:20:02,494 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:20:02,495 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:20:02,499 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,507 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:20:02,507 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:20:02,542 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:20:02,579 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:20:02,593 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:20:02,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:20:04,971 INFO L315 AbstractInterpreter]: Visited 38 different actions 72 times. Merged at 12 different actions 31 times. Widened at 1 different actions 1 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-10-10 16:20:04,975 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:20:04,980 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:20:05,038 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_#memory_int_2_1_1| |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_6|) at (#memory_int := #memory_int[#Ultimate.C_memset_#ptr.base := #memory_int[#Ultimate.C_memset_#ptr.base][#Ultimate.C_memset_#t~loopctr16 + #Ultimate.C_memset_#ptr.offset := #Ultimate.C_memset_#value]];) [2018-10-10 16:20:05,041 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:20:05,042 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:20:05,048 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:20:05,048 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:20:05,049 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:20:05,049 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:20:05,049 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-10 16:20:05,049 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-10 16:20:05,049 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:20:05,050 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:20:05,050 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:20:05,050 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:20:05,050 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:20:05,050 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-10 16:20:05,051 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-10 16:20:05,054 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:20:05,071 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:20:05 BasicIcfg [2018-10-10 16:20:05,071 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:20:05,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:20:05,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:20:05,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:20:05,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:01" (1/3) ... [2018-10-10 16:20:05,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429fe5ce and model type 20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:20:05, skipping insertion in model container [2018-10-10 16:20:05,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:20:02" (2/3) ... [2018-10-10 16:20:05,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429fe5ce and model type 20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:20:05, skipping insertion in model container [2018-10-10 16:20:05,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:20:05" (3/3) ... [2018-10-10 16:20:05,081 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:20:05,092 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:20:05,102 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:20:05,121 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:20:05,157 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:20:05,158 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:20:05,159 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:20:05,159 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:20:05,159 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:20:05,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:20:05,161 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:20:05,161 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:20:05,161 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:20:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-10 16:20:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-10 16:20:05,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:05,190 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:05,192 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:05,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:05,200 INFO L82 PathProgramCache]: Analyzing trace with hash 739027529, now seen corresponding path program 1 times [2018-10-10 16:20:05,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:05,582 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-10 16:20:05,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:20:05,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 16:20:05,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 16:20:05,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 16:20:05,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 16:20:05,606 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-10-10 16:20:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:05,732 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-10 16:20:05,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 16:20:05,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-10-10 16:20:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:05,755 INFO L225 Difference]: With dead ends: 39 [2018-10-10 16:20:05,756 INFO L226 Difference]: Without dead ends: 39 [2018-10-10 16:20:05,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 16:20:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-10 16:20:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-10 16:20:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-10 16:20:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-10 16:20:05,883 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-10-10 16:20:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:05,884 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-10 16:20:05,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 16:20:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-10 16:20:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-10 16:20:05,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:05,887 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:05,887 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:05,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1546063793, now seen corresponding path program 1 times [2018-10-10 16:20:05,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:06,073 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-10 16:20:06,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:06,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 16:20:06,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 16:20:06,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 16:20:06,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 16:20:06,077 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 5 states. [2018-10-10 16:20:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:06,252 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-10 16:20:06,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 16:20:06,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-10-10 16:20:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:06,254 INFO L225 Difference]: With dead ends: 42 [2018-10-10 16:20:06,254 INFO L226 Difference]: Without dead ends: 42 [2018-10-10 16:20:06,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:20:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-10 16:20:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-10-10 16:20:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-10 16:20:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-10 16:20:06,261 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-10-10 16:20:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:06,261 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-10 16:20:06,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 16:20:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-10 16:20:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-10 16:20:06,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:06,263 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:06,264 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:06,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash 736481609, now seen corresponding path program 2 times [2018-10-10 16:20:06,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:06,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:06,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 16:20:06,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 16:20:06,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 16:20:06,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:20:06,586 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 6 states. [2018-10-10 16:20:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:06,777 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-10 16:20:06,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 16:20:06,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-10-10 16:20:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:06,779 INFO L225 Difference]: With dead ends: 45 [2018-10-10 16:20:06,780 INFO L226 Difference]: Without dead ends: 45 [2018-10-10 16:20:06,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:20:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-10 16:20:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-10 16:20:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-10 16:20:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-10 16:20:06,785 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-10-10 16:20:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:06,786 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-10 16:20:06,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 16:20:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-10 16:20:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-10 16:20:06,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:06,787 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:06,788 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:06,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:06,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1284994895, now seen corresponding path program 3 times [2018-10-10 16:20:06,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:07,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:07,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 16:20:07,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 16:20:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 16:20:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:20:07,005 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 7 states. [2018-10-10 16:20:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:07,127 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-10 16:20:07,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 16:20:07,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-10-10 16:20:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:07,130 INFO L225 Difference]: With dead ends: 48 [2018-10-10 16:20:07,131 INFO L226 Difference]: Without dead ends: 48 [2018-10-10 16:20:07,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:20:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-10 16:20:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-10-10 16:20:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-10 16:20:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-10 16:20:07,136 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-10-10 16:20:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:07,137 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-10 16:20:07,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 16:20:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-10 16:20:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 16:20:07,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:07,138 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:07,139 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:07,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:07,139 INFO L82 PathProgramCache]: Analyzing trace with hash 939898953, now seen corresponding path program 4 times [2018-10-10 16:20:07,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:07,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:07,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:20:07,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:20:07,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:20:07,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:20:07,336 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 8 states. [2018-10-10 16:20:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:07,766 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-10 16:20:07,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 16:20:07,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-10-10 16:20:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:07,772 INFO L225 Difference]: With dead ends: 51 [2018-10-10 16:20:07,772 INFO L226 Difference]: Without dead ends: 51 [2018-10-10 16:20:07,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:20:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-10 16:20:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-10-10 16:20:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-10 16:20:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-10 16:20:07,778 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-10-10 16:20:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:07,779 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-10 16:20:07,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:20:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-10 16:20:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 16:20:07,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:07,781 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:07,781 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:07,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:07,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1477754447, now seen corresponding path program 5 times [2018-10-10 16:20:07,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:07,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:07,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 16:20:07,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:20:07,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:20:07,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:20:07,997 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 9 states. [2018-10-10 16:20:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:08,243 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-10 16:20:08,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 16:20:08,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-10-10 16:20:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:08,246 INFO L225 Difference]: With dead ends: 54 [2018-10-10 16:20:08,246 INFO L226 Difference]: Without dead ends: 54 [2018-10-10 16:20:08,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:20:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-10 16:20:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-10-10 16:20:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-10 16:20:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-10 16:20:08,259 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-10-10 16:20:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:08,259 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-10 16:20:08,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:20:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-10 16:20:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 16:20:08,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:08,264 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:08,264 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:08,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash 811360073, now seen corresponding path program 6 times [2018-10-10 16:20:08,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:08,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:08,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:20:08,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:20:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:20:08,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:20:08,555 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 10 states. [2018-10-10 16:20:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:08,719 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-10 16:20:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 16:20:08,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-10-10 16:20:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:08,721 INFO L225 Difference]: With dead ends: 57 [2018-10-10 16:20:08,721 INFO L226 Difference]: Without dead ends: 57 [2018-10-10 16:20:08,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:20:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-10 16:20:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-10 16:20:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-10 16:20:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-10 16:20:08,726 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-10-10 16:20:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:08,726 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-10 16:20:08,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:20:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-10 16:20:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-10 16:20:08,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:08,727 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:08,728 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:08,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash 331299505, now seen corresponding path program 7 times [2018-10-10 16:20:08,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:08,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:08,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 16:20:08,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 16:20:08,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 16:20:08,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:20:08,943 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 11 states. [2018-10-10 16:20:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:09,074 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-10 16:20:09,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:20:09,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-10-10 16:20:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:09,076 INFO L225 Difference]: With dead ends: 60 [2018-10-10 16:20:09,076 INFO L226 Difference]: Without dead ends: 60 [2018-10-10 16:20:09,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:20:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-10 16:20:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-10-10 16:20:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-10 16:20:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-10 16:20:09,081 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-10-10 16:20:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:09,082 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-10 16:20:09,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 16:20:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-10 16:20:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 16:20:09,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:09,083 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:09,084 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:09,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:09,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1088013897, now seen corresponding path program 8 times [2018-10-10 16:20:09,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:09,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:09,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:20:09,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:20:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:20:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:20:09,289 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 12 states. [2018-10-10 16:20:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:09,443 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-10 16:20:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:20:09,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-10-10 16:20:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:09,445 INFO L225 Difference]: With dead ends: 63 [2018-10-10 16:20:09,445 INFO L226 Difference]: Without dead ends: 63 [2018-10-10 16:20:09,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:20:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-10 16:20:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-10-10 16:20:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-10 16:20:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-10 16:20:09,451 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-10-10 16:20:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:09,451 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-10 16:20:09,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:20:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-10 16:20:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 16:20:09,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:09,452 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:09,453 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:09,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:09,453 INFO L82 PathProgramCache]: Analyzing trace with hash 83129265, now seen corresponding path program 9 times [2018-10-10 16:20:09,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:09,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:09,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 16:20:09,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 16:20:09,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 16:20:09,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 16:20:09,640 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 13 states. [2018-10-10 16:20:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:09,922 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-10 16:20:09,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:20:09,923 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-10-10 16:20:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:09,924 INFO L225 Difference]: With dead ends: 66 [2018-10-10 16:20:09,924 INFO L226 Difference]: Without dead ends: 66 [2018-10-10 16:20:09,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:20:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-10 16:20:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-10 16:20:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-10 16:20:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-10 16:20:09,930 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-10-10 16:20:09,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:09,931 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-10 16:20:09,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 16:20:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-10 16:20:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-10 16:20:09,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:09,932 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:09,933 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:09,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:09,933 INFO L82 PathProgramCache]: Analyzing trace with hash -512889527, now seen corresponding path program 10 times [2018-10-10 16:20:09,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-10 16:20:10,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:20:10,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 16:20:10,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:20:10,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:20:10,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:20:10,132 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 8 states. [2018-10-10 16:20:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:10,253 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-10 16:20:10,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 16:20:10,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-10-10 16:20:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:10,254 INFO L225 Difference]: With dead ends: 62 [2018-10-10 16:20:10,255 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 16:20:10,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:20:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 16:20:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 16:20:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 16:20:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 16:20:10,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-10-10 16:20:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:10,257 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 16:20:10,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:20:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 16:20:10,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 16:20:10,260 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:20:10 BasicIcfg [2018-10-10 16:20:10,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 16:20:10,261 INFO L168 Benchmark]: Toolchain (without parser) took 8448.74 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 826.3 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -552.6 MB). Peak memory consumption was 273.7 MB. Max. memory is 7.1 GB. [2018-10-10 16:20:10,262 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 16:20:10,263 INFO L168 Benchmark]: Boogie Preprocessor took 67.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 16:20:10,263 INFO L168 Benchmark]: RCFGBuilder took 612.09 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 7.1 GB. [2018-10-10 16:20:10,264 INFO L168 Benchmark]: IcfgTransformer took 2577.00 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 50.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 49.3 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. [2018-10-10 16:20:10,265 INFO L168 Benchmark]: TraceAbstraction took 5187.93 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 775.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -623.0 MB). Peak memory consumption was 152.4 MB. Max. memory is 7.1 GB. [2018-10-10 16:20:10,270 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 612.09 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 7.1 GB. * IcfgTransformer took 2577.00 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 50.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 49.3 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5187.93 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 775.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -623.0 MB). Peak memory consumption was 152.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 36 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 581 LocStat_NO_SUPPORTING_DISEQUALITIES : 93 LocStat_NO_DISJUNCTIONS : -72 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 3 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 1 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 1614.36 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 74 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 38 different actions 72 times. Merged at 12 different actions 31 times. Widened at 1 different actions 1 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int, ULTIMATE.start_write~int_old_#memory_int] : 0 COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int, ULTIMATE.start_write~int_old_#memory_int] : null * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. SAFE Result, 5.1s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 336 SDtfs, 435 SDslu, 1242 SDs, 0 SdLazy, 394 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=10, 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, 11 MinimizatonAttempts, 20 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 528 NumberOfCodeBlocks, 528 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 517 ConstructedInterpolants, 0 QuantifiedInterpolants, 89041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 145/550 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/20051113-1.c_false-valid-memtrack.i_5.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-10_16-20-10-292.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_5.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-10_16-20-10-292.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_5.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-10_16-20-10-292.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...