java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:14:45,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:14:45,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:14:45,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:14:45,097 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:14:45,098 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:14:45,099 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:14:45,103 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:14:45,104 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:14:45,106 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:14:45,107 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:14:45,107 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:14:45,108 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:14:45,109 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:14:45,110 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:14:45,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:14:45,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:14:45,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:14:45,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:14:45,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:14:45,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:14:45,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:14:45,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:14:45,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:14:45,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:14:45,135 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:14:45,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:14:45,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:14:45,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:14:45,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:14:45,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:14:45,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:14:45,143 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:14:45,149 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:14:45,149 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:14:45,150 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:14:45,176 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:14:45,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:14:45,177 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:14:45,177 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:14:45,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:14:45,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:14:45,180 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:14:45,180 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:14:45,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:14:45,180 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:14:45,181 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:14:45,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:14:45,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:14:45,181 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:14:45,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:14:45,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:14:45,182 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:14:45,183 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:14:45,184 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:14:45,227 INFO ]: Repository-Root is: /tmp [2018-06-22 01:14:45,244 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:14:45,249 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:14:45,250 INFO ]: Initializing SmtParser... [2018-06-22 01:14:45,250 INFO ]: SmtParser initialized [2018-06-22 01:14:45,251 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 [2018-06-22 01:14:45,252 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:14:45,339 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 unknown [2018-06-22 01:14:45,609 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 [2018-06-22 01:14:45,613 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:14:45,619 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:14:45,619 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:14:45,619 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:14:45,620 INFO ]: ChcToBoogie initialized [2018-06-22 01:14:45,622 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:14:45" (1/1) ... [2018-06-22 01:14:45,682 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:45 Unit [2018-06-22 01:14:45,683 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:14:45,683 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:14:45,683 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:14:45,683 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:14:45,704 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:45" (1/1) ... [2018-06-22 01:14:45,704 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:45" (1/1) ... [2018-06-22 01:14:45,711 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:45" (1/1) ... [2018-06-22 01:14:45,711 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:45" (1/1) ... [2018-06-22 01:14:45,723 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:45" (1/1) ... [2018-06-22 01:14:45,725 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:45" (1/1) ... [2018-06-22 01:14:45,726 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:45" (1/1) ... [2018-06-22 01:14:45,728 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:14:45,728 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:14:45,728 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:14:45,728 INFO ]: RCFGBuilder initialized [2018-06-22 01:14:45,729 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:14:45,751 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:14:45,751 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:14:45,751 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:14:45,751 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:14:45,751 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:14:45,751 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:14:46,094 INFO ]: Using library mode [2018-06-22 01:14:46,095 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:14:46 BoogieIcfgContainer [2018-06-22 01:14:46,095 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:14:46,097 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:14:46,097 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:14:46,100 INFO ]: TraceAbstraction initialized [2018-06-22 01:14:46,100 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:14:45" (1/3) ... [2018-06-22 01:14:46,101 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17598e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:14:46, skipping insertion in model container [2018-06-22 01:14:46,101 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:45" (2/3) ... [2018-06-22 01:14:46,101 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17598e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:14:46, skipping insertion in model container [2018-06-22 01:14:46,101 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:14:46" (3/3) ... [2018-06-22 01:14:46,103 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:14:46,111 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:14:46,124 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:14:46,179 INFO ]: Using default assertion order modulation [2018-06-22 01:14:46,179 INFO ]: Interprodecural is true [2018-06-22 01:14:46,179 INFO ]: Hoare is false [2018-06-22 01:14:46,179 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:14:46,179 INFO ]: Backedges is TWOTRACK [2018-06-22 01:14:46,179 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:14:46,179 INFO ]: Difference is false [2018-06-22 01:14:46,179 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:14:46,179 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:14:46,197 INFO ]: Start isEmpty. Operand 16 states. [2018-06-22 01:14:46,212 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:14:46,212 INFO ]: Found error trace [2018-06-22 01:14:46,214 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:46,214 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:46,220 INFO ]: Analyzing trace with hash 741594376, now seen corresponding path program 1 times [2018-06-22 01:14:46,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:46,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:46,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:46,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:46,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:46,315 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:46,387 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:46,390 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:46,390 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:14:46,392 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:14:46,409 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:14:46,409 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:46,412 INFO ]: Start difference. First operand 16 states. Second operand 3 states. [2018-06-22 01:14:46,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:46,514 INFO ]: Finished difference Result 16 states and 25 transitions. [2018-06-22 01:14:46,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:14:46,516 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:14:46,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:46,525 INFO ]: With dead ends: 16 [2018-06-22 01:14:46,525 INFO ]: Without dead ends: 16 [2018-06-22 01:14:46,527 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:46,541 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:14:46,557 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-22 01:14:46,564 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:14:46,565 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-22 01:14:46,566 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 8 [2018-06-22 01:14:46,568 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:46,568 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-22 01:14:46,568 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:14:46,568 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-22 01:14:46,569 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:14:46,569 INFO ]: Found error trace [2018-06-22 01:14:46,569 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:46,569 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:46,569 INFO ]: Analyzing trace with hash 868116753, now seen corresponding path program 1 times [2018-06-22 01:14:46,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:46,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:46,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:46,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:46,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:46,584 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:46,629 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:46,629 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:46,629 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:14:46,631 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:14:46,631 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:14:46,631 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:46,631 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 3 states. [2018-06-22 01:14:46,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:46,682 INFO ]: Finished difference Result 21 states and 31 transitions. [2018-06-22 01:14:46,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:14:46,683 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:14:46,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:46,689 INFO ]: With dead ends: 21 [2018-06-22 01:14:46,689 INFO ]: Without dead ends: 21 [2018-06-22 01:14:46,690 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:46,690 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:14:46,694 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-06-22 01:14:46,695 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:14:46,695 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-22 01:14:46,695 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 8 [2018-06-22 01:14:46,695 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:46,695 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-22 01:14:46,695 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:14:46,696 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-22 01:14:46,697 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:14:46,697 INFO ]: Found error trace [2018-06-22 01:14:46,697 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:46,697 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:46,698 INFO ]: Analyzing trace with hash -1259700938, now seen corresponding path program 1 times [2018-06-22 01:14:46,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:46,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:46,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:46,698 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:46,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:46,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:46,796 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:46,796 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:46,796 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:14:46,796 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:14:46,796 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:14:46,796 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:14:46,796 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 4 states. [2018-06-22 01:14:46,990 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 01:14:47,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:47,043 INFO ]: Finished difference Result 30 states and 46 transitions. [2018-06-22 01:14:47,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:14:47,043 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:14:47,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:47,044 INFO ]: With dead ends: 30 [2018-06-22 01:14:47,044 INFO ]: Without dead ends: 30 [2018-06-22 01:14:47,044 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:14:47,044 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:14:47,049 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 17. [2018-06-22 01:14:47,050 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:14:47,050 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-06-22 01:14:47,050 INFO ]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 9 [2018-06-22 01:14:47,050 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:47,050 INFO ]: Abstraction has 17 states and 26 transitions. [2018-06-22 01:14:47,050 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:14:47,051 INFO ]: Start isEmpty. Operand 17 states and 26 transitions. [2018-06-22 01:14:47,051 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:14:47,051 INFO ]: Found error trace [2018-06-22 01:14:47,051 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:47,051 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:47,051 INFO ]: Analyzing trace with hash 536437666, now seen corresponding path program 1 times [2018-06-22 01:14:47,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:47,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:47,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:47,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:47,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:47,073 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:47,149 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:47,149 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:47,149 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:14:47,149 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:14:47,149 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:14:47,149 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:14:47,149 INFO ]: Start difference. First operand 17 states and 26 transitions. Second operand 5 states. [2018-06-22 01:14:47,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:47,233 INFO ]: Finished difference Result 30 states and 46 transitions. [2018-06-22 01:14:47,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:14:47,234 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:14:47,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:47,235 INFO ]: With dead ends: 30 [2018-06-22 01:14:47,235 INFO ]: Without dead ends: 30 [2018-06-22 01:14:47,235 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:14:47,235 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:14:47,238 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 16. [2018-06-22 01:14:47,238 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:14:47,238 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-22 01:14:47,238 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 10 [2018-06-22 01:14:47,238 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:47,238 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-22 01:14:47,238 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:14:47,238 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-22 01:14:47,239 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:14:47,239 INFO ]: Found error trace [2018-06-22 01:14:47,239 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:47,239 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:47,239 INFO ]: Analyzing trace with hash 2083574402, now seen corresponding path program 1 times [2018-06-22 01:14:47,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:47,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:47,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:47,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:47,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:47,252 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:47,280 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:47,280 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:47,280 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:14:47,280 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:14:47,280 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:14:47,280 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:47,280 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 3 states. [2018-06-22 01:14:47,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:47,318 INFO ]: Finished difference Result 16 states and 23 transitions. [2018-06-22 01:14:47,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:14:47,319 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-22 01:14:47,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:47,320 INFO ]: With dead ends: 16 [2018-06-22 01:14:47,320 INFO ]: Without dead ends: 15 [2018-06-22 01:14:47,320 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:47,320 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:14:47,322 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:14:47,322 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:14:47,322 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 01:14:47,322 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 10 [2018-06-22 01:14:47,322 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:47,322 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 01:14:47,322 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:14:47,322 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 01:14:47,323 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:14:47,323 INFO ]: Found error trace [2018-06-22 01:14:47,324 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:47,325 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:47,325 INFO ]: Analyzing trace with hash -882472885, now seen corresponding path program 1 times [2018-06-22 01:14:47,325 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:47,325 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:47,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:47,326 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:47,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:47,363 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:47,531 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:47,531 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:47,532 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:14:47,532 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:14:47,532 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:14:47,532 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:14:47,532 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 5 states. [2018-06-22 01:14:47,703 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:14:48,280 WARN ]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-22 01:14:48,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:48,303 INFO ]: Finished difference Result 29 states and 44 transitions. [2018-06-22 01:14:48,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:14:48,303 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:14:48,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:48,304 INFO ]: With dead ends: 29 [2018-06-22 01:14:48,304 INFO ]: Without dead ends: 29 [2018-06-22 01:14:48,304 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:14:48,304 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:14:48,306 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-06-22 01:14:48,306 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:14:48,307 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2018-06-22 01:14:48,307 INFO ]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 10 [2018-06-22 01:14:48,307 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:48,307 INFO ]: Abstraction has 18 states and 26 transitions. [2018-06-22 01:14:48,307 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:14:48,307 INFO ]: Start isEmpty. Operand 18 states and 26 transitions. [2018-06-22 01:14:48,307 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:14:48,307 INFO ]: Found error trace [2018-06-22 01:14:48,307 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:48,307 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:48,307 INFO ]: Analyzing trace with hash 1840977189, now seen corresponding path program 1 times [2018-06-22 01:14:48,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:48,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:48,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:48,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:48,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:48,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:48,395 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:48,395 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:48,395 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:14:48,396 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:14:48,396 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:14:48,396 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:14:48,396 INFO ]: Start difference. First operand 18 states and 26 transitions. Second operand 4 states. [2018-06-22 01:14:48,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:48,425 INFO ]: Finished difference Result 26 states and 38 transitions. [2018-06-22 01:14:48,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:14:48,426 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:14:48,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:48,427 INFO ]: With dead ends: 26 [2018-06-22 01:14:48,427 INFO ]: Without dead ends: 26 [2018-06-22 01:14:48,427 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:14:48,427 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:14:48,430 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 17. [2018-06-22 01:14:48,430 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:14:48,431 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-22 01:14:48,431 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 10 [2018-06-22 01:14:48,431 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:48,431 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-22 01:14:48,431 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:14:48,431 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-22 01:14:48,431 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:14:48,431 INFO ]: Found error trace [2018-06-22 01:14:48,431 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:48,431 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:48,432 INFO ]: Analyzing trace with hash -1310841040, now seen corresponding path program 1 times [2018-06-22 01:14:48,432 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:48,432 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:48,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:48,432 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:48,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:48,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:48,531 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:48,531 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:48,531 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:14:48,531 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:14:48,531 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:14:48,532 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:14:48,532 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 6 states. [2018-06-22 01:14:48,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:48,694 INFO ]: Finished difference Result 34 states and 51 transitions. [2018-06-22 01:14:48,696 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:14:48,696 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 01:14:48,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:48,696 INFO ]: With dead ends: 34 [2018-06-22 01:14:48,696 INFO ]: Without dead ends: 27 [2018-06-22 01:14:48,697 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:14:48,697 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:14:48,699 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-06-22 01:14:48,699 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:14:48,699 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-06-22 01:14:48,699 INFO ]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-06-22 01:14:48,699 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:48,699 INFO ]: Abstraction has 18 states and 25 transitions. [2018-06-22 01:14:48,699 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:14:48,699 INFO ]: Start isEmpty. Operand 18 states and 25 transitions. [2018-06-22 01:14:48,700 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:14:48,701 INFO ]: Found error trace [2018-06-22 01:14:48,701 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:48,702 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:48,702 INFO ]: Analyzing trace with hash -1798495588, now seen corresponding path program 1 times [2018-06-22 01:14:48,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:48,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:48,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:48,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:48,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:48,709 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:48,777 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:48,777 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:48,777 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 01:14:48,778 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:14:48,778 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:14:48,778 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:14:48,778 INFO ]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-06-22 01:14:49,010 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 01:14:49,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:49,096 INFO ]: Finished difference Result 39 states and 57 transitions. [2018-06-22 01:14:49,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:14:49,096 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-22 01:14:49,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:49,097 INFO ]: With dead ends: 39 [2018-06-22 01:14:49,097 INFO ]: Without dead ends: 39 [2018-06-22 01:14:49,097 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:14:49,097 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:14:49,100 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 21. [2018-06-22 01:14:49,100 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:14:49,101 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2018-06-22 01:14:49,101 INFO ]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 12 [2018-06-22 01:14:49,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:49,101 INFO ]: Abstraction has 21 states and 29 transitions. [2018-06-22 01:14:49,101 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:14:49,101 INFO ]: Start isEmpty. Operand 21 states and 29 transitions. [2018-06-22 01:14:49,101 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:14:49,101 INFO ]: Found error trace [2018-06-22 01:14:49,102 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:49,102 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:49,102 INFO ]: Analyzing trace with hash 428065029, now seen corresponding path program 1 times [2018-06-22 01:14:49,102 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:49,102 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:49,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:49,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:49,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:49,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:49,212 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:14:49,212 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:49,212 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:49,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:49,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:49,249 INFO ]: Computing forward predicates... [2018-06-22 01:14:49,414 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:49,446 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:49,446 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-06-22 01:14:49,447 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:14:49,447 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:14:49,447 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:14:49,447 INFO ]: Start difference. First operand 21 states and 29 transitions. Second operand 10 states. [2018-06-22 01:14:49,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:49,922 INFO ]: Finished difference Result 32 states and 46 transitions. [2018-06-22 01:14:49,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:14:49,922 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-22 01:14:49,922 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:49,923 INFO ]: With dead ends: 32 [2018-06-22 01:14:49,923 INFO ]: Without dead ends: 20 [2018-06-22 01:14:49,923 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:14:49,923 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:14:49,924 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:14:49,924 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:14:49,925 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-22 01:14:49,925 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 12 [2018-06-22 01:14:49,925 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:49,925 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-22 01:14:49,925 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:14:49,925 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-22 01:14:49,925 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:14:49,925 INFO ]: Found error trace [2018-06-22 01:14:49,925 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:49,925 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:49,926 INFO ]: Analyzing trace with hash 2028502879, now seen corresponding path program 1 times [2018-06-22 01:14:49,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:49,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:49,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:49,926 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:49,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:49,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:50,050 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:50,050 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:50,050 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 01:14:50,050 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:14:50,050 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:14:50,050 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:14:50,050 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 7 states. [2018-06-22 01:14:50,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:50,281 INFO ]: Finished difference Result 43 states and 65 transitions. [2018-06-22 01:14:50,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:14:50,282 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-22 01:14:50,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:50,282 INFO ]: With dead ends: 43 [2018-06-22 01:14:50,282 INFO ]: Without dead ends: 27 [2018-06-22 01:14:50,283 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:14:50,283 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:14:50,285 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-06-22 01:14:50,285 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:14:50,285 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-06-22 01:14:50,285 INFO ]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2018-06-22 01:14:50,285 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:50,285 INFO ]: Abstraction has 18 states and 24 transitions. [2018-06-22 01:14:50,285 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:14:50,285 INFO ]: Start isEmpty. Operand 18 states and 24 transitions. [2018-06-22 01:14:50,285 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:14:50,285 INFO ]: Found error trace [2018-06-22 01:14:50,286 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:50,286 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:50,290 INFO ]: Analyzing trace with hash -203886221, now seen corresponding path program 1 times [2018-06-22 01:14:50,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:50,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:50,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:50,291 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:50,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:50,297 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:50,357 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:50,357 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:50,357 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 01:14:50,358 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:14:50,358 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:14:50,358 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:14:50,358 INFO ]: Start difference. First operand 18 states and 24 transitions. Second operand 8 states. [2018-06-22 01:14:50,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:50,495 INFO ]: Finished difference Result 40 states and 59 transitions. [2018-06-22 01:14:50,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:14:50,496 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 01:14:50,496 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:50,497 INFO ]: With dead ends: 40 [2018-06-22 01:14:50,497 INFO ]: Without dead ends: 40 [2018-06-22 01:14:50,497 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:14:50,497 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:14:50,499 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 22. [2018-06-22 01:14:50,499 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:14:50,500 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-06-22 01:14:50,500 INFO ]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-06-22 01:14:50,500 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:50,500 INFO ]: Abstraction has 22 states and 31 transitions. [2018-06-22 01:14:50,500 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:14:50,500 INFO ]: Start isEmpty. Operand 22 states and 31 transitions. [2018-06-22 01:14:50,500 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:14:50,500 INFO ]: Found error trace [2018-06-22 01:14:50,500 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:50,500 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:50,501 INFO ]: Analyzing trace with hash -251284216, now seen corresponding path program 1 times [2018-06-22 01:14:50,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:50,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:50,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:50,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:50,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:50,509 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:50,531 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:50,531 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:50,531 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:14:50,531 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:14:50,531 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:14:50,531 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:14:50,531 INFO ]: Start difference. First operand 22 states and 31 transitions. Second operand 4 states. [2018-06-22 01:14:50,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:50,543 INFO ]: Finished difference Result 33 states and 47 transitions. [2018-06-22 01:14:50,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:14:50,543 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 01:14:50,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:50,544 INFO ]: With dead ends: 33 [2018-06-22 01:14:50,544 INFO ]: Without dead ends: 29 [2018-06-22 01:14:50,544 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:14:50,544 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:14:50,546 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-06-22 01:14:50,546 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:14:50,546 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-22 01:14:50,546 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2018-06-22 01:14:50,546 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:50,546 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-22 01:14:50,546 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:14:50,546 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-22 01:14:50,547 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:14:50,547 INFO ]: Found error trace [2018-06-22 01:14:50,547 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:50,547 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:50,547 INFO ]: Analyzing trace with hash 1372727617, now seen corresponding path program 1 times [2018-06-22 01:14:50,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:50,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:50,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:50,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:50,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:50,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:50,604 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:50,604 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:50,604 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:14:50,604 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:14:50,604 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:14:50,604 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:14:50,605 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2018-06-22 01:14:50,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:50,628 INFO ]: Finished difference Result 13 states and 16 transitions. [2018-06-22 01:14:50,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:14:50,628 INFO ]: Start accepts. Automaton has 5 states. Word has length 16 [2018-06-22 01:14:50,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:50,628 INFO ]: With dead ends: 13 [2018-06-22 01:14:50,629 INFO ]: Without dead ends: 0 [2018-06-22 01:14:50,629 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:14:50,629 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:14:50,629 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:14:50,629 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:14:50,629 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:14:50,629 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-06-22 01:14:50,629 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:50,629 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:14:50,629 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:14:50,629 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:14:50,629 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:14:50,634 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:14:50 BoogieIcfgContainer [2018-06-22 01:14:50,634 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:14:50,635 INFO ]: Toolchain (without parser) took 5021.66 ms. Allocated memory was 304.6 MB in the beginning and 339.7 MB in the end (delta: 35.1 MB). Free memory was 258.1 MB in the beginning and 188.0 MB in the end (delta: 70.2 MB). Peak memory consumption was 105.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:50,636 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 304.6 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:14:50,637 INFO ]: ChcToBoogie took 63.55 ms. Allocated memory is still 304.6 MB. Free memory was 257.1 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:50,637 INFO ]: Boogie Preprocessor took 44.50 ms. Allocated memory is still 304.6 MB. Free memory was 255.2 MB in the beginning and 254.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:14:50,638 INFO ]: RCFGBuilder took 367.01 ms. Allocated memory is still 304.6 MB. Free memory was 254.2 MB in the beginning and 238.2 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:50,638 INFO ]: TraceAbstraction took 4537.78 ms. Allocated memory was 304.6 MB in the beginning and 339.7 MB in the end (delta: 35.1 MB). Free memory was 238.2 MB in the beginning and 188.0 MB in the end (delta: 50.2 MB). Peak memory consumption was 85.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:50,641 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 304.6 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.55 ms. Allocated memory is still 304.6 MB. Free memory was 257.1 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.50 ms. Allocated memory is still 304.6 MB. Free memory was 255.2 MB in the beginning and 254.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 367.01 ms. Allocated memory is still 304.6 MB. Free memory was 254.2 MB in the beginning and 238.2 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4537.78 ms. Allocated memory was 304.6 MB in the beginning and 339.7 MB in the end (delta: 35.1 MB). Free memory was 238.2 MB in the beginning and 188.0 MB in the end (delta: 50.2 MB). Peak memory consumption was 85.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 307 SDtfs, 259 SDslu, 776 SDs, 0 SdLazy, 370 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred 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, 14 MinimizatonAttempts, 118 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 6196 SizeOfPredicates, 25 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 7/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-14-50-651.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-14-50-651.csv Received shutdown request...