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_true-valid-memsafety_true-termination.i_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 21:16:29,408 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 21:16:29,410 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 21:16:29,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 21:16:29,423 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 21:16:29,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 21:16:29,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 21:16:29,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 21:16:29,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 21:16:29,437 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 21:16:29,438 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 21:16:29,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 21:16:29,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 21:16:29,443 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 21:16:29,444 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 21:16:29,445 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 21:16:29,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 21:16:29,453 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 21:16:29,457 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 21:16:29,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 21:16:29,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 21:16:29,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 21:16:29,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 21:16:29,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 21:16:29,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 21:16:29,470 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 21:16:29,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 21:16:29,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 21:16:29,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 21:16:29,473 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 21:16:29,473 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 21:16:29,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 21:16:29,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 21:16:29,474 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 21:16:29,475 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 21:16:29,476 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 21:16:29,476 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-12 21:16:29,488 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 21:16:29,488 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 21:16:29,489 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 21:16:29,489 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 21:16:29,490 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 21:16:29,490 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 21:16:29,490 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 21:16:29,491 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 21:16:29,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 21:16:29,491 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 21:16:29,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 21:16:29,491 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 21:16:29,492 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 21:16:29,493 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 21:16:29,493 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 21:16:29,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 21:16:29,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 21:16:29,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 21:16:29,561 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 21:16:29,561 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 21:16:29,562 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl [2018-10-12 21:16:29,562 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl' [2018-10-12 21:16:29,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 21:16:29,631 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 21:16:29,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 21:16:29,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 21:16:29,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 21:16:29,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:29" (1/1) ... [2018-10-12 21:16:29,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:29" (1/1) ... [2018-10-12 21:16:29,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:29" (1/1) ... [2018-10-12 21:16:29,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:29" (1/1) ... [2018-10-12 21:16:29,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:29" (1/1) ... [2018-10-12 21:16:29,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:29" (1/1) ... [2018-10-12 21:16:29,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:29" (1/1) ... [2018-10-12 21:16:29,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 21:16:29,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 21:16:29,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 21:16:29,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 21:16:29,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:29" (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-12 21:16:29,772 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 21:16:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 21:16:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 21:16:30,479 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 21:16:30,480 INFO L202 PluginConnector]: Adding new model test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:16:30 BoogieIcfgContainer [2018-10-12 21:16:30,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 21:16:30,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 21:16:30,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 21:16:30,484 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 21:16:30,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:16:29" (1/2) ... [2018-10-12 21:16:30,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a21099f and model type test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:16:30, skipping insertion in model container [2018-10-12 21:16:30,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:16:30" (2/2) ... [2018-10-12 21:16:30,489 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl [2018-10-12 21:16:30,499 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 21:16:30,510 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 21:16:30,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 21:16:30,560 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 21:16:30,561 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 21:16:30,561 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 21:16:30,562 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 21:16:30,562 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 21:16:30,562 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 21:16:30,562 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 21:16:30,562 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 21:16:30,562 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 21:16:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-10-12 21:16:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-12 21:16:30,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:30,610 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] [2018-10-12 21:16:30,611 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:30,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:30,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1909949462, now seen corresponding path program 1 times [2018-10-12 21:16:30,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:30,943 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-12 21:16:30,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 21:16:30,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-12 21:16:30,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-12 21:16:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-12 21:16:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-12 21:16:30,971 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-10-12 21:16:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:31,145 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-12 21:16:31,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-12 21:16:31,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-10-12 21:16:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:31,171 INFO L225 Difference]: With dead ends: 91 [2018-10-12 21:16:31,171 INFO L226 Difference]: Without dead ends: 91 [2018-10-12 21:16:31,173 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-12 21:16:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-12 21:16:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-10-12 21:16:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-12 21:16:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-12 21:16:31,228 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-10-12 21:16:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:31,229 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-12 21:16:31,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-12 21:16:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-12 21:16:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-12 21:16:31,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:31,233 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] [2018-10-12 21:16:31,233 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:31,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1668127377, now seen corresponding path program 1 times [2018-10-12 21:16:31,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:31,448 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-12 21:16:31,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:31,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-12 21:16:31,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-12 21:16:31,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-12 21:16:31,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-12 21:16:31,453 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 5 states. [2018-10-12 21:16:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:31,583 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-12 21:16:31,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-12 21:16:31,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-10-12 21:16:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:31,586 INFO L225 Difference]: With dead ends: 94 [2018-10-12 21:16:31,587 INFO L226 Difference]: Without dead ends: 94 [2018-10-12 21:16:31,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-12 21:16:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-12 21:16:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-10-12 21:16:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-12 21:16:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-12 21:16:31,598 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-10-12 21:16:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:31,599 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-12 21:16:31,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-12 21:16:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-12 21:16:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-12 21:16:31,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:31,603 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] [2018-10-12 21:16:31,603 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:31,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:31,604 INFO L82 PathProgramCache]: Analyzing trace with hash -638081398, now seen corresponding path program 2 times [2018-10-12 21:16:31,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:31,783 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-12 21:16:31,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:31,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-12 21:16:31,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 21:16:31,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 21:16:31,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-12 21:16:31,786 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 6 states. [2018-10-12 21:16:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:31,973 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-12 21:16:31,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-12 21:16:31,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-10-12 21:16:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:31,976 INFO L225 Difference]: With dead ends: 97 [2018-10-12 21:16:31,976 INFO L226 Difference]: Without dead ends: 97 [2018-10-12 21:16:31,977 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-12 21:16:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-12 21:16:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-10-12 21:16:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-12 21:16:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-12 21:16:31,986 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-10-12 21:16:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:31,986 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-12 21:16:31,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 21:16:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-12 21:16:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-12 21:16:31,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:31,989 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] [2018-10-12 21:16:31,989 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:31,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:31,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1688136689, now seen corresponding path program 3 times [2018-10-12 21:16:31,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:32,305 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-12 21:16:32,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:32,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-12 21:16:32,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-12 21:16:32,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-12 21:16:32,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-12 21:16:32,307 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 7 states. [2018-10-12 21:16:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:32,726 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-12 21:16:32,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-12 21:16:32,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-10-12 21:16:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:32,728 INFO L225 Difference]: With dead ends: 100 [2018-10-12 21:16:32,728 INFO L226 Difference]: Without dead ends: 100 [2018-10-12 21:16:32,729 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-12 21:16:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-12 21:16:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-10-12 21:16:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-12 21:16:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-12 21:16:32,737 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-10-12 21:16:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:32,738 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-12 21:16:32,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-12 21:16:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-12 21:16:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-12 21:16:32,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:32,742 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] [2018-10-12 21:16:32,742 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:32,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1541121750, now seen corresponding path program 4 times [2018-10-12 21:16:32,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:33,484 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-12 21:16:33,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:33,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 21:16:33,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 21:16:33,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 21:16:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-12 21:16:33,487 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 8 states. [2018-10-12 21:16:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:33,935 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-12 21:16:33,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 21:16:33,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2018-10-12 21:16:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:33,938 INFO L225 Difference]: With dead ends: 103 [2018-10-12 21:16:33,938 INFO L226 Difference]: Without dead ends: 103 [2018-10-12 21:16:33,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-12 21:16:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-12 21:16:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-10-12 21:16:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-12 21:16:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-12 21:16:33,946 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-10-12 21:16:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:33,946 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-12 21:16:33,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 21:16:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-12 21:16:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-12 21:16:33,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:33,949 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] [2018-10-12 21:16:33,950 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:33,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:33,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1406814895, now seen corresponding path program 5 times [2018-10-12 21:16:33,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:34,304 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-12 21:16:34,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:34,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-12 21:16:34,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 21:16:34,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 21:16:34,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-12 21:16:34,306 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 9 states. [2018-10-12 21:16:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:34,822 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-12 21:16:34,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 21:16:34,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2018-10-12 21:16:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:34,825 INFO L225 Difference]: With dead ends: 106 [2018-10-12 21:16:34,825 INFO L226 Difference]: Without dead ends: 106 [2018-10-12 21:16:34,826 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-12 21:16:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-12 21:16:34,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-10-12 21:16:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-12 21:16:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-12 21:16:34,833 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-10-12 21:16:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:34,834 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-12 21:16:34,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 21:16:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-12 21:16:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-12 21:16:34,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:34,836 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] [2018-10-12 21:16:34,837 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:34,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1114149834, now seen corresponding path program 6 times [2018-10-12 21:16:34,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:35,062 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-12 21:16:35,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:35,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 21:16:35,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 21:16:35,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 21:16:35,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-12 21:16:35,065 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 10 states. [2018-10-12 21:16:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:35,297 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-12 21:16:35,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-12 21:16:35,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-10-12 21:16:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:35,299 INFO L225 Difference]: With dead ends: 109 [2018-10-12 21:16:35,299 INFO L226 Difference]: Without dead ends: 109 [2018-10-12 21:16:35,300 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-12 21:16:35,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-12 21:16:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-12 21:16:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-12 21:16:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-12 21:16:35,308 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-10-12 21:16:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:35,308 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-12 21:16:35,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 21:16:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-12 21:16:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-12 21:16:35,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:35,310 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] [2018-10-12 21:16:35,311 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:35,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1376253617, now seen corresponding path program 7 times [2018-10-12 21:16:35,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:35,612 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-12 21:16:35,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:35,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-12 21:16:35,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 21:16:35,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 21:16:35,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-12 21:16:35,614 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 11 states. [2018-10-12 21:16:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:35,828 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-12 21:16:35,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 21:16:35,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2018-10-12 21:16:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:35,837 INFO L225 Difference]: With dead ends: 112 [2018-10-12 21:16:35,837 INFO L226 Difference]: Without dead ends: 112 [2018-10-12 21:16:35,838 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-12 21:16:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-12 21:16:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-10-12 21:16:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-12 21:16:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-12 21:16:35,848 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-10-12 21:16:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:35,849 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-12 21:16:35,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 21:16:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-12 21:16:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-12 21:16:35,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:35,851 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] [2018-10-12 21:16:35,851 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:35,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1459508842, now seen corresponding path program 8 times [2018-10-12 21:16:35,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:36,057 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-12 21:16:36,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:36,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 21:16:36,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 21:16:36,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 21:16:36,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-12 21:16:36,059 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 12 states. [2018-10-12 21:16:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:36,588 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-12 21:16:36,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 21:16:36,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-10-12 21:16:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:36,591 INFO L225 Difference]: With dead ends: 115 [2018-10-12 21:16:36,591 INFO L226 Difference]: Without dead ends: 115 [2018-10-12 21:16:36,592 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-12 21:16:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-12 21:16:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-10-12 21:16:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-12 21:16:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-12 21:16:36,603 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-10-12 21:16:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:36,604 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-12 21:16:36,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 21:16:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-12 21:16:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-12 21:16:36,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:36,610 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] [2018-10-12 21:16:36,611 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:36,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:36,611 INFO L82 PathProgramCache]: Analyzing trace with hash -775180271, now seen corresponding path program 9 times [2018-10-12 21:16:36,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:36,928 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-12 21:16:36,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:36,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-12 21:16:36,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-12 21:16:36,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-12 21:16:36,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-12 21:16:36,930 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 13 states. [2018-10-12 21:16:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:37,318 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-12 21:16:37,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 21:16:37,318 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-10-12 21:16:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:37,319 INFO L225 Difference]: With dead ends: 116 [2018-10-12 21:16:37,320 INFO L226 Difference]: Without dead ends: 116 [2018-10-12 21:16:37,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-12 21:16:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-12 21:16:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-10-12 21:16:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-12 21:16:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-12 21:16:37,324 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-10-12 21:16:37,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:37,325 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-12 21:16:37,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-12 21:16:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-12 21:16:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-12 21:16:37,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:37,327 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] [2018-10-12 21:16:37,327 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:37,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:37,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1889509642, now seen corresponding path program 10 times [2018-10-12 21:16:37,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:38,218 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-12 21:16:38,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 21:16:38,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-12 21:16:38,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 21:16:38,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 21:16:38,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 21:16:38,220 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 8 states. [2018-10-12 21:16:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:38,629 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-12 21:16:38,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 21:16:38,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2018-10-12 21:16:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:38,630 INFO L225 Difference]: With dead ends: 114 [2018-10-12 21:16:38,630 INFO L226 Difference]: Without dead ends: 0 [2018-10-12 21:16:38,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-12 21:16:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-12 21:16:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-12 21:16:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-12 21:16:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-12 21:16:38,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2018-10-12 21:16:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:38,632 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-12 21:16:38,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 21:16:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-12 21:16:38,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-12 21:16:38,638 INFO L202 PluginConnector]: Adding new model test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 09:16:38 BoogieIcfgContainer [2018-10-12 21:16:38,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-12 21:16:38,639 INFO L168 Benchmark]: Toolchain (without parser) took 9008.81 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 38.3 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 22.0 MB). Peak memory consumption was 60.2 MB. Max. memory is 7.1 GB. [2018-10-12 21:16:38,641 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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-12 21:16:38,642 INFO L168 Benchmark]: Boogie Preprocessor took 60.97 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-12 21:16:38,642 INFO L168 Benchmark]: RCFGBuilder took 786.56 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-12 21:16:38,643 INFO L168 Benchmark]: TraceAbstraction took 8157.38 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 38.3 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -9.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2018-10-12 21:16:38,647 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.15 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 60.97 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 786.56 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 8157.38 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 38.3 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -9.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 155]: 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, 90 locations, 1 error locations. SAFE Result, 8.0s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 870 SDtfs, 685 SDslu, 3949 SDs, 0 SdLazy, 642 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred 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.4s InterpolantComputationTime, 1100 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1089 ConstructedInterpolants, 0 QuantifiedInterpolants, 254565 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_true-valid-memsafety_true-termination.i_9.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-12_21-16-38-658.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_9.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-12_21-16-38-658.csv Received shutdown request...