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/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:21:29,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:21:29,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:21:29,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:21:29,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:21:29,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:21:29,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:21:29,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:21:29,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:21:29,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:21:30,001 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:21:30,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:21:30,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:21:30,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:21:30,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:21:30,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:21:30,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:21:30,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:21:30,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:21:30,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:21:30,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:21:30,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:21:30,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:21:30,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:21:30,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:21:30,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:21:30,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:21:30,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:21:30,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:21:30,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:21:30,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:21:30,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:21:30,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:21:30,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:21:30,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:21:30,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:21:30,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:21:30,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:21:30,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:21:30,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:21:30,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:21:30,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:21:30,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:21:30,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:21:30,087 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:21:30,088 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:21:30,090 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl [2019-08-04 21:21:30,090 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2019-08-04 21:21:30,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:21:30,141 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:21:30,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:30,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:21:30,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:21:30,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (1/1) ... [2019-08-04 21:21:30,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (1/1) ... [2019-08-04 21:21:30,176 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:21:30,176 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:21:30,176 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:21:30,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:30,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:21:30,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:21:30,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:21:30,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (1/1) ... [2019-08-04 21:21:30,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (1/1) ... [2019-08-04 21:21:30,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (1/1) ... [2019-08-04 21:21:30,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (1/1) ... [2019-08-04 21:21:30,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (1/1) ... [2019-08-04 21:21:30,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (1/1) ... [2019-08-04 21:21:30,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (1/1) ... [2019-08-04 21:21:30,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:21:30,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:21:30,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:21:30,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:21:30,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (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-04 21:21:30,278 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2019-08-04 21:21:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure product [2019-08-04 21:21:30,278 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2019-08-04 21:21:30,850 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint productFINAL: assume true; [2019-08-04 21:21:30,954 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:21:30,955 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:21:30,957 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:30 BoogieIcfgContainer [2019-08-04 21:21:30,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:21:30,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:21:30,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:21:30,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:21:30,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:30" (1/2) ... [2019-08-04 21:21:30,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d949de7 and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:21:30, skipping insertion in model container [2019-08-04 21:21:30,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:30" (2/2) ... [2019-08-04 21:21:30,969 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2019-08-04 21:21:30,978 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:21:30,984 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-08-04 21:21:30,999 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-08-04 21:21:31,025 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:21:31,026 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:21:31,026 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:21:31,026 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:21:31,026 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:21:31,026 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:21:31,027 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:21:31,027 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:21:31,027 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:21:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-08-04 21:21:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:21:31,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:31,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:21:31,054 INFO L418 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:31,060 INFO L82 PathProgramCache]: Analyzing trace with hash 934210, now seen corresponding path program 1 times [2019-08-04 21:21:31,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:31,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:31,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:31,319 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-04 21:21:31,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:31,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:21:31,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:21:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:21:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:31,345 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2019-08-04 21:21:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:32,139 INFO L93 Difference]: Finished difference Result 28 states and 65 transitions. [2019-08-04 21:21:32,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:21:32,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-04 21:21:32,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:32,153 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:21:32,154 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:21:32,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:32,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:21:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-08-04 21:21:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:21:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2019-08-04 21:21:32,194 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 48 transitions. Word has length 4 [2019-08-04 21:21:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:32,194 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 48 transitions. [2019-08-04 21:21:32,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:21:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 48 transitions. [2019-08-04 21:21:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:21:32,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:32,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:21:32,196 INFO L418 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:32,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:32,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1042904, now seen corresponding path program 1 times [2019-08-04 21:21:32,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:32,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:32,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:32,317 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-04 21:21:32,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:32,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:21:32,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:21:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:21:32,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:32,320 INFO L87 Difference]: Start difference. First operand 22 states and 48 transitions. Second operand 5 states. [2019-08-04 21:21:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:32,873 INFO L93 Difference]: Finished difference Result 34 states and 82 transitions. [2019-08-04 21:21:32,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:21:32,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-04 21:21:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:32,876 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:21:32,879 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:21:32,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:21:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-08-04 21:21:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:21:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 77 transitions. [2019-08-04 21:21:32,894 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 77 transitions. Word has length 4 [2019-08-04 21:21:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:32,894 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 77 transitions. [2019-08-04 21:21:32,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:21:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 77 transitions. [2019-08-04 21:21:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:21:32,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:32,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:21:32,898 INFO L418 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash 897576008, now seen corresponding path program 1 times [2019-08-04 21:21:32,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:32,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:32,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:33,092 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-04 21:21:33,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:33,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:21:33,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:33,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:33,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:33,094 INFO L87 Difference]: Start difference. First operand 32 states and 77 transitions. Second operand 6 states. [2019-08-04 21:21:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:34,391 INFO L93 Difference]: Finished difference Result 126 states and 313 transitions. [2019-08-04 21:21:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:34,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:21:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:34,395 INFO L225 Difference]: With dead ends: 126 [2019-08-04 21:21:34,395 INFO L226 Difference]: Without dead ends: 126 [2019-08-04 21:21:34,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:21:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-04 21:21:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 60. [2019-08-04 21:21:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:21:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 173 transitions. [2019-08-04 21:21:34,411 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 173 transitions. Word has length 6 [2019-08-04 21:21:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:34,412 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 173 transitions. [2019-08-04 21:21:34,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 173 transitions. [2019-08-04 21:21:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:21:34,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:34,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:21:34,414 INFO L418 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash 897578922, now seen corresponding path program 1 times [2019-08-04 21:21:34,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:34,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:34,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:34,506 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-04 21:21:34,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:34,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:21:34,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:34,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:34,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:34,508 INFO L87 Difference]: Start difference. First operand 60 states and 173 transitions. Second operand 6 states. [2019-08-04 21:21:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:35,057 INFO L93 Difference]: Finished difference Result 124 states and 328 transitions. [2019-08-04 21:21:35,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:21:35,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:21:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:35,059 INFO L225 Difference]: With dead ends: 124 [2019-08-04 21:21:35,060 INFO L226 Difference]: Without dead ends: 124 [2019-08-04 21:21:35,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:21:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-04 21:21:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 63. [2019-08-04 21:21:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:21:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 183 transitions. [2019-08-04 21:21:35,072 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 183 transitions. Word has length 6 [2019-08-04 21:21:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:35,072 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 183 transitions. [2019-08-04 21:21:35,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 183 transitions. [2019-08-04 21:21:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:21:35,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:35,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:21:35,074 INFO L418 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:35,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:35,075 INFO L82 PathProgramCache]: Analyzing trace with hash 897783584, now seen corresponding path program 1 times [2019-08-04 21:21:35,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:35,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:35,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:35,178 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-04 21:21:35,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:35,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:21:35,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:35,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:35,180 INFO L87 Difference]: Start difference. First operand 63 states and 183 transitions. Second operand 6 states. [2019-08-04 21:21:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:35,469 INFO L93 Difference]: Finished difference Result 94 states and 259 transitions. [2019-08-04 21:21:35,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:21:35,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:21:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:35,477 INFO L225 Difference]: With dead ends: 94 [2019-08-04 21:21:35,477 INFO L226 Difference]: Without dead ends: 94 [2019-08-04 21:21:35,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:21:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-04 21:21:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 38. [2019-08-04 21:21:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:21:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 99 transitions. [2019-08-04 21:21:35,493 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 99 transitions. Word has length 6 [2019-08-04 21:21:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:35,493 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 99 transitions. [2019-08-04 21:21:35,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 99 transitions. [2019-08-04 21:21:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:21:35,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:35,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:21:35,495 INFO L418 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:35,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1002208758, now seen corresponding path program 1 times [2019-08-04 21:21:35,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:35,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:35,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:35,574 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-04 21:21:35,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:35,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:21:35,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:35,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:35,576 INFO L87 Difference]: Start difference. First operand 38 states and 99 transitions. Second operand 6 states. [2019-08-04 21:21:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:35,939 INFO L93 Difference]: Finished difference Result 77 states and 207 transitions. [2019-08-04 21:21:35,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:21:35,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:21:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:35,941 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:21:35,942 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:21:35,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:21:35,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:21:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 36. [2019-08-04 21:21:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:21:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 93 transitions. [2019-08-04 21:21:35,948 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 93 transitions. Word has length 6 [2019-08-04 21:21:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:35,948 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 93 transitions. [2019-08-04 21:21:35,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 93 transitions. [2019-08-04 21:21:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:21:35,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:35,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:21:35,950 INFO L418 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1000027257, now seen corresponding path program 1 times [2019-08-04 21:21:35,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:35,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:35,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:36,047 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-04 21:21:36,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:36,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:21:36,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:36,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:36,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:36,048 INFO L87 Difference]: Start difference. First operand 36 states and 93 transitions. Second operand 6 states. [2019-08-04 21:21:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:36,474 INFO L93 Difference]: Finished difference Result 75 states and 196 transitions. [2019-08-04 21:21:36,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:21:36,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:21:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:36,478 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:21:36,478 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:21:36,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:21:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:21:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 35. [2019-08-04 21:21:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:21:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2019-08-04 21:21:36,485 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 87 transitions. Word has length 6 [2019-08-04 21:21:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:36,486 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 87 transitions. [2019-08-04 21:21:36,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 87 transitions. [2019-08-04 21:21:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:21:36,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:36,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:21:36,487 INFO L418 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:36,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1000030171, now seen corresponding path program 1 times [2019-08-04 21:21:36,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:36,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:36,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:36,558 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-04 21:21:36,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:36,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:21:36,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:36,560 INFO L87 Difference]: Start difference. First operand 35 states and 87 transitions. Second operand 6 states. [2019-08-04 21:21:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:37,021 INFO L93 Difference]: Finished difference Result 62 states and 167 transitions. [2019-08-04 21:21:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:37,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:21:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:37,023 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:21:37,023 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:21:37,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:21:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:21:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:21:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:21:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:21:37,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-08-04 21:21:37,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:37,025 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:21:37,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:21:37,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:21:37,031 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:21:37 BoogieIcfgContainer [2019-08-04 21:21:37,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:21:37,034 INFO L168 Benchmark]: Toolchain (without parser) took 6892.35 ms. Allocated memory was 132.6 MB in the beginning and 239.1 MB in the end (delta: 106.4 MB). Free memory was 110.0 MB in the beginning and 102.6 MB in the end (delta: 7.5 MB). Peak memory consumption was 113.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:21:37,035 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 132.6 MB. Free memory was 111.5 MB in the beginning and 111.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:21:37,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.96 ms. Allocated memory is still 132.6 MB. Free memory was 110.0 MB in the beginning and 108.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:21:37,037 INFO L168 Benchmark]: Boogie Preprocessor took 25.74 ms. Allocated memory is still 132.6 MB. Free memory was 108.1 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:21:37,038 INFO L168 Benchmark]: RCFGBuilder took 751.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 91.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:21:37,039 INFO L168 Benchmark]: TraceAbstraction took 6072.77 ms. Allocated memory was 132.6 MB in the beginning and 239.1 MB in the end (delta: 106.4 MB). Free memory was 90.9 MB in the beginning and 102.6 MB in the end (delta: -11.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:21:37,043 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.26 ms. Allocated memory is still 132.6 MB. Free memory was 111.5 MB in the beginning and 111.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.96 ms. Allocated memory is still 132.6 MB. Free memory was 110.0 MB in the beginning and 108.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.74 ms. Allocated memory is still 132.6 MB. Free memory was 108.1 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 751.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 91.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6072.77 ms. Allocated memory was 132.6 MB in the beginning and 239.1 MB in the end (delta: 106.4 MB). Free memory was 90.9 MB in the beginning and 102.6 MB in the end (delta: -11.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 181]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 82]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 176]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 186]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 6 error locations. SAFE Result, 6.0s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 123 SDtfs, 590 SDslu, 129 SDs, 0 SdLazy, 1602 SolverSat, 371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=4, 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, 8 MinimizatonAttempts, 272 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 672 SizeOfPredicates, 28 NumberOfNonLiveVariables, 226 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...