java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:53:57,919 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:53:57,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:53:57,935 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:53:57,935 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:53:57,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:53:57,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:53:57,939 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:53:57,941 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:53:57,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:53:57,942 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:53:57,943 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:53:57,943 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:53:57,944 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:53:57,946 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:53:57,946 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:53:57,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:53:57,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:53:57,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:53:57,952 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:53:57,953 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:53:57,955 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:53:57,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:53:57,957 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:53:57,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:53:57,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:53:57,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:53:57,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:53:57,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:53:57,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:53:57,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:53:57,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:53:57,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:53:57,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:53:57,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:53:57,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:53:57,966 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:53:57,995 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:53:57,996 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:53:57,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:53:57,997 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:53:57,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:53:57,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:53:57,998 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:53:57,998 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:53:58,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:53:58,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:53:58,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:53:58,083 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:53:58,084 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:53:58,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-07-25 08:53:58,085 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-07-25 08:53:58,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:53:58,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:53:58,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:53:58,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:53:58,144 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:53:58,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/1) ... [2018-07-25 08:53:58,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/1) ... [2018-07-25 08:53:58,187 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:53:58,188 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:53:58,188 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:53:58,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:53:58,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:53:58,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:53:58,192 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:53:58,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/1) ... [2018-07-25 08:53:58,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/1) ... [2018-07-25 08:53:58,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/1) ... [2018-07-25 08:53:58,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/1) ... [2018-07-25 08:53:58,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/1) ... [2018-07-25 08:53:58,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/1) ... [2018-07-25 08:53:58,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/1) ... [2018-07-25 08:53:58,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:53:58,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:53:58,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:53:58,221 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:53:58,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/1) ... [2018-07-25 08:53:58,315 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 08:53:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 08:53:58,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 08:53:58,503 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:53:58,504 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:53:58 BoogieIcfgContainer [2018-07-25 08:53:58,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:53:58,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:53:58,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:53:58,510 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:53:58,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:53:58" (1/2) ... [2018-07-25 08:53:58,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ed7b59 and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:53:58, skipping insertion in model container [2018-07-25 08:53:58,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:53:58" (2/2) ... [2018-07-25 08:53:58,515 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-07-25 08:53:58,525 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:53:58,532 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:53:58,572 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:53:58,573 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:53:58,573 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:53:58,573 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:53:58,574 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:53:58,574 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:53:58,574 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:53:58,574 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:53:58,575 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:53:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 08:53:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 08:53:58,597 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:58,598 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 08:53:58,599 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash 30240, now seen corresponding path program 1 times [2018-07-25 08:53:58,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:58,673 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:53:58,673 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:53:58,678 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:53:58,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:53:58,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:53:58,693 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 08:53:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:58,723 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-07-25 08:53:58,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:53:58,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 08:53:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:58,735 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:53:58,736 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 08:53:58,739 INFO L574 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 [2018-07-25 08:53:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 08:53:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 08:53:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 08:53:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 08:53:58,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 08:53:58,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:58,777 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 08:53:58,777 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:53:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 08:53:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:53:58,778 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:58,778 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:53:58,778 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:58,779 INFO L82 PathProgramCache]: Analyzing trace with hash 945112, now seen corresponding path program 1 times [2018-07-25 08:53:58,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:58,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:58,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:53:58,807 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:53:58,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:53:58,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:53:58,808 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 08:53:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:58,823 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 08:53:58,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:53:58,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 08:53:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:58,824 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:53:58,824 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 08:53:58,825 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:53:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 08:53:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 08:53:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 08:53:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 08:53:58,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 08:53:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:58,829 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 08:53:58,829 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:53:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 08:53:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:53:58,830 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:58,830 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 08:53:58,830 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:58,830 INFO L82 PathProgramCache]: Analyzing trace with hash 29306144, now seen corresponding path program 2 times [2018-07-25 08:53:58,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:58,887 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:58,887 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:53:58,888 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:53:58,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:53:58,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:53:58,889 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 08:53:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:58,905 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 08:53:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:53:58,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 08:53:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:58,909 INFO L225 Difference]: With dead ends: 9 [2018-07-25 08:53:58,910 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:53:58,910 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:53:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:53:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:53:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:53:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:53:58,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 08:53:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:58,914 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:53:58,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:53:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:53:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:53:58,915 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:58,915 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 08:53:58,915 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash 908498136, now seen corresponding path program 3 times [2018-07-25 08:53:58,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:59,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:59,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:53:59,011 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:53:59,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:53:59,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:53:59,012 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 08:53:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:59,030 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 08:53:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:53:59,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:53:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:59,032 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:53:59,032 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 08:53:59,034 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:53:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 08:53:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 08:53:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 08:53:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 08:53:59,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 08:53:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:59,037 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 08:53:59,037 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:53:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 08:53:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:53:59,038 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:59,038 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 08:53:59,038 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:59,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1901321184, now seen corresponding path program 4 times [2018-07-25 08:53:59,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:59,122 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:59,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:53:59,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:53:59,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:53:59,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:53:59,124 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 08:53:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:59,136 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:53:59,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:53:59,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 08:53:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:59,137 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:53:59,137 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:53:59,138 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:53:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:53:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:53:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:53:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:53:59,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 08:53:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:59,141 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:53:59,142 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:53:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:53:59,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:53:59,142 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:59,142 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 08:53:59,143 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:59,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1188593112, now seen corresponding path program 5 times [2018-07-25 08:53:59,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:59,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:59,367 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:53:59,367 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:53:59,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:53:59,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:53:59,368 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 08:53:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:59,380 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 08:53:59,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:53:59,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:53:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:59,381 INFO L225 Difference]: With dead ends: 12 [2018-07-25 08:53:59,381 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 08:53:59,382 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:53:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 08:53:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 08:53:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 08:53:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 08:53:59,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 08:53:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:59,386 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 08:53:59,386 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:53:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 08:53:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:53:59,387 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:59,387 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 08:53:59,387 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:59,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1808311520, now seen corresponding path program 6 times [2018-07-25 08:53:59,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:59,686 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:59,686 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:53:59,687 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:53:59,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:53:59,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:53:59,688 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 08:53:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:59,699 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:53:59,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:53:59,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 08:53:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:59,702 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:53:59,702 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:53:59,703 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:53:59,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:53:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:53:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:53:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:53:59,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 08:53:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:59,709 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:53:59,709 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:53:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:53:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:53:59,710 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:59,713 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 08:53:59,713 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash -223074600, now seen corresponding path program 7 times [2018-07-25 08:53:59,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:00,220 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:00,220 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:54:00,221 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:54:00,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:54:00,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:54:00,222 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 08:54:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:00,239 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 08:54:00,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:54:00,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 08:54:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:00,243 INFO L225 Difference]: With dead ends: 14 [2018-07-25 08:54:00,243 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 08:54:00,244 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:54:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 08:54:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 08:54:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 08:54:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 08:54:00,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 08:54:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:00,252 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 08:54:00,253 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:54:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 08:54:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:54:00,253 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:00,254 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 08:54:00,254 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1674629664, now seen corresponding path program 8 times [2018-07-25 08:54:00,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:01,183 WARN L169 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 3 [2018-07-25 08:54:01,524 WARN L169 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 3 [2018-07-25 08:54:01,869 WARN L169 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 3 [2018-07-25 08:54:02,161 WARN L169 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 3 [2018-07-25 08:54:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:02,171 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:02,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:54:02,172 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:54:02,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:54:02,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:54:02,175 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 08:54:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:02,192 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:54:02,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:54:02,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 08:54:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:02,193 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:54:02,193 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:54:02,193 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:54:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:54:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:54:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:54:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:54:02,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 08:54:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:02,197 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:54:02,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:54:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:54:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:54:02,198 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:02,199 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 08:54:02,199 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash 373919704, now seen corresponding path program 9 times [2018-07-25 08:54:02,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:04,283 WARN L169 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 300 DAG size of output: 3 [2018-07-25 08:54:05,446 WARN L169 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 339 DAG size of output: 3 [2018-07-25 08:54:06,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:54:06,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:54:06,137 WARN L169 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 3 [2018-07-25 08:54:06,960 WARN L169 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 3 [2018-07-25 08:54:07,359 WARN L169 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 3 [2018-07-25 08:54:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:07,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:07,366 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:54:07,367 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:54:07,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:54:07,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:54:07,368 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 08:54:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:07,376 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 08:54:07,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:54:07,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 08:54:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:07,378 INFO L225 Difference]: With dead ends: 16 [2018-07-25 08:54:07,378 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 08:54:07,378 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:54:07,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 08:54:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 08:54:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 08:54:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 08:54:07,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 08:54:07,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:07,382 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 08:54:07,382 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:54:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 08:54:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:54:07,383 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:07,383 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 08:54:07,384 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1293383392, now seen corresponding path program 10 times [2018-07-25 08:54:07,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:08,405 WARN L169 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 3 [2018-07-25 08:54:12,966 WARN L169 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 588 DAG size of output: 3 [2018-07-25 08:54:17,346 WARN L169 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 675 DAG size of output: 3 [2018-07-25 08:54:18,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:54:18,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:54:18,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:54:19,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:54:20,411 WARN L169 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 729 DAG size of output: 3 [2018-07-25 08:54:22,982 WARN L169 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 715 DAG size of output: 3 [2018-07-25 08:54:25,028 WARN L169 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 735 DAG size of output: 3 [2018-07-25 08:54:25,891 WARN L169 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 3 [2018-07-25 08:54:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:25,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:25,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:54:25,898 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:54:25,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:54:25,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:54:25,899 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 08:54:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:25,906 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:54:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:54:25,907 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 08:54:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:25,909 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:54:25,909 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:54:25,910 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:54:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:54:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:54:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:54:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:54:25,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 08:54:25,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:25,916 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:54:25,916 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:54:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:54:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:54:25,918 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:25,918 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 08:54:25,918 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:25,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1440171816, now seen corresponding path program 11 times [2018-07-25 08:54:25,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:28,692 WARN L169 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 521 DAG size of output: 3 [2018-07-25 08:55:05,323 WARN L169 SmtUtils]: Spent 33.86 s on a formula simplification. DAG size of input: 1164 DAG size of output: 3 [2018-07-25 08:55:20,883 WARN L169 SmtUtils]: Spent 14.03 s on a formula simplification. DAG size of input: 1347 DAG size of output: 3 [2018-07-25 08:55:35,834 WARN L169 SmtUtils]: Spent 13.89 s on a formula simplification. DAG size of input: 1481 DAG size of output: 3 [2018-07-25 08:55:47,006 WARN L169 SmtUtils]: Spent 10.22 s on a formula simplification. DAG size of input: 1507 DAG size of output: 3 [2018-07-25 08:55:49,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:55:55,178 WARN L169 SmtUtils]: Spent 7.34 s on a formula simplification. DAG size of input: 1666 DAG size of output: 3 [2018-07-25 08:55:55,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:56:00,863 WARN L169 SmtUtils]: Spent 5.10 s on a formula simplification. DAG size of input: 1235 DAG size of output: 3 [2018-07-25 08:56:03,547 WARN L169 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 796 DAG size of output: 3 [2018-07-25 08:56:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:03,552 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:03,552 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:56:03,553 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:56:03,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:56:03,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:56:03,554 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 08:56:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:03,562 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 08:56:03,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:56:03,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 08:56:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:03,563 INFO L225 Difference]: With dead ends: 18 [2018-07-25 08:56:03,563 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 08:56:03,563 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.8s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:56:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 08:56:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 08:56:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 08:56:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 08:56:03,566 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 08:56:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:03,567 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 08:56:03,567 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:56:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 08:56:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:56:03,568 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:03,568 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 08:56:03,568 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:03,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1695645664, now seen corresponding path program 12 times [2018-07-25 08:56:03,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:11,288 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 1029 DAG size of output: 3 [2018-07-25 08:56:18,301 WARN L169 SmtUtils]: Spent 6.53 s on a formula simplification. DAG size of input: 1032 DAG size of output: 3 [2018-07-25 08:56:25,761 WARN L169 SmtUtils]: Spent 6.95 s on a formula simplification. DAG size of input: 1033 DAG size of output: 3 Received shutdown request... [2018-07-25 08:58:26,936 WARN L177 SmtUtils]: Removed 2 from assertion stack [2018-07-25 08:58:26,936 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:58:26,940 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:58:26,941 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:58:26 BoogieIcfgContainer [2018-07-25 08:58:26,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:58:26,942 INFO L168 Benchmark]: Toolchain (without parser) took 268800.37 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-07-25 08:58:26,943 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:58:26,943 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:58:26,944 INFO L168 Benchmark]: Boogie Preprocessor took 29.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:58:26,945 INFO L168 Benchmark]: RCFGBuilder took 283.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:58:26,945 INFO L168 Benchmark]: TraceAbstraction took 268435.53 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-07-25 08:58:26,950 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 283.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 268435.53 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 16 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 2316. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 268.3s OverallTime, 13 OverallIterations, 12 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 2 SDslu, 60 SDs, 0 SdLazy, 150 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 114.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=12, 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, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 124.1s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 2274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 0/286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-58-26-962.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-58-26-962.csv Completed graceful shutdown