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-b8f97f7-m [2018-10-10 15:48:53,266 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:48:53,268 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:48:53,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:48:53,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:48:53,282 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:48:53,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:48:53,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:48:53,289 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:48:53,290 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:48:53,291 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:48:53,291 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:48:53,292 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:48:53,293 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:48:53,294 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:48:53,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:48:53,296 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:48:53,298 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:48:53,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:48:53,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:48:53,304 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:48:53,305 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:48:53,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:48:53,308 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:48:53,308 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:48:53,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:48:53,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:48:53,312 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:48:53,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:48:53,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:48:53,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:48:53,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:48:53,315 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:48:53,315 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:48:53,317 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:48:53,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:48:53,318 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 15:48:53,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:48:53,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:48:53,329 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:48:53,330 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:48:53,330 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:48:53,330 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:48:53,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:48:53,331 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:48:53,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:48:53,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:48:53,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:48:53,332 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:48:53,333 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:48:53,334 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:48:53,334 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:48:53,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:48:53,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:48:53,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:48:53,419 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:48:53,420 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:48:53,421 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-10 15:48:53,421 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-10 15:48:53,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:48:53,510 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:48:53,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:48:53,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:48:53,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:48:53,540 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 10.10 03:48:53" (1/1) ... [2018-10-10 15:48:53,543 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 10.10 03:48:53" (1/1) ... [2018-10-10 15:48:53,563 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 10.10 03:48:53" (1/1) ... [2018-10-10 15:48:53,563 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 10.10 03:48:53" (1/1) ... [2018-10-10 15:48:53,573 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 10.10 03:48:53" (1/1) ... [2018-10-10 15:48:53,578 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 10.10 03:48:53" (1/1) ... [2018-10-10 15:48:53,588 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 10.10 03:48:53" (1/1) ... [2018-10-10 15:48:53,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:48:53,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:48:53,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:48:53,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:48:53,594 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 10.10 03:48:53" (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 15:48:53,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:48:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:48:53,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:48:54,368 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:48:54,369 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 10.10 03:48:54 BoogieIcfgContainer [2018-10-10 15:48:54,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:48:54,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:48:54,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:48:54,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:48:54,378 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 10.10 03:48:53" (1/2) ... [2018-10-10 15:48:54,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411a2bb9 and model type test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:48:54, skipping insertion in model container [2018-10-10 15:48:54,380 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 10.10 03:48:54" (2/2) ... [2018-10-10 15:48:54,382 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 15:48:54,393 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:48:54,404 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:48:54,422 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:48:54,459 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:48:54,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:48:54,460 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:48:54,461 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:48:54,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:48:54,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:48:54,461 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:48:54,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:48:54,462 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:48:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2018-10-10 15:48:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 15:48:54,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:54,514 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-10 15:48:54,515 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:54,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash -34612688, now seen corresponding path program 1 times [2018-10-10 15:48:54,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:54,896 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 15:48:54,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:48:54,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:48:54,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:48:54,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:48:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:48:54,925 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 4 states. [2018-10-10 15:48:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:55,086 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-10 15:48:55,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:48:55,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-10-10 15:48:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:55,101 INFO L225 Difference]: With dead ends: 103 [2018-10-10 15:48:55,102 INFO L226 Difference]: Without dead ends: 103 [2018-10-10 15:48:55,104 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-10 15:48:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-10 15:48:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-10-10 15:48:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-10 15:48:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-10 15:48:55,151 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-10-10 15:48:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:55,152 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-10 15:48:55,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:48:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-10 15:48:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-10 15:48:55,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:55,157 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-10 15:48:55,157 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:55,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash 891387159, now seen corresponding path program 1 times [2018-10-10 15:48:55,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:55,403 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 15:48:55,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:55,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:48:55,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:48:55,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:48:55,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:48:55,407 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 5 states. [2018-10-10 15:48:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:55,550 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-10 15:48:55,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:48:55,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-10-10 15:48:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:55,554 INFO L225 Difference]: With dead ends: 106 [2018-10-10 15:48:55,554 INFO L226 Difference]: Without dead ends: 106 [2018-10-10 15:48:55,555 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-10 15:48:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-10 15:48:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-10-10 15:48:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-10 15:48:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-10 15:48:55,567 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-10-10 15:48:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:55,568 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-10 15:48:55,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:48:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-10 15:48:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 15:48:55,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:55,571 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-10 15:48:55,571 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:55,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash 777886928, now seen corresponding path program 2 times [2018-10-10 15:48:55,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:55,879 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 15:48:55,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:55,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:48:55,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:48:55,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:48:55,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:48:55,882 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 6 states. [2018-10-10 15:48:55,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:55,995 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-10 15:48:55,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:48:55,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-10-10 15:48:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:55,998 INFO L225 Difference]: With dead ends: 109 [2018-10-10 15:48:55,998 INFO L226 Difference]: Without dead ends: 109 [2018-10-10 15:48:55,999 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-10 15:48:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-10 15:48:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-10 15:48:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-10 15:48:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-10 15:48:56,009 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-10-10 15:48:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:56,010 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-10 15:48:56,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:48:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-10 15:48:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-10 15:48:56,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:56,012 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-10 15:48:56,013 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:56,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:56,013 INFO L82 PathProgramCache]: Analyzing trace with hash -368232841, now seen corresponding path program 3 times [2018-10-10 15:48:56,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:56,561 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 15:48:56,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:56,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:48:56,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:48:56,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:48:56,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:48:56,563 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 7 states. [2018-10-10 15:48:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:57,200 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-10 15:48:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:48:57,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-10-10 15:48:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:57,203 INFO L225 Difference]: With dead ends: 112 [2018-10-10 15:48:57,203 INFO L226 Difference]: Without dead ends: 112 [2018-10-10 15:48:57,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:48:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-10 15:48:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-10-10 15:48:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 15:48:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-10 15:48:57,214 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-10-10 15:48:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:57,214 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-10 15:48:57,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:48:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-10 15:48:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 15:48:57,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:57,217 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-10 15:48:57,217 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:57,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:57,220 INFO L82 PathProgramCache]: Analyzing trace with hash 567732080, now seen corresponding path program 4 times [2018-10-10 15:48:57,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:57,512 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 15:48:57,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:57,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:48:57,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:48:57,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:48:57,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:48:57,514 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 8 states. [2018-10-10 15:48:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:58,028 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-10 15:48:58,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:48:58,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-10-10 15:48:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:58,030 INFO L225 Difference]: With dead ends: 115 [2018-10-10 15:48:58,031 INFO L226 Difference]: Without dead ends: 115 [2018-10-10 15:48:58,031 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-10 15:48:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-10 15:48:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-10-10 15:48:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-10 15:48:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-10 15:48:58,040 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-10-10 15:48:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:58,041 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-10 15:48:58,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:48:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-10 15:48:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-10 15:48:58,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:58,043 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-10 15:48:58,044 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:58,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash 971007959, now seen corresponding path program 5 times [2018-10-10 15:48:58,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:58,334 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 15:48:58,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:58,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:48:58,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:48:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:48:58,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:48:58,336 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 9 states. [2018-10-10 15:48:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:58,562 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-10 15:48:58,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:48:58,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2018-10-10 15:48:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:58,566 INFO L225 Difference]: With dead ends: 118 [2018-10-10 15:48:58,566 INFO L226 Difference]: Without dead ends: 118 [2018-10-10 15:48:58,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:48:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-10 15:48:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-10-10 15:48:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 15:48:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-10 15:48:58,574 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-10-10 15:48:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:58,575 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-10 15:48:58,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:48:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-10 15:48:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 15:48:58,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:58,577 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-10 15:48:58,577 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:58,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1939192336, now seen corresponding path program 6 times [2018-10-10 15:48:58,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:58,813 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 15:48:58,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:58,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:48:58,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:48:58,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:48:58,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:48:58,815 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 10 states. [2018-10-10 15:48:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:59,090 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-10 15:48:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:48:59,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-10-10 15:48:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:59,093 INFO L225 Difference]: With dead ends: 121 [2018-10-10 15:48:59,093 INFO L226 Difference]: Without dead ends: 121 [2018-10-10 15:48:59,094 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 15:48:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-10 15:48:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-10-10 15:48:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-10 15:48:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-10 15:48:59,102 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-10-10 15:48:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:59,102 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-10 15:48:59,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:48:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-10 15:48:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-10 15:48:59,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:59,104 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-10 15:48:59,105 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:59,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash 119607607, now seen corresponding path program 7 times [2018-10-10 15:48:59,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:59,414 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 15:48:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:48:59,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:48:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:48:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:48:59,416 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 11 states. [2018-10-10 15:48:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:48:59,596 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-10 15:48:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:48:59,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-10-10 15:48:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:48:59,604 INFO L225 Difference]: With dead ends: 124 [2018-10-10 15:48:59,605 INFO L226 Difference]: Without dead ends: 124 [2018-10-10 15:48:59,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:48:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-10 15:48:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-10-10 15:48:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-10 15:48:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-10 15:48:59,612 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-10-10 15:48:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:48:59,612 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-10 15:48:59,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:48:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-10 15:48:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 15:48:59,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:48:59,614 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-10 15:48:59,614 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:48:59,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:48:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash -346811216, now seen corresponding path program 8 times [2018-10-10 15:48:59,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:48:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:48:59,925 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 15:48:59,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:48:59,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:48:59,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:48:59,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:48:59,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:48:59,927 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 12 states. [2018-10-10 15:49:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:49:00,159 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-10 15:49:00,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:49:00,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 121 [2018-10-10 15:49:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:49:00,161 INFO L225 Difference]: With dead ends: 127 [2018-10-10 15:49:00,161 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 15:49:00,162 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-10 15:49:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 15:49:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-10-10 15:49:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-10 15:49:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-10 15:49:00,167 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-10-10 15:49:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:49:00,168 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-10 15:49:00,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:49:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-10 15:49:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-10 15:49:00,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:49:00,169 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-10 15:49:00,170 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:49:00,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:49:00,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1210764649, now seen corresponding path program 9 times [2018-10-10 15:49:00,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:49:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:49:00,994 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 15:49:00,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:49:00,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:49:00,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:49:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:49:00,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:49:00,999 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 13 states. [2018-10-10 15:49:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:49:01,313 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-10 15:49:01,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:49:01,321 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2018-10-10 15:49:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:49:01,322 INFO L225 Difference]: With dead ends: 128 [2018-10-10 15:49:01,322 INFO L226 Difference]: Without dead ends: 128 [2018-10-10 15:49:01,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:49:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-10 15:49:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-10-10 15:49:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 15:49:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-10 15:49:01,328 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-10-10 15:49:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:49:01,331 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-10 15:49:01,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:49:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-10 15:49:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-10 15:49:01,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:49:01,332 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-10 15:49:01,333 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:49:01,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:49:01,333 INFO L82 PathProgramCache]: Analyzing trace with hash 491517776, now seen corresponding path program 10 times [2018-10-10 15:49:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:49:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:49:01,653 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 15:49:01,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:49:01,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 15:49:01,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:49:01,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:49:01,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:49:01,655 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 9 states. [2018-10-10 15:49:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:49:02,435 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-10 15:49:02,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:49:02,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-10-10 15:49:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:49:02,436 INFO L225 Difference]: With dead ends: 126 [2018-10-10 15:49:02,436 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:49:02,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:49:02,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:49:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:49:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:49:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:49:02,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2018-10-10 15:49:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:49:02,438 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:49:02,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:49:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:49:02,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:49:02,444 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 10.10 03:49:02 BoogieIcfgContainer [2018-10-10 15:49:02,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:49:02,445 INFO L168 Benchmark]: Toolchain (without parser) took 8937.09 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 23.1 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 82.5 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2018-10-10 15:49:02,448 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 15:49:02,448 INFO L168 Benchmark]: Boogie Preprocessor took 81.57 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 15:49:02,449 INFO L168 Benchmark]: RCFGBuilder took 776.91 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-10 15:49:02,450 INFO L168 Benchmark]: TraceAbstraction took 8073.71 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 23.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 50.7 MB). Peak memory consumption was 73.8 MB. Max. memory is 7.1 GB. [2018-10-10 15:49:02,453 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.21 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 81.57 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 776.91 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8073.71 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 23.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 50.7 MB). Peak memory consumption was 73.8 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.9s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 3.6s 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.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 3.9s 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.3s 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-10_15-49-02-464.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-10_15-49-02-464.csv Received shutdown request...