java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/regression/bpl/TestParallelComposition.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:08:07,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:08:07,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:08:07,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:08:07,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:08:07,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:08:07,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:08:07,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:08:07,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:08:07,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:08:07,226 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:08:07,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:08:07,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:08:07,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:08:07,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:08:07,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:08:07,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:08:07,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:08:07,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:08:07,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:08:07,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:08:07,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:08:07,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:08:07,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:08:07,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:08:07,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:08:07,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:08:07,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:08:07,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:08:07,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:08:07,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:08:07,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:08:07,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:08:07,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:08:07,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:08:07,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:08:07,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:08:07,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:08:07,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:08:07,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:08:07,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:08:07,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:08:07,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:08:07,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:08:07,316 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:08:07,316 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:08:07,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/TestParallelComposition.bpl [2019-08-05 11:08:07,317 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/TestParallelComposition.bpl' [2019-08-05 11:08:07,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:08:07,368 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:08:07,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:08:07,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:08:07,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:08:07,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (1/1) ... [2019-08-05 11:08:07,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (1/1) ... [2019-08-05 11:08:07,400 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:08:07,400 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:08:07,400 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:08:07,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:08:07,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:08:07,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:08:07,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:08:07,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (1/1) ... [2019-08-05 11:08:07,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (1/1) ... [2019-08-05 11:08:07,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (1/1) ... [2019-08-05 11:08:07,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (1/1) ... [2019-08-05 11:08:07,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (1/1) ... [2019-08-05 11:08:07,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (1/1) ... [2019-08-05 11:08:07,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (1/1) ... [2019-08-05 11:08:07,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:08:07,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:08:07,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:08:07,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:08:07,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (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 [2019-08-05 11:08:07,496 INFO L124 BoogieDeclarations]: Specification and implementation of procedure proc given in one single declaration [2019-08-05 11:08:07,496 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-08-05 11:08:07,497 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-08-05 11:08:08,354 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:08:08,355 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-08-05 11:08:08,356 INFO L202 PluginConnector]: Adding new model TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:08:08 BoogieIcfgContainer [2019-08-05 11:08:08,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:08:08,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:08:08,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:08:08,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:08:08,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:07" (1/2) ... [2019-08-05 11:08:08,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c61248e and model type TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:08:08, skipping insertion in model container [2019-08-05 11:08:08,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:08:08" (2/2) ... [2019-08-05 11:08:08,365 INFO L109 eAbstractionObserver]: Analyzing ICFG TestParallelComposition.bpl [2019-08-05 11:08:08,375 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:08:08,383 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-08-05 11:08:08,400 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-08-05 11:08:08,422 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:08:08,423 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:08:08,423 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:08:08,424 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:08:08,424 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:08:08,424 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:08:08,424 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:08:08,424 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:08:08,425 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:08:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-08-05 11:08:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:08:08,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:08,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:08:08,452 INFO L418 AbstractCegarLoop]: === Iteration 1 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash 4159, now seen corresponding path program 1 times [2019-08-05 11:08:08,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:08,535 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:08,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:08,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:08,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:08:08,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:08,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:08,620 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-08-05 11:08:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:08,826 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-08-05 11:08:08,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:08,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:08:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:08,839 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:08:08,840 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:08:08,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:08:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:08:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:08:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2019-08-05 11:08:08,896 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 2 [2019-08-05 11:08:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:08,896 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2019-08-05 11:08:08,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2019-08-05 11:08:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:08:08,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:08,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:08:08,898 INFO L418 AbstractCegarLoop]: === Iteration 2 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:08,899 INFO L82 PathProgramCache]: Analyzing trace with hash 131917, now seen corresponding path program 1 times [2019-08-05 11:08:08,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:08,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:08,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:08,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:08,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:08,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:08,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:08,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:08,983 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand 3 states. [2019-08-05 11:08:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:09,110 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2019-08-05 11:08:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:09,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:08:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:09,111 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:08:09,111 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:08:09,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:08:09,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:08:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:08:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2019-08-05 11:08:09,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 3 [2019-08-05 11:08:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:09,117 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2019-08-05 11:08:09,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2019-08-05 11:08:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:08:09,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:09,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:08:09,118 INFO L418 AbstractCegarLoop]: === Iteration 3 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash 4092143, now seen corresponding path program 1 times [2019-08-05 11:08:09,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:09,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:09,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:09,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:09,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:09,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:09,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:09,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,184 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 3 states. [2019-08-05 11:08:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:09,304 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2019-08-05 11:08:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:09,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:08:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:09,306 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:08:09,306 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:08:09,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:08:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:08:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:08:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2019-08-05 11:08:09,310 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 4 [2019-08-05 11:08:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:09,311 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2019-08-05 11:08:09,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2019-08-05 11:08:09,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:08:09,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:09,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:08:09,312 INFO L418 AbstractCegarLoop]: === Iteration 4 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:09,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:09,312 INFO L82 PathProgramCache]: Analyzing trace with hash 126858815, now seen corresponding path program 1 times [2019-08-05 11:08:09,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:09,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:09,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:09,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:09,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:09,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:09,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:09,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,361 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand 3 states. [2019-08-05 11:08:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:09,523 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2019-08-05 11:08:09,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:09,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:08:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:09,524 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:08:09,525 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:08:09,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:08:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:08:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:08:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2019-08-05 11:08:09,529 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 5 [2019-08-05 11:08:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:09,529 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2019-08-05 11:08:09,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2019-08-05 11:08:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:08:09,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:09,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:08:09,531 INFO L418 AbstractCegarLoop]: === Iteration 5 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash -362341796, now seen corresponding path program 1 times [2019-08-05 11:08:09,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:09,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:09,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:09,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:09,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:09,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:09,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:09,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,584 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 3 states. [2019-08-05 11:08:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:09,648 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2019-08-05 11:08:09,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:09,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 11:08:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:09,650 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:08:09,651 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:08:09,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:08:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:08:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:08:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2019-08-05 11:08:09,655 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 6 [2019-08-05 11:08:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:09,655 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2019-08-05 11:08:09,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2019-08-05 11:08:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:08:09,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:09,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:09,656 INFO L418 AbstractCegarLoop]: === Iteration 6 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1652308083, now seen corresponding path program 1 times [2019-08-05 11:08:09,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:09,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:09,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:09,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:09,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:09,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:09,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:09,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,719 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand 3 states. [2019-08-05 11:08:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:09,803 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2019-08-05 11:08:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:09,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 11:08:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:09,804 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:08:09,804 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:08:09,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:08:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:08:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:08:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2019-08-05 11:08:09,807 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 7 [2019-08-05 11:08:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:09,807 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2019-08-05 11:08:09,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2019-08-05 11:08:09,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:08:09,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:09,808 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:09,809 INFO L418 AbstractCegarLoop]: === Iteration 7 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:09,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:09,809 INFO L82 PathProgramCache]: Analyzing trace with hash -318055410, now seen corresponding path program 1 times [2019-08-05 11:08:09,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:09,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:09,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:09,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:09,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:09,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:09,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,886 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand 3 states. [2019-08-05 11:08:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:09,938 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2019-08-05 11:08:09,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:09,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:08:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:09,941 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:08:09,941 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:08:09,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:08:09,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:08:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:08:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2019-08-05 11:08:09,944 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 8 [2019-08-05 11:08:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:09,944 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2019-08-05 11:08:09,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2019-08-05 11:08:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:08:09,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:09,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:09,945 INFO L418 AbstractCegarLoop]: === Iteration 8 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:09,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1269781851, now seen corresponding path program 1 times [2019-08-05 11:08:09,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:09,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:09,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:09,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:09,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:09,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:09,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:09,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:09,993 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 3 states. [2019-08-05 11:08:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:10,149 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2019-08-05 11:08:10,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:10,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-08-05 11:08:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:10,150 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:08:10,150 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:08:10,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:08:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:08:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:08:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2019-08-05 11:08:10,153 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 9 [2019-08-05 11:08:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:10,154 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2019-08-05 11:08:10,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2019-08-05 11:08:10,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:08:10,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:10,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:10,155 INFO L418 AbstractCegarLoop]: === Iteration 9 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash -708530132, now seen corresponding path program 1 times [2019-08-05 11:08:10,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:10,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:10,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:10,306 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:08:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:10,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:10,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:10,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:10,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:10,309 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 3 states. [2019-08-05 11:08:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:10,373 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-08-05 11:08:10,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:10,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 11:08:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:10,374 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:08:10,374 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:08:10,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:08:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:08:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:08:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2019-08-05 11:08:10,377 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 10 [2019-08-05 11:08:10,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:10,377 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2019-08-05 11:08:10,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2019-08-05 11:08:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:08:10,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:10,378 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:10,378 INFO L418 AbstractCegarLoop]: === Iteration 10 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:10,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:10,379 INFO L82 PathProgramCache]: Analyzing trace with hash -489596329, now seen corresponding path program 1 times [2019-08-05 11:08:10,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:10,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:10,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:10,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:10,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:10,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:10,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:10,422 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 3 states. [2019-08-05 11:08:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:10,444 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2019-08-05 11:08:10,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:10,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-08-05 11:08:10,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:10,445 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:08:10,445 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:08:10,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:08:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:08:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:08:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2019-08-05 11:08:10,449 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 11 [2019-08-05 11:08:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:10,449 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2019-08-05 11:08:10,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2019-08-05 11:08:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:08:10,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:10,450 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:10,451 INFO L418 AbstractCegarLoop]: === Iteration 11 === [procErr3ASSERT_VIOLATIONASSERT, procErr0ASSERT_VIOLATIONASSERT, procErr10ASSERT_VIOLATIONASSERT, procErr7ASSERT_VIOLATIONASSERT, procErr9ASSERT_VIOLATIONASSERT, procErr2ASSERT_VIOLATIONASSERT, procErr1ASSERT_VIOLATIONASSERT, procErr8ASSERT_VIOLATIONASSERT, procErr6ASSERT_VIOLATIONASSERT, procErr4ASSERT_VIOLATIONASSERT, procErr5ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2002383470, now seen corresponding path program 1 times [2019-08-05 11:08:10,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:10,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:10,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:10,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:10,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:10,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:10,517 INFO L87 Difference]: Start difference. First operand 13 states and 12 transitions. Second operand 3 states. [2019-08-05 11:08:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:10,534 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2019-08-05 11:08:10,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:10,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 11:08:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:10,535 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:08:10,536 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:08:10,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:08:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:08:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:08:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:08:10,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-08-05 11:08:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:10,538 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:08:10,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:08:10,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:08:10,543 INFO L202 PluginConnector]: Adding new model TestParallelComposition.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:08:10 BoogieIcfgContainer [2019-08-05 11:08:10,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:08:10,546 INFO L168 Benchmark]: Toolchain (without parser) took 3176.87 ms. Allocated memory was 140.5 MB in the beginning and 176.7 MB in the end (delta: 36.2 MB). Free memory was 107.7 MB in the beginning and 72.1 MB in the end (delta: 35.6 MB). Peak memory consumption was 71.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:10,547 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 109.0 MB in the beginning and 108.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:08:10,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.65 ms. Allocated memory is still 140.5 MB. Free memory was 107.5 MB in the beginning and 105.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:10,549 INFO L168 Benchmark]: Boogie Preprocessor took 24.98 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 104.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:10,550 INFO L168 Benchmark]: RCFGBuilder took 928.02 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 81.6 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:10,551 INFO L168 Benchmark]: TraceAbstraction took 2186.36 ms. Allocated memory was 140.5 MB in the beginning and 176.7 MB in the end (delta: 36.2 MB). Free memory was 81.4 MB in the beginning and 72.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:10,556 INFO L335 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.22 ms. Allocated memory is still 140.5 MB. Free memory was 109.0 MB in the beginning and 108.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.65 ms. Allocated memory is still 140.5 MB. Free memory was 107.5 MB in the beginning and 105.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.98 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 104.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 928.02 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 81.6 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2186.36 ms. Allocated memory was 140.5 MB in the beginning and 176.7 MB in the end (delta: 36.2 MB). Free memory was 81.4 MB in the beginning and 72.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 58]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 28]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 131]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 99]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 119]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 109]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 89]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 69]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 79]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 11 error locations. SAFE Result, 2.1s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 148 SDtfs, 6 SDslu, 0 SDs, 0 SdLazy, 176 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 1166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 353 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...