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/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:56:12,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:56:12,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:56:12,885 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:56:12,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:56:12,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:56:12,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:56:12,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:56:12,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:56:12,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:56:12,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:56:12,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:56:12,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:56:12,896 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:56:12,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:56:12,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:56:12,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:56:12,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:56:12,912 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:56:12,914 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:56:12,915 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:56:12,919 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:56:12,922 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:56:12,922 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:56:12,923 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:56:12,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:56:12,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:56:12,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:56:12,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:56:12,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:56:12,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:56:12,932 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:56:12,932 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:56:12,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:56:12,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:56:12,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:56:12,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 16:56:12,954 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:56:12,954 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:56:12,955 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:56:12,955 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:56:12,956 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:56:12,957 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:56:12,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:56:12,958 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:56:12,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:56:12,958 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:56:12,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:56:12,958 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:56:12,959 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:56:12,960 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:56:12,960 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:56:13,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:56:13,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:56:13,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:56:13,043 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:56:13,043 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:56:13,044 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl [2018-10-14 16:56:13,044 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl' [2018-10-14 16:56:13,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:56:13,144 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:56:13,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:56:13,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:56:13,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:56:13,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:13" (1/1) ... [2018-10-14 16:56:13,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:13" (1/1) ... [2018-10-14 16:56:13,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:13" (1/1) ... [2018-10-14 16:56:13,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:13" (1/1) ... [2018-10-14 16:56:13,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:13" (1/1) ... [2018-10-14 16:56:13,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:13" (1/1) ... [2018-10-14 16:56:13,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:13" (1/1) ... [2018-10-14 16:56:13,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:56:13,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:56:13,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:56:13,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:56:13,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 16:56:13,290 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:56:13,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:56:13,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:56:14,059 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:56:14,062 INFO L202 PluginConnector]: Adding new model test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:56:14 BoogieIcfgContainer [2018-10-14 16:56:14,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:56:14,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:56:14,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:56:14,070 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:56:14,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:13" (1/2) ... [2018-10-14 16:56:14,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437c58a0 and model type test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:56:14, skipping insertion in model container [2018-10-14 16:56:14,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:56:14" (2/2) ... [2018-10-14 16:56:14,075 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl [2018-10-14 16:56:14,087 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:56:14,097 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:56:14,117 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:56:14,152 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:56:14,153 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:56:14,153 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:56:14,153 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:56:14,154 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:56:14,154 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:56:14,154 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:56:14,154 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:56:14,154 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:56:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2018-10-14 16:56:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-14 16:56:14,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:14,196 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:14,198 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:14,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:14,206 INFO L82 PathProgramCache]: Analyzing trace with hash -34612688, now seen corresponding path program 1 times [2018-10-14 16:56:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:14,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:56:14,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-14 16:56:14,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 16:56:14,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 16:56:14,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 16:56:14,647 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 4 states. [2018-10-14 16:56:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:14,847 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-14 16:56:14,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 16:56:14,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-10-14 16:56:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:14,865 INFO L225 Difference]: With dead ends: 103 [2018-10-14 16:56:14,866 INFO L226 Difference]: Without dead ends: 103 [2018-10-14 16:56:14,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 16:56:14,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-14 16:56:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-10-14 16:56:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-14 16:56:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-14 16:56:14,925 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-10-14 16:56:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:14,926 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-14 16:56:14,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 16:56:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-14 16:56:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-14 16:56:14,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:14,935 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:14,936 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:14,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:14,937 INFO L82 PathProgramCache]: Analyzing trace with hash 891387159, now seen corresponding path program 1 times [2018-10-14 16:56:14,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:15,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:15,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 16:56:15,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 16:56:15,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 16:56:15,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-14 16:56:15,144 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 5 states. [2018-10-14 16:56:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:15,294 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-14 16:56:15,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-14 16:56:15,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-10-14 16:56:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:15,302 INFO L225 Difference]: With dead ends: 106 [2018-10-14 16:56:15,302 INFO L226 Difference]: Without dead ends: 106 [2018-10-14 16:56:15,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:56:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-14 16:56:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-10-14 16:56:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-14 16:56:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-14 16:56:15,326 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-10-14 16:56:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:15,326 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-14 16:56:15,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 16:56:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-14 16:56:15,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-14 16:56:15,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:15,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:15,331 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:15,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash 777886928, now seen corresponding path program 2 times [2018-10-14 16:56:15,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:15,577 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-14 16:56:15,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:15,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-14 16:56:15,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 16:56:15,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 16:56:15,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:56:15,579 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 6 states. [2018-10-14 16:56:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:15,690 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-14 16:56:15,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 16:56:15,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-10-14 16:56:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:15,696 INFO L225 Difference]: With dead ends: 109 [2018-10-14 16:56:15,696 INFO L226 Difference]: Without dead ends: 109 [2018-10-14 16:56:15,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:56:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-14 16:56:15,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-14 16:56:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-14 16:56:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-14 16:56:15,706 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-10-14 16:56:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:15,706 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-14 16:56:15,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 16:56:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-14 16:56:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-14 16:56:15,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:15,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:15,709 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:15,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash -368232841, now seen corresponding path program 3 times [2018-10-14 16:56:15,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:15,861 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-14 16:56:15,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:15,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 16:56:15,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:56:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:56:15,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:56:15,863 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 7 states. [2018-10-14 16:56:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:16,364 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-14 16:56:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-14 16:56:16,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-10-14 16:56:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:16,369 INFO L225 Difference]: With dead ends: 112 [2018-10-14 16:56:16,369 INFO L226 Difference]: Without dead ends: 112 [2018-10-14 16:56:16,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:56:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-14 16:56:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-10-14 16:56:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-14 16:56:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-14 16:56:16,384 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-10-14 16:56:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:16,384 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-14 16:56:16,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:56:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-14 16:56:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-14 16:56:16,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:16,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:16,387 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:16,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:16,388 INFO L82 PathProgramCache]: Analyzing trace with hash 567732080, now seen corresponding path program 4 times [2018-10-14 16:56:16,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:16,621 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-14 16:56:16,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:16,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:56:16,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:56:16,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:56:16,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:56:16,623 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 8 states. [2018-10-14 16:56:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:17,122 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-14 16:56:17,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 16:56:17,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-10-14 16:56:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:17,125 INFO L225 Difference]: With dead ends: 115 [2018-10-14 16:56:17,126 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 16:56:17,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:56:17,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 16:56:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-10-14 16:56:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-14 16:56:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-14 16:56:17,146 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-10-14 16:56:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:17,148 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-14 16:56:17,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:56:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-14 16:56:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-14 16:56:17,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:17,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:17,151 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:17,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash 971007959, now seen corresponding path program 5 times [2018-10-14 16:56:17,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:17,498 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-14 16:56:17,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:17,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:56:17,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:56:17,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:56:17,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:56:17,500 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 9 states. [2018-10-14 16:56:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:17,749 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-14 16:56:17,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:56:17,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2018-10-14 16:56:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:17,753 INFO L225 Difference]: With dead ends: 118 [2018-10-14 16:56:17,754 INFO L226 Difference]: Without dead ends: 118 [2018-10-14 16:56:17,754 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-14 16:56:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-14 16:56:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-10-14 16:56:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-14 16:56:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-14 16:56:17,761 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-10-14 16:56:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:17,761 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-14 16:56:17,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:56:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-14 16:56:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-14 16:56:17,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:17,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:17,764 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:17,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1939192336, now seen corresponding path program 6 times [2018-10-14 16:56:17,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:18,023 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-14 16:56:18,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:18,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:56:18,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:56:18,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:56:18,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:56:18,025 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 10 states. [2018-10-14 16:56:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:18,272 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-14 16:56:18,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 16:56:18,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-10-14 16:56:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:18,274 INFO L225 Difference]: With dead ends: 121 [2018-10-14 16:56:18,274 INFO L226 Difference]: Without dead ends: 121 [2018-10-14 16:56:18,275 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-14 16:56:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-14 16:56:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-10-14 16:56:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-14 16:56:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-14 16:56:18,280 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-10-14 16:56:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:18,281 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-14 16:56:18,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:56:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-14 16:56:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-14 16:56:18,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:18,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:18,283 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:18,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:18,284 INFO L82 PathProgramCache]: Analyzing trace with hash 119607607, now seen corresponding path program 7 times [2018-10-14 16:56:18,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:18,480 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-14 16:56:18,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:18,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 16:56:18,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 16:56:18,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 16:56:18,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:56:18,482 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 11 states. [2018-10-14 16:56:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:18,650 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-14 16:56:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:56:18,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-10-14 16:56:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:18,657 INFO L225 Difference]: With dead ends: 124 [2018-10-14 16:56:18,658 INFO L226 Difference]: Without dead ends: 124 [2018-10-14 16:56:18,658 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-14 16:56:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-14 16:56:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-10-14 16:56:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-14 16:56:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-14 16:56:18,665 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-10-14 16:56:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:18,665 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-14 16:56:18,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 16:56:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-14 16:56:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-14 16:56:18,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:18,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:18,675 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:18,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash -346811216, now seen corresponding path program 8 times [2018-10-14 16:56:18,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:18,985 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-14 16:56:18,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:18,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:56:18,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:56:18,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:56:18,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:56:18,987 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 12 states. [2018-10-14 16:56:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:19,232 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-14 16:56:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:56:19,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 121 [2018-10-14 16:56:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:19,235 INFO L225 Difference]: With dead ends: 127 [2018-10-14 16:56:19,235 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 16:56:19,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:56:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 16:56:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-10-14 16:56:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-14 16:56:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-14 16:56:19,241 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-10-14 16:56:19,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:19,242 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-14 16:56:19,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:56:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-14 16:56:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-14 16:56:19,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:19,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:19,244 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:19,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1210764649, now seen corresponding path program 9 times [2018-10-14 16:56:19,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:20,259 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-14 16:56:20,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:20,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 16:56:20,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 16:56:20,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 16:56:20,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-14 16:56:20,261 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 13 states. [2018-10-14 16:56:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:20,530 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-14 16:56:20,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:56:20,537 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2018-10-14 16:56:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:20,538 INFO L225 Difference]: With dead ends: 128 [2018-10-14 16:56:20,538 INFO L226 Difference]: Without dead ends: 128 [2018-10-14 16:56:20,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:56:20,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-14 16:56:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-10-14 16:56:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-14 16:56:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-14 16:56:20,543 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-10-14 16:56:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:20,543 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-14 16:56:20,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 16:56:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-14 16:56:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-14 16:56:20,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:20,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:20,545 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:20,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash 491517776, now seen corresponding path program 10 times [2018-10-14 16:56:20,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:20,877 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-14 16:56:20,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:56:20,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-14 16:56:20,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:56:20,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:56:20,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:56:20,878 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 9 states. [2018-10-14 16:56:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:21,532 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-14 16:56:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:56:21,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-10-14 16:56:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:21,533 INFO L225 Difference]: With dead ends: 126 [2018-10-14 16:56:21,533 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 16:56:21,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:56:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 16:56:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 16:56:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 16:56:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 16:56:21,535 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2018-10-14 16:56:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:21,535 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 16:56:21,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:56:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 16:56:21,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 16:56:21,541 INFO L202 PluginConnector]: Adding new model test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:56:21 BoogieIcfgContainer [2018-10-14 16:56:21,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 16:56:21,542 INFO L168 Benchmark]: Toolchain (without parser) took 8399.43 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 46.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 64.8 MB). Peak memory consumption was 110.9 MB. Max. memory is 7.1 GB. [2018-10-14 16:56:21,544 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:56:21,545 INFO L168 Benchmark]: Boogie Preprocessor took 78.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:56:21,545 INFO L168 Benchmark]: RCFGBuilder took 838.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-14 16:56:21,546 INFO L168 Benchmark]: TraceAbstraction took 7477.64 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 46.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 33.0 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2018-10-14 16:56:21,550 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 838.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7477.64 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 46.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 33.0 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 163]: 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, 102 locations, 1 error locations. SAFE Result, 7.4s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 999 SDtfs, 729 SDslu, 3976 SDs, 0 SdLazy, 602 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1232 NumberOfCodeBlocks, 1232 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1221 ConstructedInterpolants, 0 QuantifiedInterpolants, 301065 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/test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-14_16-56-21-560.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-14_16-56-21-560.csv Received shutdown request...