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_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 12:15:55,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 12:15:55,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 12:15:55,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 12:15:55,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 12:15:55,302 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 12:15:55,303 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 12:15:55,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 12:15:55,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 12:15:55,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 12:15:55,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 12:15:55,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 12:15:55,309 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 12:15:55,310 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 12:15:55,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 12:15:55,314 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 12:15:55,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 12:15:55,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 12:15:55,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 12:15:55,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 12:15:55,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 12:15:55,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 12:15:55,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 12:15:55,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 12:15:55,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 12:15:55,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 12:15:55,326 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 12:15:55,327 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 12:15:55,328 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 12:15:55,328 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 12:15:55,329 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 12:15:55,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 12:15:55,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 12:15:55,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 12:15:55,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 12:15:55,332 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 12:15:55,345 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 12:15:55,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 12:15:55,345 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 12:15:55,346 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 12:15:55,347 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 12:15:55,347 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 12:15:55,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 12:15:55,347 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 12:15:55,347 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 12:15:55,348 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 12:15:55,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 12:15:55,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 12:15:55,348 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 12:15:55,348 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 12:15:55,349 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 12:15:55,349 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 12:15:55,349 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 12:15:55,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 12:15:55,349 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 12:15:55,351 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 12:15:55,351 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 12:15:55,392 INFO ]: Repository-Root is: /tmp [2018-06-22 12:15:55,407 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 12:15:55,414 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 12:15:55,416 INFO ]: Initializing SmtParser... [2018-06-22 12:15:55,416 INFO ]: SmtParser initialized [2018-06-22 12:15:55,417 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 [2018-06-22 12:15:55,418 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 12:15:55,509 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@1a25cd4 [2018-06-22 12:15:55,817 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 [2018-06-22 12:15:55,822 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 12:15:55,832 INFO ]: Walking toolchain with 4 elements. [2018-06-22 12:15:55,832 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 12:15:55,832 INFO ]: Initializing ChcToBoogie... [2018-06-22 12:15:55,832 INFO ]: ChcToBoogie initialized [2018-06-22 12:15:55,835 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:15:55" (1/1) ... [2018-06-22 12:15:55,881 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:15:55 Unit [2018-06-22 12:15:55,881 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 12:15:55,882 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 12:15:55,882 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 12:15:55,882 INFO ]: Boogie Preprocessor initialized [2018-06-22 12:15:55,906 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:15:55" (1/1) ... [2018-06-22 12:15:55,906 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:15:55" (1/1) ... [2018-06-22 12:15:55,915 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:15:55" (1/1) ... [2018-06-22 12:15:55,915 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:15:55" (1/1) ... [2018-06-22 12:15:55,922 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:15:55" (1/1) ... [2018-06-22 12:15:55,933 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:15:55" (1/1) ... [2018-06-22 12:15:55,935 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:15:55" (1/1) ... [2018-06-22 12:15:55,939 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 12:15:55,940 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 12:15:55,940 INFO ]: Initializing RCFGBuilder... [2018-06-22 12:15:55,940 INFO ]: RCFGBuilder initialized [2018-06-22 12:15:55,941 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:15:55" (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) [2018-06-22 12:15:55,965 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 12:15:55,965 INFO ]: Found specification of procedure False [2018-06-22 12:15:55,965 INFO ]: Found implementation of procedure False [2018-06-22 12:15:55,965 INFO ]: Specification and implementation of procedure INV_REC_f^f given in one single declaration [2018-06-22 12:15:55,966 INFO ]: Found specification of procedure INV_REC_f^f [2018-06-22 12:15:55,966 INFO ]: Found implementation of procedure INV_REC_f^f [2018-06-22 12:15:55,966 INFO ]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration [2018-06-22 12:15:55,966 INFO ]: Found specification of procedure INV_REC_f^f_PRE [2018-06-22 12:15:55,966 INFO ]: Found implementation of procedure INV_REC_f^f_PRE [2018-06-22 12:15:55,966 INFO ]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration [2018-06-22 12:15:55,966 INFO ]: Found specification of procedure INV_REC_f__2 [2018-06-22 12:15:55,966 INFO ]: Found implementation of procedure INV_REC_f__2 [2018-06-22 12:15:55,966 INFO ]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration [2018-06-22 12:15:55,966 INFO ]: Found specification of procedure INV_REC_f__2_PRE [2018-06-22 12:15:55,966 INFO ]: Found implementation of procedure INV_REC_f__2_PRE [2018-06-22 12:15:55,966 INFO ]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration [2018-06-22 12:15:55,966 INFO ]: Found specification of procedure INV_REC_f__1 [2018-06-22 12:15:55,966 INFO ]: Found implementation of procedure INV_REC_f__1 [2018-06-22 12:15:55,966 INFO ]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration [2018-06-22 12:15:55,966 INFO ]: Found specification of procedure INV_REC_f__1_PRE [2018-06-22 12:15:55,966 INFO ]: Found implementation of procedure INV_REC_f__1_PRE [2018-06-22 12:15:55,966 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 12:15:55,966 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 12:15:55,966 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 12:15:56,406 INFO ]: Using library mode [2018-06-22 12:15:56,406 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:15:56 BoogieIcfgContainer [2018-06-22 12:15:56,406 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 12:15:56,408 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 12:15:56,408 INFO ]: Initializing TraceAbstraction... [2018-06-22 12:15:56,411 INFO ]: TraceAbstraction initialized [2018-06-22 12:15:56,411 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:15:55" (1/3) ... [2018-06-22 12:15:56,412 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d12332a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:15:56, skipping insertion in model container [2018-06-22 12:15:56,412 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:15:55" (2/3) ... [2018-06-22 12:15:56,413 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d12332a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:15:56, skipping insertion in model container [2018-06-22 12:15:56,413 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:15:56" (3/3) ... [2018-06-22 12:15:56,415 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 12:15:56,425 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 12:15:56,432 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 12:15:56,475 INFO ]: Using default assertion order modulation [2018-06-22 12:15:56,475 INFO ]: Interprodecural is true [2018-06-22 12:15:56,475 INFO ]: Hoare is false [2018-06-22 12:15:56,475 INFO ]: Compute interpolants for FPandBP [2018-06-22 12:15:56,475 INFO ]: Backedges is TWOTRACK [2018-06-22 12:15:56,475 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 12:15:56,475 INFO ]: Difference is false [2018-06-22 12:15:56,475 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 12:15:56,476 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 12:15:56,490 INFO ]: Start isEmpty. Operand 53 states. [2018-06-22 12:15:56,503 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 12:15:56,503 INFO ]: Found error trace [2018-06-22 12:15:56,504 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 12:15:56,505 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:56,510 INFO ]: Analyzing trace with hash 163150626, now seen corresponding path program 1 times [2018-06-22 12:15:56,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:56,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:56,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:56,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:56,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:56,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:56,580 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:15:56,581 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:56,582 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 12:15:56,583 INFO ]: Interpolant automaton has 2 states [2018-06-22 12:15:56,593 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 12:15:56,593 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 12:15:56,595 INFO ]: Start difference. First operand 53 states. Second operand 2 states. [2018-06-22 12:15:56,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:15:56,628 INFO ]: Finished difference Result 50 states and 85 transitions. [2018-06-22 12:15:56,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 12:15:56,629 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 12:15:56,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:15:56,643 INFO ]: With dead ends: 50 [2018-06-22 12:15:56,643 INFO ]: Without dead ends: 50 [2018-06-22 12:15:56,644 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 12:15:56,657 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 12:15:56,690 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-22 12:15:56,692 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 12:15:56,697 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2018-06-22 12:15:56,698 INFO ]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 5 [2018-06-22 12:15:56,699 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:15:56,699 INFO ]: Abstraction has 50 states and 85 transitions. [2018-06-22 12:15:56,699 INFO ]: Interpolant automaton has 2 states. [2018-06-22 12:15:56,699 INFO ]: Start isEmpty. Operand 50 states and 85 transitions. [2018-06-22 12:15:56,706 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:15:56,707 INFO ]: Found error trace [2018-06-22 12:15:56,707 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:15:56,707 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:56,707 INFO ]: Analyzing trace with hash -352693564, now seen corresponding path program 1 times [2018-06-22 12:15:56,708 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:56,708 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:56,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:56,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:56,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:56,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:57,134 WARN ]: Spent 212.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 12:15:57,279 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:15:57,279 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:57,279 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:15:57,281 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:15:57,283 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:15:57,283 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:15:57,283 INFO ]: Start difference. First operand 50 states and 85 transitions. Second operand 6 states. [2018-06-22 12:15:57,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:15:57,779 INFO ]: Finished difference Result 62 states and 113 transitions. [2018-06-22 12:15:57,780 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 12:15:57,780 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 12:15:57,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:15:57,782 INFO ]: With dead ends: 62 [2018-06-22 12:15:57,782 INFO ]: Without dead ends: 57 [2018-06-22 12:15:57,783 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:15:57,783 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 12:15:57,800 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-22 12:15:57,800 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 12:15:57,803 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 100 transitions. [2018-06-22 12:15:57,803 INFO ]: Start accepts. Automaton has 55 states and 100 transitions. Word has length 13 [2018-06-22 12:15:57,804 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:15:57,804 INFO ]: Abstraction has 55 states and 100 transitions. [2018-06-22 12:15:57,804 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:15:57,804 INFO ]: Start isEmpty. Operand 55 states and 100 transitions. [2018-06-22 12:15:57,806 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:15:57,807 INFO ]: Found error trace [2018-06-22 12:15:57,807 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:15:57,807 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:57,807 INFO ]: Analyzing trace with hash -1682678977, now seen corresponding path program 1 times [2018-06-22 12:15:57,807 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:57,807 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:57,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:57,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:57,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:57,820 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:57,872 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:15:57,872 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:57,872 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:15:57,872 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:15:57,872 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:15:57,872 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:15:57,872 INFO ]: Start difference. First operand 55 states and 100 transitions. Second operand 4 states. [2018-06-22 12:15:58,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:15:58,085 INFO ]: Finished difference Result 58 states and 104 transitions. [2018-06-22 12:15:58,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:15:58,085 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:15:58,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:15:58,088 INFO ]: With dead ends: 58 [2018-06-22 12:15:58,088 INFO ]: Without dead ends: 58 [2018-06-22 12:15:58,088 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:15:58,088 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 12:15:58,101 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-06-22 12:15:58,101 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 12:15:58,102 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 99 transitions. [2018-06-22 12:15:58,102 INFO ]: Start accepts. Automaton has 55 states and 99 transitions. Word has length 13 [2018-06-22 12:15:58,103 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:15:58,103 INFO ]: Abstraction has 55 states and 99 transitions. [2018-06-22 12:15:58,103 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:15:58,103 INFO ]: Start isEmpty. Operand 55 states and 99 transitions. [2018-06-22 12:15:58,104 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:15:58,104 INFO ]: Found error trace [2018-06-22 12:15:58,105 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:15:58,105 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:58,105 INFO ]: Analyzing trace with hash -561275288, now seen corresponding path program 1 times [2018-06-22 12:15:58,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:58,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:58,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:58,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:58,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:58,111 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:58,138 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:15:58,138 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:58,138 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:15:58,139 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:15:58,139 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:15:58,139 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:15:58,139 INFO ]: Start difference. First operand 55 states and 99 transitions. Second operand 4 states. [2018-06-22 12:15:58,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:15:58,162 INFO ]: Finished difference Result 60 states and 106 transitions. [2018-06-22 12:15:58,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:15:58,163 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:15:58,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:15:58,164 INFO ]: With dead ends: 60 [2018-06-22 12:15:58,164 INFO ]: Without dead ends: 60 [2018-06-22 12:15:58,165 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:15:58,165 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 12:15:58,174 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-06-22 12:15:58,174 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 12:15:58,175 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 104 transitions. [2018-06-22 12:15:58,176 INFO ]: Start accepts. Automaton has 58 states and 104 transitions. Word has length 13 [2018-06-22 12:15:58,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:15:58,176 INFO ]: Abstraction has 58 states and 104 transitions. [2018-06-22 12:15:58,176 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:15:58,176 INFO ]: Start isEmpty. Operand 58 states and 104 transitions. [2018-06-22 12:15:58,177 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:15:58,178 INFO ]: Found error trace [2018-06-22 12:15:58,178 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:15:58,178 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:58,178 INFO ]: Analyzing trace with hash -316024435, now seen corresponding path program 1 times [2018-06-22 12:15:58,178 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:58,178 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:58,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:58,179 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:58,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:58,183 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:58,270 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:15:58,270 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:58,270 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:15:58,270 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:15:58,270 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:15:58,270 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:15:58,270 INFO ]: Start difference. First operand 58 states and 104 transitions. Second operand 4 states. [2018-06-22 12:15:58,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:15:58,404 INFO ]: Finished difference Result 58 states and 103 transitions. [2018-06-22 12:15:58,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:15:58,405 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:15:58,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:15:58,407 INFO ]: With dead ends: 58 [2018-06-22 12:15:58,407 INFO ]: Without dead ends: 57 [2018-06-22 12:15:58,407 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:15:58,407 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 12:15:58,423 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-06-22 12:15:58,423 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 12:15:58,425 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 96 transitions. [2018-06-22 12:15:58,425 INFO ]: Start accepts. Automaton has 54 states and 96 transitions. Word has length 13 [2018-06-22 12:15:58,425 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:15:58,425 INFO ]: Abstraction has 54 states and 96 transitions. [2018-06-22 12:15:58,425 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:15:58,425 INFO ]: Start isEmpty. Operand 54 states and 96 transitions. [2018-06-22 12:15:58,434 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:15:58,434 INFO ]: Found error trace [2018-06-22 12:15:58,434 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:15:58,434 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:58,434 INFO ]: Analyzing trace with hash -159069332, now seen corresponding path program 1 times [2018-06-22 12:15:58,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:58,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:58,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:58,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:58,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:58,448 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:58,613 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:15:58,613 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:58,613 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:15:58,613 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:15:58,613 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:15:58,613 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:15:58,614 INFO ]: Start difference. First operand 54 states and 96 transitions. Second operand 4 states. [2018-06-22 12:15:58,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:15:58,649 INFO ]: Finished difference Result 58 states and 102 transitions. [2018-06-22 12:15:58,650 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:15:58,650 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:15:58,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:15:58,651 INFO ]: With dead ends: 58 [2018-06-22 12:15:58,651 INFO ]: Without dead ends: 58 [2018-06-22 12:15:58,652 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:15:58,652 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 12:15:58,661 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-22 12:15:58,661 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 12:15:58,663 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 100 transitions. [2018-06-22 12:15:58,663 INFO ]: Start accepts. Automaton has 56 states and 100 transitions. Word has length 13 [2018-06-22 12:15:58,663 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:15:58,663 INFO ]: Abstraction has 56 states and 100 transitions. [2018-06-22 12:15:58,663 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:15:58,663 INFO ]: Start isEmpty. Operand 56 states and 100 transitions. [2018-06-22 12:15:58,669 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:15:58,669 INFO ]: Found error trace [2018-06-22 12:15:58,670 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:15:58,670 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:58,670 INFO ]: Analyzing trace with hash -762384186, now seen corresponding path program 1 times [2018-06-22 12:15:58,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:58,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:58,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:58,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:58,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:58,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:58,850 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:15:58,850 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:58,850 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:15:58,850 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:15:58,850 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:15:58,850 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:15:58,850 INFO ]: Start difference. First operand 56 states and 100 transitions. Second operand 4 states. [2018-06-22 12:15:58,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:15:58,880 INFO ]: Finished difference Result 61 states and 106 transitions. [2018-06-22 12:15:58,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:15:58,882 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 12:15:58,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:15:58,883 INFO ]: With dead ends: 61 [2018-06-22 12:15:58,883 INFO ]: Without dead ends: 57 [2018-06-22 12:15:58,883 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:15:58,883 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 12:15:58,890 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-22 12:15:58,890 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 12:15:58,891 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 97 transitions. [2018-06-22 12:15:58,891 INFO ]: Start accepts. Automaton has 55 states and 97 transitions. Word has length 17 [2018-06-22 12:15:58,891 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:15:58,891 INFO ]: Abstraction has 55 states and 97 transitions. [2018-06-22 12:15:58,891 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:15:58,891 INFO ]: Start isEmpty. Operand 55 states and 97 transitions. [2018-06-22 12:15:58,893 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:15:58,893 INFO ]: Found error trace [2018-06-22 12:15:58,893 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:15:58,893 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:58,893 INFO ]: Analyzing trace with hash 473758913, now seen corresponding path program 1 times [2018-06-22 12:15:58,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:58,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:58,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:58,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:58,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:58,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:58,947 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:15:58,947 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:58,947 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:15:58,947 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:15:58,947 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:15:58,947 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:15:58,947 INFO ]: Start difference. First operand 55 states and 97 transitions. Second operand 5 states. [2018-06-22 12:15:59,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:15:59,129 INFO ]: Finished difference Result 52 states and 91 transitions. [2018-06-22 12:15:59,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:15:59,129 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 12:15:59,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:15:59,130 INFO ]: With dead ends: 52 [2018-06-22 12:15:59,130 INFO ]: Without dead ends: 51 [2018-06-22 12:15:59,131 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:15:59,131 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 12:15:59,136 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-06-22 12:15:59,136 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 12:15:59,137 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 80 transitions. [2018-06-22 12:15:59,137 INFO ]: Start accepts. Automaton has 49 states and 80 transitions. Word has length 17 [2018-06-22 12:15:59,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:15:59,137 INFO ]: Abstraction has 49 states and 80 transitions. [2018-06-22 12:15:59,137 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:15:59,137 INFO ]: Start isEmpty. Operand 49 states and 80 transitions. [2018-06-22 12:15:59,138 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:15:59,138 INFO ]: Found error trace [2018-06-22 12:15:59,138 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:15:59,138 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:59,138 INFO ]: Analyzing trace with hash 348052001, now seen corresponding path program 1 times [2018-06-22 12:15:59,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:59,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:59,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:59,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:59,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:59,145 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:59,178 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:15:59,178 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:59,178 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:15:59,178 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:15:59,178 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:15:59,178 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:15:59,178 INFO ]: Start difference. First operand 49 states and 80 transitions. Second operand 5 states. [2018-06-22 12:15:59,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:15:59,401 INFO ]: Finished difference Result 49 states and 79 transitions. [2018-06-22 12:15:59,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:15:59,405 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 12:15:59,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:15:59,406 INFO ]: With dead ends: 49 [2018-06-22 12:15:59,406 INFO ]: Without dead ends: 48 [2018-06-22 12:15:59,406 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:15:59,406 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 12:15:59,416 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 12:15:59,416 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 12:15:59,417 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2018-06-22 12:15:59,417 INFO ]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 21 [2018-06-22 12:15:59,417 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:15:59,417 INFO ]: Abstraction has 46 states and 73 transitions. [2018-06-22 12:15:59,417 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:15:59,417 INFO ]: Start isEmpty. Operand 46 states and 73 transitions. [2018-06-22 12:15:59,418 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:15:59,418 INFO ]: Found error trace [2018-06-22 12:15:59,418 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:15:59,418 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:59,418 INFO ]: Analyzing trace with hash 1748989100, now seen corresponding path program 1 times [2018-06-22 12:15:59,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:59,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:59,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:59,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:59,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:59,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:59,577 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:15:59,577 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:59,577 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 12:15:59,578 INFO ]: Interpolant automaton has 8 states [2018-06-22 12:15:59,578 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 12:15:59,578 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:15:59,578 INFO ]: Start difference. First operand 46 states and 73 transitions. Second operand 8 states. [2018-06-22 12:15:59,850 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:15:59,850 INFO ]: Finished difference Result 63 states and 108 transitions. [2018-06-22 12:15:59,850 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 12:15:59,850 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 12:15:59,850 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:15:59,851 INFO ]: With dead ends: 63 [2018-06-22 12:15:59,851 INFO ]: Without dead ends: 58 [2018-06-22 12:15:59,851 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:15:59,851 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 12:15:59,859 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-06-22 12:15:59,859 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 12:15:59,860 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 93 transitions. [2018-06-22 12:15:59,860 INFO ]: Start accepts. Automaton has 54 states and 93 transitions. Word has length 21 [2018-06-22 12:15:59,860 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:15:59,860 INFO ]: Abstraction has 54 states and 93 transitions. [2018-06-22 12:15:59,860 INFO ]: Interpolant automaton has 8 states. [2018-06-22 12:15:59,860 INFO ]: Start isEmpty. Operand 54 states and 93 transitions. [2018-06-22 12:15:59,861 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:15:59,862 INFO ]: Found error trace [2018-06-22 12:15:59,862 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:15:59,862 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:15:59,862 INFO ]: Analyzing trace with hash 1987757088, now seen corresponding path program 1 times [2018-06-22 12:15:59,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:15:59,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:15:59,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:59,863 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:15:59,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:15:59,870 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:15:59,916 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:15:59,916 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:15:59,916 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:15:59,916 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:15:59,916 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:15:59,916 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:15:59,916 INFO ]: Start difference. First operand 54 states and 93 transitions. Second operand 6 states. [2018-06-22 12:16:00,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:00,081 INFO ]: Finished difference Result 59 states and 100 transitions. [2018-06-22 12:16:00,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:16:00,081 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 12:16:00,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:00,082 INFO ]: With dead ends: 59 [2018-06-22 12:16:00,082 INFO ]: Without dead ends: 59 [2018-06-22 12:16:00,082 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:16:00,082 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 12:16:00,089 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-06-22 12:16:00,089 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 12:16:00,090 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 92 transitions. [2018-06-22 12:16:00,090 INFO ]: Start accepts. Automaton has 54 states and 92 transitions. Word has length 21 [2018-06-22 12:16:00,090 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:00,090 INFO ]: Abstraction has 54 states and 92 transitions. [2018-06-22 12:16:00,090 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:16:00,090 INFO ]: Start isEmpty. Operand 54 states and 92 transitions. [2018-06-22 12:16:00,091 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:16:00,091 INFO ]: Found error trace [2018-06-22 12:16:00,091 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:00,091 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:00,092 INFO ]: Analyzing trace with hash -1821719107, now seen corresponding path program 1 times [2018-06-22 12:16:00,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:00,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:00,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:00,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:00,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:00,099 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:00,168 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:16:00,168 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:00,168 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:16:00,168 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:16:00,169 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:16:00,169 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:16:00,169 INFO ]: Start difference. First operand 54 states and 92 transitions. Second operand 4 states. [2018-06-22 12:16:00,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:00,196 INFO ]: Finished difference Result 59 states and 101 transitions. [2018-06-22 12:16:00,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:16:00,198 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 12:16:00,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:00,199 INFO ]: With dead ends: 59 [2018-06-22 12:16:00,199 INFO ]: Without dead ends: 59 [2018-06-22 12:16:00,199 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:16:00,199 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 12:16:00,204 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-06-22 12:16:00,204 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 12:16:00,205 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 101 transitions. [2018-06-22 12:16:00,205 INFO ]: Start accepts. Automaton has 59 states and 101 transitions. Word has length 21 [2018-06-22 12:16:00,205 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:00,205 INFO ]: Abstraction has 59 states and 101 transitions. [2018-06-22 12:16:00,206 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:16:00,206 INFO ]: Start isEmpty. Operand 59 states and 101 transitions. [2018-06-22 12:16:00,207 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:16:00,207 INFO ]: Found error trace [2018-06-22 12:16:00,207 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:00,207 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:00,207 INFO ]: Analyzing trace with hash 1936116642, now seen corresponding path program 1 times [2018-06-22 12:16:00,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:00,207 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:00,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:00,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:00,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:00,214 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:00,237 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:16:00,237 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:00,238 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:16:00,238 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:16:00,238 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:16:00,238 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:16:00,238 INFO ]: Start difference. First operand 59 states and 101 transitions. Second operand 4 states. [2018-06-22 12:16:00,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:00,262 INFO ]: Finished difference Result 59 states and 99 transitions. [2018-06-22 12:16:00,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:16:00,262 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 12:16:00,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:00,263 INFO ]: With dead ends: 59 [2018-06-22 12:16:00,263 INFO ]: Without dead ends: 59 [2018-06-22 12:16:00,263 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:16:00,263 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 12:16:00,269 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-06-22 12:16:00,269 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 12:16:00,270 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 94 transitions. [2018-06-22 12:16:00,270 INFO ]: Start accepts. Automaton has 56 states and 94 transitions. Word has length 21 [2018-06-22 12:16:00,270 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:00,270 INFO ]: Abstraction has 56 states and 94 transitions. [2018-06-22 12:16:00,270 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:16:00,270 INFO ]: Start isEmpty. Operand 56 states and 94 transitions. [2018-06-22 12:16:00,271 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 12:16:00,271 INFO ]: Found error trace [2018-06-22 12:16:00,271 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:00,271 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:00,271 INFO ]: Analyzing trace with hash 2096026542, now seen corresponding path program 1 times [2018-06-22 12:16:00,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:00,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:00,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:00,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:00,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:00,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:00,454 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:16:00,454 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:00,454 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:16:00,454 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:16:00,454 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:16:00,454 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:16:00,454 INFO ]: Start difference. First operand 56 states and 94 transitions. Second operand 6 states. [2018-06-22 12:16:00,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:00,516 INFO ]: Finished difference Result 63 states and 103 transitions. [2018-06-22 12:16:00,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:16:00,516 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 12:16:00,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:00,517 INFO ]: With dead ends: 63 [2018-06-22 12:16:00,517 INFO ]: Without dead ends: 57 [2018-06-22 12:16:00,517 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:16:00,517 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 12:16:00,523 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-22 12:16:00,523 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 12:16:00,526 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2018-06-22 12:16:00,526 INFO ]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 25 [2018-06-22 12:16:00,527 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:00,527 INFO ]: Abstraction has 55 states and 91 transitions. [2018-06-22 12:16:00,527 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:16:00,527 INFO ]: Start isEmpty. Operand 55 states and 91 transitions. [2018-06-22 12:16:00,527 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 12:16:00,528 INFO ]: Found error trace [2018-06-22 12:16:00,528 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:00,528 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:00,528 INFO ]: Analyzing trace with hash -1062697694, now seen corresponding path program 1 times [2018-06-22 12:16:00,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:00,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:00,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:00,529 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:00,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:00,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:00,599 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:16:00,599 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:00,600 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:16:00,600 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:16:00,600 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:16:00,600 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:16:00,600 INFO ]: Start difference. First operand 55 states and 91 transitions. Second operand 7 states. [2018-06-22 12:16:00,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:00,723 INFO ]: Finished difference Result 52 states and 85 transitions. [2018-06-22 12:16:00,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:16:00,723 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 12:16:00,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:00,724 INFO ]: With dead ends: 52 [2018-06-22 12:16:00,724 INFO ]: Without dead ends: 50 [2018-06-22 12:16:00,724 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 12:16:00,724 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 12:16:00,730 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-06-22 12:16:00,730 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 12:16:00,731 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2018-06-22 12:16:00,731 INFO ]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 25 [2018-06-22 12:16:00,731 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:00,731 INFO ]: Abstraction has 48 states and 72 transitions. [2018-06-22 12:16:00,731 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:16:00,731 INFO ]: Start isEmpty. Operand 48 states and 72 transitions. [2018-06-22 12:16:00,731 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 12:16:00,731 INFO ]: Found error trace [2018-06-22 12:16:00,731 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:00,732 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:00,732 INFO ]: Analyzing trace with hash -281808761, now seen corresponding path program 1 times [2018-06-22 12:16:00,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:00,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:00,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:00,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:00,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:00,738 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:00,810 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:16:00,811 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:00,811 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:16:00,811 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:16:00,811 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:16:00,811 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:16:00,811 INFO ]: Start difference. First operand 48 states and 72 transitions. Second operand 6 states. [2018-06-22 12:16:01,228 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:01,228 INFO ]: Finished difference Result 53 states and 84 transitions. [2018-06-22 12:16:01,228 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 12:16:01,228 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 12:16:01,228 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:01,229 INFO ]: With dead ends: 53 [2018-06-22 12:16:01,229 INFO ]: Without dead ends: 52 [2018-06-22 12:16:01,229 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:16:01,229 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 12:16:01,232 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-06-22 12:16:01,232 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 12:16:01,233 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 79 transitions. [2018-06-22 12:16:01,233 INFO ]: Start accepts. Automaton has 50 states and 79 transitions. Word has length 25 [2018-06-22 12:16:01,233 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:01,233 INFO ]: Abstraction has 50 states and 79 transitions. [2018-06-22 12:16:01,233 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:16:01,233 INFO ]: Start isEmpty. Operand 50 states and 79 transitions. [2018-06-22 12:16:01,234 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:16:01,234 INFO ]: Found error trace [2018-06-22 12:16:01,234 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:01,234 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:01,234 INFO ]: Analyzing trace with hash 1446421409, now seen corresponding path program 1 times [2018-06-22 12:16:01,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:01,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:01,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:01,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:01,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:01,241 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:01,419 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 12:16:01,419 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:01,419 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:16:01,419 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:16:01,419 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:16:01,419 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:16:01,419 INFO ]: Start difference. First operand 50 states and 79 transitions. Second operand 5 states. [2018-06-22 12:16:01,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:01,550 INFO ]: Finished difference Result 52 states and 82 transitions. [2018-06-22 12:16:01,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:16:01,551 INFO ]: Start accepts. Automaton has 5 states. Word has length 29 [2018-06-22 12:16:01,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:01,551 INFO ]: With dead ends: 52 [2018-06-22 12:16:01,551 INFO ]: Without dead ends: 52 [2018-06-22 12:16:01,551 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:16:01,551 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 12:16:01,554 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-06-22 12:16:01,555 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 12:16:01,555 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2018-06-22 12:16:01,555 INFO ]: Start accepts. Automaton has 52 states and 82 transitions. Word has length 29 [2018-06-22 12:16:01,556 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:01,556 INFO ]: Abstraction has 52 states and 82 transitions. [2018-06-22 12:16:01,556 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:16:01,556 INFO ]: Start isEmpty. Operand 52 states and 82 transitions. [2018-06-22 12:16:01,556 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 12:16:01,556 INFO ]: Found error trace [2018-06-22 12:16:01,557 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:01,557 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:01,557 INFO ]: Analyzing trace with hash -1103988868, now seen corresponding path program 1 times [2018-06-22 12:16:01,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:01,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:01,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:01,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:01,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:01,566 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:01,653 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:16:01,653 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:16:01,654 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 12:16:01,660 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:01,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:01,703 INFO ]: Computing forward predicates... [2018-06-22 12:16:01,885 INFO ]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 12:16:01,906 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:16:01,906 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2018-06-22 12:16:01,906 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:16:01,906 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:16:01,906 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:16:01,907 INFO ]: Start difference. First operand 52 states and 82 transitions. Second operand 10 states. [2018-06-22 12:16:02,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:02,449 INFO ]: Finished difference Result 58 states and 90 transitions. [2018-06-22 12:16:02,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 12:16:02,449 INFO ]: Start accepts. Automaton has 10 states. Word has length 33 [2018-06-22 12:16:02,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:02,450 INFO ]: With dead ends: 58 [2018-06-22 12:16:02,450 INFO ]: Without dead ends: 58 [2018-06-22 12:16:02,451 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:16:02,451 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 12:16:02,458 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-22 12:16:02,458 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 12:16:02,459 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2018-06-22 12:16:02,459 INFO ]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 33 [2018-06-22 12:16:02,459 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:02,459 INFO ]: Abstraction has 56 states and 86 transitions. [2018-06-22 12:16:02,459 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:16:02,459 INFO ]: Start isEmpty. Operand 56 states and 86 transitions. [2018-06-22 12:16:02,460 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:16:02,460 INFO ]: Found error trace [2018-06-22 12:16:02,460 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:02,460 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:02,460 INFO ]: Analyzing trace with hash 824536612, now seen corresponding path program 1 times [2018-06-22 12:16:02,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:02,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:02,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:02,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:02,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:02,474 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:02,628 INFO ]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 12:16:02,628 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:02,628 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:16:02,629 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:16:02,629 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:16:02,629 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:16:02,629 INFO ]: Start difference. First operand 56 states and 86 transitions. Second operand 7 states. [2018-06-22 12:16:02,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:02,767 INFO ]: Finished difference Result 61 states and 93 transitions. [2018-06-22 12:16:02,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:16:02,767 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 12:16:02,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:02,768 INFO ]: With dead ends: 61 [2018-06-22 12:16:02,768 INFO ]: Without dead ends: 57 [2018-06-22 12:16:02,768 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 12:16:02,768 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 12:16:02,772 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-22 12:16:02,772 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 12:16:02,779 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2018-06-22 12:16:02,779 INFO ]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 29 [2018-06-22 12:16:02,779 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:02,779 INFO ]: Abstraction has 55 states and 83 transitions. [2018-06-22 12:16:02,779 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:16:02,779 INFO ]: Start isEmpty. Operand 55 states and 83 transitions. [2018-06-22 12:16:02,780 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:16:02,780 INFO ]: Found error trace [2018-06-22 12:16:02,780 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:02,780 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:02,780 INFO ]: Analyzing trace with hash 1171450505, now seen corresponding path program 1 times [2018-06-22 12:16:02,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:02,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:02,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:02,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:02,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:02,794 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:03,293 INFO ]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 12:16:03,293 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:03,293 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:16:03,293 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:16:03,293 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:16:03,293 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:16:03,294 INFO ]: Start difference. First operand 55 states and 83 transitions. Second operand 7 states. [2018-06-22 12:16:03,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:03,694 INFO ]: Finished difference Result 55 states and 82 transitions. [2018-06-22 12:16:03,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:16:03,694 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 12:16:03,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:03,695 INFO ]: With dead ends: 55 [2018-06-22 12:16:03,695 INFO ]: Without dead ends: 40 [2018-06-22 12:16:03,695 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 12:16:03,695 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 12:16:03,698 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-22 12:16:03,698 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 12:16:03,698 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2018-06-22 12:16:03,698 INFO ]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 29 [2018-06-22 12:16:03,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:03,698 INFO ]: Abstraction has 40 states and 58 transitions. [2018-06-22 12:16:03,698 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:16:03,698 INFO ]: Start isEmpty. Operand 40 states and 58 transitions. [2018-06-22 12:16:03,699 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 12:16:03,699 INFO ]: Found error trace [2018-06-22 12:16:03,699 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:03,699 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:03,699 INFO ]: Analyzing trace with hash -1546550881, now seen corresponding path program 1 times [2018-06-22 12:16:03,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:03,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:03,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:03,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:03,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:03,709 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:03,765 INFO ]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 12:16:03,765 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:16:03,765 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:16:03,772 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:03,807 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:03,811 INFO ]: Computing forward predicates... [2018-06-22 12:16:03,891 INFO ]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 12:16:03,910 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:16:03,910 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-06-22 12:16:03,910 INFO ]: Interpolant automaton has 13 states [2018-06-22 12:16:03,911 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 12:16:03,911 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:16:03,911 INFO ]: Start difference. First operand 40 states and 58 transitions. Second operand 13 states. [2018-06-22 12:16:04,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:04,130 INFO ]: Finished difference Result 51 states and 74 transitions. [2018-06-22 12:16:04,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 12:16:04,130 INFO ]: Start accepts. Automaton has 13 states. Word has length 45 [2018-06-22 12:16:04,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:04,130 INFO ]: With dead ends: 51 [2018-06-22 12:16:04,130 INFO ]: Without dead ends: 49 [2018-06-22 12:16:04,131 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-06-22 12:16:04,131 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 12:16:04,134 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-06-22 12:16:04,134 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 12:16:04,134 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2018-06-22 12:16:04,134 INFO ]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 45 [2018-06-22 12:16:04,134 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:04,134 INFO ]: Abstraction has 43 states and 60 transitions. [2018-06-22 12:16:04,134 INFO ]: Interpolant automaton has 13 states. [2018-06-22 12:16:04,135 INFO ]: Start isEmpty. Operand 43 states and 60 transitions. [2018-06-22 12:16:04,135 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 12:16:04,135 INFO ]: Found error trace [2018-06-22 12:16:04,135 INFO ]: trace histogram [7, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:04,135 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:04,135 INFO ]: Analyzing trace with hash 2041626259, now seen corresponding path program 1 times [2018-06-22 12:16:04,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:04,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:04,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:04,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:04,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:04,148 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:04,240 INFO ]: Checked inductivity of 83 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 12:16:04,240 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:16:04,240 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:16:04,246 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:04,276 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:04,283 INFO ]: Computing forward predicates... [2018-06-22 12:16:04,350 INFO ]: Checked inductivity of 83 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-22 12:16:04,370 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:16:04,370 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-06-22 12:16:04,370 INFO ]: Interpolant automaton has 13 states [2018-06-22 12:16:04,370 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 12:16:04,370 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:16:04,371 INFO ]: Start difference. First operand 43 states and 60 transitions. Second operand 13 states. [2018-06-22 12:16:04,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:04,515 INFO ]: Finished difference Result 33 states and 47 transitions. [2018-06-22 12:16:04,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 12:16:04,516 INFO ]: Start accepts. Automaton has 13 states. Word has length 61 [2018-06-22 12:16:04,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:04,516 INFO ]: With dead ends: 33 [2018-06-22 12:16:04,516 INFO ]: Without dead ends: 0 [2018-06-22 12:16:04,517 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-22 12:16:04,517 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 12:16:04,517 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 12:16:04,517 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 12:16:04,517 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 12:16:04,517 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2018-06-22 12:16:04,517 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:04,517 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 12:16:04,517 INFO ]: Interpolant automaton has 13 states. [2018-06-22 12:16:04,517 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 12:16:04,517 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 12:16:04,521 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:16:04 BoogieIcfgContainer [2018-06-22 12:16:04,521 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 12:16:04,521 INFO ]: Toolchain (without parser) took 8698.90 ms. Allocated memory was 308.8 MB in the beginning and 364.9 MB in the end (delta: 56.1 MB). Free memory was 261.2 MB in the beginning and 184.1 MB in the end (delta: 77.1 MB). Peak memory consumption was 133.2 MB. Max. memory is 3.6 GB. [2018-06-22 12:16:04,524 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 12:16:04,524 INFO ]: ChcToBoogie took 48.94 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.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 12:16:04,525 INFO ]: Boogie Preprocessor took 57.39 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 257.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 12:16:04,525 INFO ]: RCFGBuilder took 466.79 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 243.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:16:04,526 INFO ]: TraceAbstraction took 8112.63 ms. Allocated memory was 308.8 MB in the beginning and 364.9 MB in the end (delta: 56.1 MB). Free memory was 243.2 MB in the beginning and 184.1 MB in the end (delta: 59.1 MB). Peak memory consumption was 115.2 MB. Max. memory is 3.6 GB. [2018-06-22 12:16:04,529 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 48.94 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.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 57.39 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 257.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 466.79 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 243.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 8112.63 ms. Allocated memory was 308.8 MB in the beginning and 364.9 MB in the end (delta: 56.1 MB). Free memory was 243.2 MB in the beginning and 184.1 MB in the end (delta: 59.1 MB). Peak memory consumption was 115.2 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 8 procedures, 53 locations, 1 error locations. SAFE Result, 8.0s OverallTime, 22 OverallIterations, 7 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1488 SDtfs, 45 SDslu, 4248 SDs, 0 SdLazy, 1259 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 46 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 624 ConstructedInterpolants, 0 QuantifiedInterpolants, 40672 SizeOfPredicates, 6 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 25 InterpolantComputations, 20 PerfectInterpolantSequences, 234/271 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/rec__add-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_12-16-04-545.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__add-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_12-16-04-545.csv Received shutdown request...