java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:26:11,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:26:11,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:26:11,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:26:11,501 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:26:11,502 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:26:11,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:26:11,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:26:11,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:26:11,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:26:11,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:26:11,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:26:11,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:26:11,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:26:11,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:26:11,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:26:11,516 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:26:11,518 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:26:11,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:26:11,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:26:11,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:26:11,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:26:11,535 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:26:11,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:26:11,536 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:26:11,537 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:26:11,538 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:26:11,538 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:26:11,539 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:26:11,540 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:26:11,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:26:11,541 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:26:11,541 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:26:11,542 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:26:11,542 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:26:11,542 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:26:11,559 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:26:11,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:26:11,559 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:26:11,559 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:26:11,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:26:11,561 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:26:11,561 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:26:11,561 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:26:11,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:26:11,561 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:26:11,562 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:26:11,562 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:26:11,562 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:26:11,562 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:26:11,562 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:26:11,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:26:11,563 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:26:11,564 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:26:11,564 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:26:11,616 INFO ]: Repository-Root is: /tmp [2018-06-22 01:26:11,627 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:26:11,630 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:26:11,633 INFO ]: Initializing SmtParser... [2018-06-22 01:26:11,634 INFO ]: SmtParser initialized [2018-06-22 01:26:11,634 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 [2018-06-22 01:26:11,636 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:26:11,727 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 unknown [2018-06-22 01:26:12,035 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 [2018-06-22 01:26:12,040 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:26:12,045 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:26:12,046 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:26:12,046 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:26:12,046 INFO ]: ChcToBoogie initialized [2018-06-22 01:26:12,049 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:26:12" (1/1) ... [2018-06-22 01:26:12,114 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:12 Unit [2018-06-22 01:26:12,115 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:26:12,115 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:26:12,115 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:26:12,115 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:26:12,140 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:12" (1/1) ... [2018-06-22 01:26:12,140 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:12" (1/1) ... [2018-06-22 01:26:12,151 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:12" (1/1) ... [2018-06-22 01:26:12,151 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:12" (1/1) ... [2018-06-22 01:26:12,163 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:12" (1/1) ... [2018-06-22 01:26:12,167 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:12" (1/1) ... [2018-06-22 01:26:12,169 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:12" (1/1) ... [2018-06-22 01:26:12,173 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:26:12,173 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:26:12,173 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:26:12,173 INFO ]: RCFGBuilder initialized [2018-06-22 01:26:12,174 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:12" (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 01:26:12,186 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:26:12,186 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:26:12,186 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:26:12,186 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:26:12,186 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:26:12,187 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 01:26:12,673 INFO ]: Using library mode [2018-06-22 01:26:12,673 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:26:12 BoogieIcfgContainer [2018-06-22 01:26:12,673 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:26:12,675 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:26:12,675 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:26:12,678 INFO ]: TraceAbstraction initialized [2018-06-22 01:26:12,678 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:26:12" (1/3) ... [2018-06-22 01:26:12,679 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210857da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:26:12, skipping insertion in model container [2018-06-22 01:26:12,679 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:12" (2/3) ... [2018-06-22 01:26:12,679 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210857da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:26:12, skipping insertion in model container [2018-06-22 01:26:12,679 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:26:12" (3/3) ... [2018-06-22 01:26:12,681 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:26:12,690 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:26:12,698 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:26:12,733 INFO ]: Using default assertion order modulation [2018-06-22 01:26:12,734 INFO ]: Interprodecural is true [2018-06-22 01:26:12,734 INFO ]: Hoare is false [2018-06-22 01:26:12,734 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:26:12,734 INFO ]: Backedges is TWOTRACK [2018-06-22 01:26:12,734 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:26:12,734 INFO ]: Difference is false [2018-06-22 01:26:12,734 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:26:12,734 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:26:12,755 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:26:12,769 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:26:12,769 INFO ]: Found error trace [2018-06-22 01:26:12,772 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:26:12,772 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:12,776 INFO ]: Analyzing trace with hash 372753301, now seen corresponding path program 1 times [2018-06-22 01:26:12,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:12,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:12,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:12,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:12,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:12,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:12,864 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:12,866 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:12,866 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:26:12,868 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:26:12,879 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:26:12,880 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:26:12,882 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-22 01:26:12,906 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:12,906 INFO ]: Finished difference Result 10 states and 34 transitions. [2018-06-22 01:26:12,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:26:12,907 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:26:12,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:12,921 INFO ]: With dead ends: 10 [2018-06-22 01:26:12,921 INFO ]: Without dead ends: 10 [2018-06-22 01:26:12,923 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 01:26:12,939 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:26:12,956 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:26:12,957 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:26:12,958 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2018-06-22 01:26:12,959 INFO ]: Start accepts. Automaton has 10 states and 34 transitions. Word has length 6 [2018-06-22 01:26:12,960 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:12,960 INFO ]: Abstraction has 10 states and 34 transitions. [2018-06-22 01:26:12,960 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:26:12,960 INFO ]: Start isEmpty. Operand 10 states and 34 transitions. [2018-06-22 01:26:12,960 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:26:12,960 INFO ]: Found error trace [2018-06-22 01:26:12,960 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:12,961 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:12,961 INFO ]: Analyzing trace with hash -1359643980, now seen corresponding path program 1 times [2018-06-22 01:26:12,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:12,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:12,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:12,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:12,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:12,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:13,050 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:13,050 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:13,050 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:13,052 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:13,052 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:13,052 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,052 INFO ]: Start difference. First operand 10 states and 34 transitions. Second operand 3 states. [2018-06-22 01:26:13,182 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:13,182 INFO ]: Finished difference Result 13 states and 36 transitions. [2018-06-22 01:26:13,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:13,183 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:26:13,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:13,185 INFO ]: With dead ends: 13 [2018-06-22 01:26:13,185 INFO ]: Without dead ends: 13 [2018-06-22 01:26:13,185 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,185 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:26:13,188 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-22 01:26:13,188 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:26:13,189 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 30 transitions. [2018-06-22 01:26:13,189 INFO ]: Start accepts. Automaton has 10 states and 30 transitions. Word has length 7 [2018-06-22 01:26:13,189 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:13,189 INFO ]: Abstraction has 10 states and 30 transitions. [2018-06-22 01:26:13,189 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:13,189 INFO ]: Start isEmpty. Operand 10 states and 30 transitions. [2018-06-22 01:26:13,190 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:26:13,190 INFO ]: Found error trace [2018-06-22 01:26:13,190 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:13,190 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:13,190 INFO ]: Analyzing trace with hash -1359554607, now seen corresponding path program 1 times [2018-06-22 01:26:13,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:13,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:13,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:13,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,200 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:13,243 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:13,244 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:13,244 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:13,244 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:13,244 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:13,244 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,244 INFO ]: Start difference. First operand 10 states and 30 transitions. Second operand 3 states. [2018-06-22 01:26:13,397 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:13,397 INFO ]: Finished difference Result 14 states and 44 transitions. [2018-06-22 01:26:13,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:13,398 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:26:13,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:13,399 INFO ]: With dead ends: 14 [2018-06-22 01:26:13,399 INFO ]: Without dead ends: 14 [2018-06-22 01:26:13,399 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,399 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:26:13,404 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:26:13,404 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:26:13,404 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2018-06-22 01:26:13,404 INFO ]: Start accepts. Automaton has 11 states and 38 transitions. Word has length 7 [2018-06-22 01:26:13,405 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:13,405 INFO ]: Abstraction has 11 states and 38 transitions. [2018-06-22 01:26:13,405 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:13,405 INFO ]: Start isEmpty. Operand 11 states and 38 transitions. [2018-06-22 01:26:13,405 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:26:13,405 INFO ]: Found error trace [2018-06-22 01:26:13,405 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:13,405 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:13,405 INFO ]: Analyzing trace with hash -1343795168, now seen corresponding path program 1 times [2018-06-22 01:26:13,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:13,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:13,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:13,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,422 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:13,493 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:13,493 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:13,493 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:13,493 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:13,493 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:13,493 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,493 INFO ]: Start difference. First operand 11 states and 38 transitions. Second operand 3 states. [2018-06-22 01:26:13,550 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:13,550 INFO ]: Finished difference Result 14 states and 43 transitions. [2018-06-22 01:26:13,550 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:13,550 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:26:13,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:13,551 INFO ]: With dead ends: 14 [2018-06-22 01:26:13,551 INFO ]: Without dead ends: 14 [2018-06-22 01:26:13,551 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,552 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:26:13,554 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:26:13,554 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:13,554 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-06-22 01:26:13,554 INFO ]: Start accepts. Automaton has 12 states and 41 transitions. Word has length 7 [2018-06-22 01:26:13,555 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:13,555 INFO ]: Abstraction has 12 states and 41 transitions. [2018-06-22 01:26:13,555 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:13,555 INFO ]: Start isEmpty. Operand 12 states and 41 transitions. [2018-06-22 01:26:13,555 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:26:13,555 INFO ]: Found error trace [2018-06-22 01:26:13,555 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:13,555 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:13,555 INFO ]: Analyzing trace with hash -1343944123, now seen corresponding path program 1 times [2018-06-22 01:26:13,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:13,555 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:13,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:13,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:13,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 01:26:13,580 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:13,580 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:13,580 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:13,581 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:13,581 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,581 INFO ]: Start difference. First operand 12 states and 41 transitions. Second operand 3 states. [2018-06-22 01:26:13,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:13,605 INFO ]: Finished difference Result 14 states and 41 transitions. [2018-06-22 01:26:13,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:13,606 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:26:13,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:13,606 INFO ]: With dead ends: 14 [2018-06-22 01:26:13,606 INFO ]: Without dead ends: 14 [2018-06-22 01:26:13,607 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,607 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:26:13,608 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:26:13,608 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:13,609 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2018-06-22 01:26:13,609 INFO ]: Start accepts. Automaton has 12 states and 39 transitions. Word has length 7 [2018-06-22 01:26:13,609 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:13,609 INFO ]: Abstraction has 12 states and 39 transitions. [2018-06-22 01:26:13,609 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:13,609 INFO ]: Start isEmpty. Operand 12 states and 39 transitions. [2018-06-22 01:26:13,609 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:26:13,609 INFO ]: Found error trace [2018-06-22 01:26:13,609 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:13,609 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:13,609 INFO ]: Analyzing trace with hash 818727622, now seen corresponding path program 1 times [2018-06-22 01:26:13,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:13,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:13,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,611 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:13,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,630 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:13,656 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:13,656 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:13,656 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:13,656 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:13,656 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:13,656 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,656 INFO ]: Start difference. First operand 12 states and 39 transitions. Second operand 3 states. [2018-06-22 01:26:13,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:13,837 INFO ]: Finished difference Result 14 states and 39 transitions. [2018-06-22 01:26:13,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:13,837 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:26:13,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:13,838 INFO ]: With dead ends: 14 [2018-06-22 01:26:13,838 INFO ]: Without dead ends: 12 [2018-06-22 01:26:13,838 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,838 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:26:13,840 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:26:13,840 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:13,840 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2018-06-22 01:26:13,840 INFO ]: Start accepts. Automaton has 12 states and 34 transitions. Word has length 8 [2018-06-22 01:26:13,840 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:13,840 INFO ]: Abstraction has 12 states and 34 transitions. [2018-06-22 01:26:13,840 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:13,840 INFO ]: Start isEmpty. Operand 12 states and 34 transitions. [2018-06-22 01:26:13,841 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:26:13,841 INFO ]: Found error trace [2018-06-22 01:26:13,841 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:13,841 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:13,841 INFO ]: Analyzing trace with hash 820574664, now seen corresponding path program 1 times [2018-06-22 01:26:13,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:13,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:13,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,842 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:13,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:13,902 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:13,902 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:13,902 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:13,902 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:13,902 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:13,902 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,903 INFO ]: Start difference. First operand 12 states and 34 transitions. Second operand 3 states. [2018-06-22 01:26:13,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:13,952 INFO ]: Finished difference Result 14 states and 34 transitions. [2018-06-22 01:26:13,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:13,952 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:26:13,952 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:13,953 INFO ]: With dead ends: 14 [2018-06-22 01:26:13,953 INFO ]: Without dead ends: 12 [2018-06-22 01:26:13,953 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:13,953 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:26:13,954 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:26:13,955 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:13,955 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2018-06-22 01:26:13,955 INFO ]: Start accepts. Automaton has 12 states and 31 transitions. Word has length 8 [2018-06-22 01:26:13,955 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:13,955 INFO ]: Abstraction has 12 states and 31 transitions. [2018-06-22 01:26:13,955 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:13,955 INFO ]: Start isEmpty. Operand 12 states and 31 transitions. [2018-06-22 01:26:13,956 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:26:13,956 INFO ]: Found error trace [2018-06-22 01:26:13,956 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:13,956 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:13,956 INFO ]: Analyzing trace with hash 796622700, now seen corresponding path program 1 times [2018-06-22 01:26:13,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:13,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:13,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,957 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:13,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:13,967 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:14,054 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:14,054 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:14,054 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:26:14,055 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:26:14,055 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:26:14,055 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:26:14,055 INFO ]: Start difference. First operand 12 states and 31 transitions. Second operand 4 states. [2018-06-22 01:26:14,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:14,159 INFO ]: Finished difference Result 17 states and 39 transitions. [2018-06-22 01:26:14,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:26:14,159 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:26:14,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:14,160 INFO ]: With dead ends: 17 [2018-06-22 01:26:14,160 INFO ]: Without dead ends: 17 [2018-06-22 01:26:14,160 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:26:14,160 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:26:14,162 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-06-22 01:26:14,162 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:14,162 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2018-06-22 01:26:14,163 INFO ]: Start accepts. Automaton has 12 states and 30 transitions. Word has length 8 [2018-06-22 01:26:14,163 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:14,163 INFO ]: Abstraction has 12 states and 30 transitions. [2018-06-22 01:26:14,163 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:26:14,163 INFO ]: Start isEmpty. Operand 12 states and 30 transitions. [2018-06-22 01:26:14,163 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:26:14,163 INFO ]: Found error trace [2018-06-22 01:26:14,163 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:14,163 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:14,163 INFO ]: Analyzing trace with hash 770913067, now seen corresponding path program 1 times [2018-06-22 01:26:14,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:14,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:14,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:14,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:14,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:14,174 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:14,204 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:14,204 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:14,204 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:14,204 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:14,204 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:14,204 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:14,205 INFO ]: Start difference. First operand 12 states and 30 transitions. Second operand 3 states. [2018-06-22 01:26:14,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:14,263 INFO ]: Finished difference Result 16 states and 32 transitions. [2018-06-22 01:26:14,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:14,263 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:26:14,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:14,264 INFO ]: With dead ends: 16 [2018-06-22 01:26:14,264 INFO ]: Without dead ends: 16 [2018-06-22 01:26:14,264 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:14,264 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:26:14,266 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-22 01:26:14,266 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:14,266 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-06-22 01:26:14,266 INFO ]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 8 [2018-06-22 01:26:14,267 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:14,267 INFO ]: Abstraction has 12 states and 25 transitions. [2018-06-22 01:26:14,267 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:14,267 INFO ]: Start isEmpty. Operand 12 states and 25 transitions. [2018-06-22 01:26:14,267 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:26:14,267 INFO ]: Found error trace [2018-06-22 01:26:14,267 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:14,267 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:14,267 INFO ]: Analyzing trace with hash 1289782914, now seen corresponding path program 1 times [2018-06-22 01:26:14,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:14,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:14,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:14,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:14,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:14,274 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:14,314 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:14,314 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:14,314 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:14,314 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:14,314 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:14,314 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:14,314 INFO ]: Start difference. First operand 12 states and 25 transitions. Second operand 3 states. [2018-06-22 01:26:14,369 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:14,369 INFO ]: Finished difference Result 15 states and 27 transitions. [2018-06-22 01:26:14,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:14,370 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:26:14,370 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:14,370 INFO ]: With dead ends: 15 [2018-06-22 01:26:14,370 INFO ]: Without dead ends: 14 [2018-06-22 01:26:14,371 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:14,371 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:26:14,372 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:26:14,372 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:14,373 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2018-06-22 01:26:14,373 INFO ]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 8 [2018-06-22 01:26:14,373 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:14,373 INFO ]: Abstraction has 12 states and 23 transitions. [2018-06-22 01:26:14,373 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:14,373 INFO ]: Start isEmpty. Operand 12 states and 23 transitions. [2018-06-22 01:26:14,373 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:26:14,373 INFO ]: Found error trace [2018-06-22 01:26:14,373 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:14,373 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:14,373 INFO ]: Analyzing trace with hash -790448404, now seen corresponding path program 1 times [2018-06-22 01:26:14,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:14,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:14,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:14,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:14,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:14,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:14,423 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:14,423 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:14,423 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:14,423 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:14,423 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:14,423 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:14,423 INFO ]: Start difference. First operand 12 states and 23 transitions. Second operand 3 states. [2018-06-22 01:26:14,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:14,430 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-22 01:26:14,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:14,430 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:26:14,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:14,431 INFO ]: With dead ends: 13 [2018-06-22 01:26:14,431 INFO ]: Without dead ends: 12 [2018-06-22 01:26:14,431 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:14,431 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:26:14,432 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:26:14,432 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:14,433 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-22 01:26:14,433 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 9 [2018-06-22 01:26:14,433 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:14,433 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-22 01:26:14,433 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:14,433 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-22 01:26:14,433 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:26:14,433 INFO ]: Found error trace [2018-06-22 01:26:14,433 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:14,433 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:14,434 INFO ]: Analyzing trace with hash -1076739914, now seen corresponding path program 1 times [2018-06-22 01:26:14,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:14,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:14,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:14,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:14,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:14,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:14,730 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:26:14,731 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:14,731 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:14,731 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:14,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:14,780 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:14,787 INFO ]: Computing forward predicates... [2018-06-22 01:26:15,028 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:15,048 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:15,048 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:26:15,048 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:26:15,048 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:26:15,048 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:26:15,048 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 8 states. [2018-06-22 01:26:15,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:15,255 INFO ]: Finished difference Result 16 states and 23 transitions. [2018-06-22 01:26:15,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:26:15,255 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 01:26:15,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:15,255 INFO ]: With dead ends: 16 [2018-06-22 01:26:15,255 INFO ]: Without dead ends: 14 [2018-06-22 01:26:15,255 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:26:15,256 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:26:15,257 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:26:15,257 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:15,257 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-06-22 01:26:15,257 INFO ]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 9 [2018-06-22 01:26:15,257 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:15,257 INFO ]: Abstraction has 12 states and 18 transitions. [2018-06-22 01:26:15,257 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:26:15,257 INFO ]: Start isEmpty. Operand 12 states and 18 transitions. [2018-06-22 01:26:15,258 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:26:15,258 INFO ]: Found error trace [2018-06-22 01:26:15,258 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:15,258 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:15,258 INFO ]: Analyzing trace with hash -1899388588, now seen corresponding path program 1 times [2018-06-22 01:26:15,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:15,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:15,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:15,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:15,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:15,267 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:15,302 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:26:15,302 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:15,302 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:15,302 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:15,302 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:15,302 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:15,302 INFO ]: Start difference. First operand 12 states and 18 transitions. Second operand 3 states. [2018-06-22 01:26:15,311 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:15,311 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-22 01:26:15,312 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:15,312 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:26:15,312 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:15,312 INFO ]: With dead ends: 15 [2018-06-22 01:26:15,312 INFO ]: Without dead ends: 15 [2018-06-22 01:26:15,313 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:15,313 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:26:15,314 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-22 01:26:15,314 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:26:15,314 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-22 01:26:15,314 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 9 [2018-06-22 01:26:15,314 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:15,315 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-22 01:26:15,315 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:15,315 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-22 01:26:15,315 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:26:15,315 INFO ]: Found error trace [2018-06-22 01:26:15,315 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:15,315 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:15,315 INFO ]: Analyzing trace with hash -1899299215, now seen corresponding path program 1 times [2018-06-22 01:26:15,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:15,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:15,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:15,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:15,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:15,321 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:15,342 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:26:15,342 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:15,343 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:15,343 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:15,343 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:15,343 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:15,343 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 3 states. [2018-06-22 01:26:15,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:15,356 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-22 01:26:15,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:15,356 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:26:15,356 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:15,357 INFO ]: With dead ends: 13 [2018-06-22 01:26:15,357 INFO ]: Without dead ends: 12 [2018-06-22 01:26:15,357 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:15,357 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:26:15,358 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:26:15,358 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:15,358 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:26:15,358 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-06-22 01:26:15,358 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:15,358 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:26:15,358 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:15,358 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:26:15,359 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:26:15,359 INFO ]: Found error trace [2018-06-22 01:26:15,359 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:15,359 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:15,359 INFO ]: Analyzing trace with hash -1895694504, now seen corresponding path program 1 times [2018-06-22 01:26:15,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:15,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:15,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:15,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:15,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:15,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:15,393 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:15,393 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:15,393 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:26:15,393 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:26:15,393 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:26:15,393 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:26:15,393 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2018-06-22 01:26:15,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:15,407 INFO ]: Finished difference Result 11 states and 12 transitions. [2018-06-22 01:26:15,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:26:15,408 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:26:15,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:15,408 INFO ]: With dead ends: 11 [2018-06-22 01:26:15,408 INFO ]: Without dead ends: 11 [2018-06-22 01:26:15,408 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:26:15,408 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:26:15,409 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:26:15,409 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:26:15,409 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-22 01:26:15,409 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2018-06-22 01:26:15,409 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:15,409 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-22 01:26:15,409 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:26:15,409 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-22 01:26:15,410 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:26:15,410 INFO ]: Found error trace [2018-06-22 01:26:15,410 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:15,410 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:15,410 INFO ]: Analyzing trace with hash 1697857847, now seen corresponding path program 1 times [2018-06-22 01:26:15,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:15,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:15,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:15,411 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:15,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:15,419 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:15,530 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:15,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:15,530 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 01:26:15,538 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:15,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:15,554 INFO ]: Computing forward predicates... [2018-06-22 01:26:15,856 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:15,875 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:15,875 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 01:26:15,875 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:26:15,875 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:26:15,875 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:26:15,875 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-06-22 01:26:16,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:16,124 INFO ]: Finished difference Result 18 states and 21 transitions. [2018-06-22 01:26:16,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:26:16,124 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-22 01:26:16,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:16,124 INFO ]: With dead ends: 18 [2018-06-22 01:26:16,124 INFO ]: Without dead ends: 18 [2018-06-22 01:26:16,125 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:26:16,125 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:26:16,126 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-06-22 01:26:16,126 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:26:16,126 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-22 01:26:16,126 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-22 01:26:16,126 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:16,126 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-22 01:26:16,126 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:26:16,126 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-22 01:26:16,126 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:26:16,126 INFO ]: Found error trace [2018-06-22 01:26:16,126 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:16,127 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:16,127 INFO ]: Analyzing trace with hash 1091745867, now seen corresponding path program 2 times [2018-06-22 01:26:16,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:16,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:16,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:16,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:16,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:16,138 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:16,251 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:16,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:16,251 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) [2018-06-22 01:26:16,265 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:16,306 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:26:16,306 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:16,308 INFO ]: Computing forward predicates... [2018-06-22 01:26:16,547 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:16,567 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:16,567 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:26:16,567 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:26:16,567 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:26:16,567 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:26:16,567 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 12 states. [2018-06-22 01:26:16,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:16,673 INFO ]: Finished difference Result 16 states and 18 transitions. [2018-06-22 01:26:16,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:26:16,674 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-22 01:26:16,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:16,674 INFO ]: With dead ends: 16 [2018-06-22 01:26:16,674 INFO ]: Without dead ends: 13 [2018-06-22 01:26:16,674 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:26:16,674 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:26:16,676 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:26:16,676 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:26:16,676 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-22 01:26:16,676 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-06-22 01:26:16,676 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:16,676 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-22 01:26:16,676 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:26:16,676 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-22 01:26:16,677 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:26:16,677 INFO ]: Found error trace [2018-06-22 01:26:16,677 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:16,677 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:16,677 INFO ]: Analyzing trace with hash 305503372, now seen corresponding path program 3 times [2018-06-22 01:26:16,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:16,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:16,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:16,678 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:16,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:16,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:16,822 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:16,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:16,822 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:16,833 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:26:16,870 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:26:16,870 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:16,873 INFO ]: Computing forward predicates... [2018-06-22 01:26:17,140 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 01:26:17,189 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:17,222 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:17,222 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 01:26:17,222 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:26:17,222 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:26:17,222 INFO ]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:26:17,222 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 14 states. [2018-06-22 01:26:17,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:17,520 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-22 01:26:17,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:26:17,520 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-22 01:26:17,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:17,521 INFO ]: With dead ends: 21 [2018-06-22 01:26:17,521 INFO ]: Without dead ends: 21 [2018-06-22 01:26:17,521 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:26:17,521 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:26:17,522 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-06-22 01:26:17,522 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:26:17,523 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-22 01:26:17,523 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-22 01:26:17,523 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:17,523 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-22 01:26:17,523 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:26:17,523 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-22 01:26:17,523 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:26:17,523 INFO ]: Found error trace [2018-06-22 01:26:17,523 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:17,523 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:17,523 INFO ]: Analyzing trace with hash 878430102, now seen corresponding path program 4 times [2018-06-22 01:26:17,523 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:17,523 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:17,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:17,524 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:17,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:17,535 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:17,624 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:17,624 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:17,624 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:17,632 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:26:17,670 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:26:17,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:17,673 INFO ]: Computing forward predicates... [2018-06-22 01:26:18,236 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:18,256 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:18,257 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:26:18,257 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:26:18,257 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:26:18,257 INFO ]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:26:18,257 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 16 states. [2018-06-22 01:26:18,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:18,399 INFO ]: Finished difference Result 19 states and 21 transitions. [2018-06-22 01:26:18,399 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:26:18,399 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-22 01:26:18,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:18,400 INFO ]: With dead ends: 19 [2018-06-22 01:26:18,400 INFO ]: Without dead ends: 15 [2018-06-22 01:26:18,400 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:26:18,400 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:26:18,401 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:26:18,401 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:26:18,403 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-22 01:26:18,403 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-22 01:26:18,403 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:18,403 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-22 01:26:18,404 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:26:18,404 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-22 01:26:18,404 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:26:18,404 INFO ]: Found error trace [2018-06-22 01:26:18,404 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:18,404 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:18,404 INFO ]: Analyzing trace with hash 1213636503, now seen corresponding path program 5 times [2018-06-22 01:26:18,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:18,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:18,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:18,405 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:18,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:18,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:18,579 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:18,579 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:18,579 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:18,584 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:26:18,603 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:26:18,603 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:18,606 INFO ]: Computing forward predicates... [2018-06-22 01:26:18,784 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:18,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:18,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 01:26:18,805 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:26:18,805 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:26:18,805 INFO ]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:26:18,805 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 18 states. [2018-06-22 01:26:19,312 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:19,312 INFO ]: Finished difference Result 24 states and 27 transitions. [2018-06-22 01:26:19,312 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:26:19,312 INFO ]: Start accepts. Automaton has 18 states. Word has length 14 [2018-06-22 01:26:19,312 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:19,313 INFO ]: With dead ends: 24 [2018-06-22 01:26:19,313 INFO ]: Without dead ends: 24 [2018-06-22 01:26:19,313 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:26:19,313 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:26:19,315 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-06-22 01:26:19,315 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:26:19,315 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-22 01:26:19,315 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-22 01:26:19,316 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:19,316 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-22 01:26:19,316 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:26:19,316 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-22 01:26:19,316 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:26:19,316 INFO ]: Found error trace [2018-06-22 01:26:19,316 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:19,316 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:19,316 INFO ]: Analyzing trace with hash -1034213909, now seen corresponding path program 6 times [2018-06-22 01:26:19,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:19,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:19,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:19,317 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:19,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:19,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:19,688 INFO ]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:19,688 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:19,688 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:19,694 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:26:19,711 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:26:19,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:19,714 INFO ]: Computing forward predicates... [2018-06-22 01:26:19,908 INFO ]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:19,926 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:19,926 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-22 01:26:19,927 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:26:19,927 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:26:19,927 INFO ]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:26:19,927 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 20 states. [2018-06-22 01:26:20,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:20,132 INFO ]: Finished difference Result 22 states and 24 transitions. [2018-06-22 01:26:20,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:26:20,133 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-22 01:26:20,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:20,133 INFO ]: With dead ends: 22 [2018-06-22 01:26:20,133 INFO ]: Without dead ends: 17 [2018-06-22 01:26:20,133 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:26:20,133 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:26:20,134 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:26:20,134 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:26:20,134 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-22 01:26:20,134 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-06-22 01:26:20,134 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:20,134 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-22 01:26:20,134 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:26:20,135 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-22 01:26:20,135 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:26:20,135 INFO ]: Found error trace [2018-06-22 01:26:20,135 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:20,135 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:20,135 INFO ]: Analyzing trace with hash -1023409748, now seen corresponding path program 7 times [2018-06-22 01:26:20,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:20,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:20,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:20,136 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:20,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:20,151 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:20,352 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:20,352 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:20,352 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:20,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:20,387 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:20,390 INFO ]: Computing forward predicates... [2018-06-22 01:26:20,830 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:20,849 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:20,849 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 01:26:20,849 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:26:20,850 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:26:20,850 INFO ]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:26:20,850 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 22 states. [2018-06-22 01:26:21,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:21,258 INFO ]: Finished difference Result 27 states and 30 transitions. [2018-06-22 01:26:21,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:26:21,259 INFO ]: Start accepts. Automaton has 22 states. Word has length 16 [2018-06-22 01:26:21,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:21,259 INFO ]: With dead ends: 27 [2018-06-22 01:26:21,259 INFO ]: Without dead ends: 27 [2018-06-22 01:26:21,260 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:26:21,260 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:26:21,261 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-06-22 01:26:21,261 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:26:21,262 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-22 01:26:21,262 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-22 01:26:21,262 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:21,262 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-22 01:26:21,262 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:26:21,262 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-22 01:26:21,262 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:26:21,262 INFO ]: Found error trace [2018-06-22 01:26:21,262 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:21,262 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:21,262 INFO ]: Analyzing trace with hash -1663170954, now seen corresponding path program 8 times [2018-06-22 01:26:21,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:21,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:21,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:21,264 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:21,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:21,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:21,551 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:21,551 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:21,551 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:21,559 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:26:21,579 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:26:21,579 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:21,582 INFO ]: Computing forward predicates... [2018-06-22 01:26:21,815 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:21,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:21,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 01:26:21,834 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:26:21,834 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:26:21,834 INFO ]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:26:21,834 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 24 states. [2018-06-22 01:26:22,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:22,003 INFO ]: Finished difference Result 25 states and 27 transitions. [2018-06-22 01:26:22,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:26:22,003 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-22 01:26:22,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:22,004 INFO ]: With dead ends: 25 [2018-06-22 01:26:22,004 INFO ]: Without dead ends: 19 [2018-06-22 01:26:22,004 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:26:22,004 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:26:22,005 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:26:22,005 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:26:22,005 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 01:26:22,005 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-22 01:26:22,006 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:22,006 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 01:26:22,006 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:26:22,006 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 01:26:22,006 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:26:22,006 INFO ]: Found error trace [2018-06-22 01:26:22,006 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:22,006 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:22,006 INFO ]: Analyzing trace with hash 129693175, now seen corresponding path program 9 times [2018-06-22 01:26:22,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:22,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:22,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:22,007 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:22,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:22,019 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:22,203 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:22,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:22,203 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:22,209 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:26:22,231 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:26:22,231 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:22,234 INFO ]: Computing forward predicates... [2018-06-22 01:26:22,467 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:22,493 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:22,493 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-22 01:26:22,494 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:26:22,494 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:26:22,494 INFO ]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:26:22,494 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 26 states. [2018-06-22 01:26:22,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:22,877 INFO ]: Finished difference Result 30 states and 33 transitions. [2018-06-22 01:26:22,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:26:22,878 INFO ]: Start accepts. Automaton has 26 states. Word has length 18 [2018-06-22 01:26:22,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:22,878 INFO ]: With dead ends: 30 [2018-06-22 01:26:22,879 INFO ]: Without dead ends: 30 [2018-06-22 01:26:22,879 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=1048, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:26:22,879 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:26:22,880 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-06-22 01:26:22,880 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:26:22,880 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-22 01:26:22,881 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-22 01:26:22,881 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:22,881 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-22 01:26:22,881 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:26:22,881 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-22 01:26:22,881 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:26:22,881 INFO ]: Found error trace [2018-06-22 01:26:22,881 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:22,881 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:22,881 INFO ]: Analyzing trace with hash -276718709, now seen corresponding path program 10 times [2018-06-22 01:26:22,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:22,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:22,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:22,882 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:22,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:22,905 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:23,112 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:23,112 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:23,112 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:23,118 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:26:23,152 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:26:23,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:23,156 INFO ]: Computing forward predicates... [2018-06-22 01:26:23,480 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:23,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:23,499 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-22 01:26:23,500 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:26:23,500 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:26:23,500 INFO ]: CoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:26:23,500 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 28 states. [2018-06-22 01:26:23,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:23,807 INFO ]: Finished difference Result 28 states and 30 transitions. [2018-06-22 01:26:23,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:26:23,807 INFO ]: Start accepts. Automaton has 28 states. Word has length 19 [2018-06-22 01:26:23,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:23,807 INFO ]: With dead ends: 28 [2018-06-22 01:26:23,807 INFO ]: Without dead ends: 21 [2018-06-22 01:26:23,808 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=944, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:26:23,808 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:26:23,809 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:26:23,809 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:26:23,809 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 01:26:23,809 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-06-22 01:26:23,809 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:23,809 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 01:26:23,809 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:26:23,810 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 01:26:23,810 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:26:23,810 INFO ]: Found error trace [2018-06-22 01:26:23,810 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:23,810 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:23,810 INFO ]: Analyzing trace with hash 383823564, now seen corresponding path program 11 times [2018-06-22 01:26:23,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:23,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:23,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:23,811 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:23,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:23,825 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:24,241 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:24,241 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:24,241 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:24,247 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:26:24,276 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:26:24,276 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:24,280 INFO ]: Computing forward predicates... [2018-06-22 01:26:24,727 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:24,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:24,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-06-22 01:26:24,747 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:26:24,748 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:26:24,748 INFO ]: CoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:26:24,748 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 30 states. [2018-06-22 01:26:25,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:25,294 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-22 01:26:25,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:26:25,294 INFO ]: Start accepts. Automaton has 30 states. Word has length 20 [2018-06-22 01:26:25,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:25,294 INFO ]: With dead ends: 33 [2018-06-22 01:26:25,294 INFO ]: Without dead ends: 33 [2018-06-22 01:26:25,295 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=470, Invalid=1422, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:26:25,295 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:26:25,296 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-06-22 01:26:25,296 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:26:25,297 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-22 01:26:25,297 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-06-22 01:26:25,297 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:25,297 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-22 01:26:25,297 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:26:25,297 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-22 01:26:25,297 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:26:25,297 INFO ]: Found error trace [2018-06-22 01:26:25,297 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:25,297 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:25,297 INFO ]: Analyzing trace with hash -988611242, now seen corresponding path program 12 times [2018-06-22 01:26:25,297 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:25,297 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:25,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:25,298 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:25,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:25,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:25,566 INFO ]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:25,566 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:25,566 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:26:25,582 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:25,611 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:26:25,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:25,615 INFO ]: Computing forward predicates... [2018-06-22 01:26:25,902 INFO ]: Checked inductivity of 49 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:26:25,921 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:25,921 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2018-06-22 01:26:25,922 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:26:25,922 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:26:25,922 INFO ]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:26:25,922 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 25 states. [2018-06-22 01:26:26,304 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 01:26:26,916 WARN ]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 01:26:27,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:27,085 INFO ]: Finished difference Result 31 states and 33 transitions. [2018-06-22 01:26:27,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:26:27,085 INFO ]: Start accepts. Automaton has 25 states. Word has length 21 [2018-06-22 01:26:27,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:27,085 INFO ]: With dead ends: 31 [2018-06-22 01:26:27,085 INFO ]: Without dead ends: 23 [2018-06-22 01:26:27,085 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:26:27,085 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:26:27,086 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 01:26:27,087 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:26:27,087 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-22 01:26:27,087 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2018-06-22 01:26:27,087 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:27,087 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-22 01:26:27,087 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:26:27,087 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-22 01:26:27,087 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:26:27,087 INFO ]: Found error trace [2018-06-22 01:26:27,087 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:27,087 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:27,088 INFO ]: Analyzing trace with hash -1862646697, now seen corresponding path program 13 times [2018-06-22 01:26:27,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:27,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:27,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:27,088 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:27,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:27,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:28,560 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:28,560 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:28,560 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:28,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:28,593 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:28,597 INFO ]: Computing forward predicates... [2018-06-22 01:26:29,327 WARN ]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:26:29,873 WARN ]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:26:30,030 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:30,050 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:30,050 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-22 01:26:30,050 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:26:30,050 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:26:30,051 INFO ]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:26:30,051 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2018-06-22 01:26:30,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:30,742 INFO ]: Finished difference Result 36 states and 39 transitions. [2018-06-22 01:26:30,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:26:30,742 INFO ]: Start accepts. Automaton has 34 states. Word has length 22 [2018-06-22 01:26:30,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:30,742 INFO ]: With dead ends: 36 [2018-06-22 01:26:30,742 INFO ]: Without dead ends: 36 [2018-06-22 01:26:30,743 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=597, Invalid=1853, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:26:30,743 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:26:30,744 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 24. [2018-06-22 01:26:30,744 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:26:30,744 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-22 01:26:30,745 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-22 01:26:30,745 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:30,745 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-22 01:26:30,745 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:26:30,745 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-22 01:26:30,745 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:26:30,745 INFO ]: Found error trace [2018-06-22 01:26:30,745 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:30,745 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:30,745 INFO ]: Analyzing trace with hash -1909712597, now seen corresponding path program 14 times [2018-06-22 01:26:30,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:30,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:30,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:30,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:30,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:30,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:30,996 INFO ]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:30,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:30,996 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:31,002 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:26:31,043 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:26:31,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:31,049 INFO ]: Computing forward predicates... [2018-06-22 01:26:32,232 WARN ]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:26:32,862 INFO ]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:32,882 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:32,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-22 01:26:32,882 INFO ]: Interpolant automaton has 36 states [2018-06-22 01:26:32,882 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 01:26:32,883 INFO ]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:26:32,883 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 36 states. [2018-06-22 01:26:33,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:33,184 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-22 01:26:33,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:26:33,184 INFO ]: Start accepts. Automaton has 36 states. Word has length 23 [2018-06-22 01:26:33,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:33,184 INFO ]: With dead ends: 34 [2018-06-22 01:26:33,184 INFO ]: Without dead ends: 25 [2018-06-22 01:26:33,185 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=388, Invalid=1592, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:26:33,185 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:26:33,186 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 01:26:33,186 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:26:33,187 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-22 01:26:33,187 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-06-22 01:26:33,187 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:33,187 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-22 01:26:33,187 INFO ]: Interpolant automaton has 36 states. [2018-06-22 01:26:33,187 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-22 01:26:33,187 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:26:33,187 INFO ]: Found error trace [2018-06-22 01:26:33,187 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:33,188 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:33,188 INFO ]: Analyzing trace with hash -44194836, now seen corresponding path program 15 times [2018-06-22 01:26:33,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:33,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:33,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:33,188 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:33,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:33,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:33,490 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:33,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:33,490 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:33,496 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:26:33,530 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:26:33,530 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:33,534 INFO ]: Computing forward predicates... [2018-06-22 01:26:34,298 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:34,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:34,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-06-22 01:26:34,342 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:26:34,342 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:26:34,342 INFO ]: CoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:26:34,343 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 38 states. [2018-06-22 01:26:35,396 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:35,397 INFO ]: Finished difference Result 39 states and 42 transitions. [2018-06-22 01:26:35,397 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:26:35,397 INFO ]: Start accepts. Automaton has 38 states. Word has length 24 [2018-06-22 01:26:35,397 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:35,397 INFO ]: With dead ends: 39 [2018-06-22 01:26:35,397 INFO ]: Without dead ends: 39 [2018-06-22 01:26:35,398 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=739, Invalid=2341, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:26:35,398 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:26:35,399 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-06-22 01:26:35,399 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:26:35,399 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-22 01:26:35,399 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-22 01:26:35,399 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:35,400 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-22 01:26:35,400 INFO ]: Interpolant automaton has 38 states. [2018-06-22 01:26:35,400 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-22 01:26:35,400 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:26:35,400 INFO ]: Found error trace [2018-06-22 01:26:35,400 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:35,400 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:35,400 INFO ]: Analyzing trace with hash -1372279754, now seen corresponding path program 16 times [2018-06-22 01:26:35,400 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:35,400 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:35,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:35,401 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:35,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:35,416 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:35,702 INFO ]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:35,702 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:35,702 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:35,708 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:26:35,738 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:26:35,738 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:35,744 INFO ]: Computing forward predicates... [2018-06-22 01:26:36,340 INFO ]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:36,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:36,359 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-06-22 01:26:36,359 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:26:36,359 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:26:36,359 INFO ]: CoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:26:36,359 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 40 states. [2018-06-22 01:26:36,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:36,662 INFO ]: Finished difference Result 37 states and 39 transitions. [2018-06-22 01:26:36,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:26:36,667 INFO ]: Start accepts. Automaton has 40 states. Word has length 25 [2018-06-22 01:26:36,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:36,667 INFO ]: With dead ends: 37 [2018-06-22 01:26:36,667 INFO ]: Without dead ends: 27 [2018-06-22 01:26:36,668 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=471, Invalid=1979, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:26:36,668 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:26:36,669 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:26:36,669 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:26:36,669 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-22 01:26:36,669 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-06-22 01:26:36,669 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:36,669 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-22 01:26:36,669 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:26:36,669 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-22 01:26:36,670 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:26:36,670 INFO ]: Found error trace [2018-06-22 01:26:36,670 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:36,670 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:36,670 INFO ]: Analyzing trace with hash 388926135, now seen corresponding path program 17 times [2018-06-22 01:26:36,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:36,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:36,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:36,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:36,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:36,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:37,026 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:37,026 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:37,026 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:37,033 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:26:37,071 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:26:37,071 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:37,077 INFO ]: Computing forward predicates... [2018-06-22 01:26:37,535 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:37,556 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:37,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-06-22 01:26:37,556 INFO ]: Interpolant automaton has 42 states [2018-06-22 01:26:37,556 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 01:26:37,556 INFO ]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:26:37,556 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 42 states. [2018-06-22 01:26:38,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:38,353 INFO ]: Finished difference Result 42 states and 45 transitions. [2018-06-22 01:26:38,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:26:38,354 INFO ]: Start accepts. Automaton has 42 states. Word has length 26 [2018-06-22 01:26:38,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:38,354 INFO ]: With dead ends: 42 [2018-06-22 01:26:38,354 INFO ]: Without dead ends: 42 [2018-06-22 01:26:38,355 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=896, Invalid=2886, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 01:26:38,355 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:26:38,357 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 28. [2018-06-22 01:26:38,357 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:26:38,357 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-22 01:26:38,357 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-22 01:26:38,357 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:38,357 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-22 01:26:38,357 INFO ]: Interpolant automaton has 42 states. [2018-06-22 01:26:38,357 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-22 01:26:38,358 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:26:38,358 INFO ]: Found error trace [2018-06-22 01:26:38,358 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:38,358 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:38,358 INFO ]: Analyzing trace with hash -830431541, now seen corresponding path program 18 times [2018-06-22 01:26:38,358 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:38,358 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:38,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:38,358 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:38,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:38,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:38,929 INFO ]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:38,929 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:38,929 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:38,935 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:26:38,970 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:26:38,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:38,976 INFO ]: Computing forward predicates... [2018-06-22 01:26:39,147 INFO ]: Checked inductivity of 100 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:26:39,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:39,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2018-06-22 01:26:39,168 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:26:39,168 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:26:39,169 INFO ]: CoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:26:39,169 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 34 states. [2018-06-22 01:26:39,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:39,508 INFO ]: Finished difference Result 40 states and 42 transitions. [2018-06-22 01:26:39,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:26:39,531 INFO ]: Start accepts. Automaton has 34 states. Word has length 27 [2018-06-22 01:26:39,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:39,531 INFO ]: With dead ends: 40 [2018-06-22 01:26:39,531 INFO ]: Without dead ends: 29 [2018-06-22 01:26:39,532 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=371, Invalid=1521, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:26:39,532 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:26:39,534 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 01:26:39,534 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:26:39,534 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-22 01:26:39,534 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-06-22 01:26:39,534 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:39,534 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-22 01:26:39,534 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:26:39,534 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-22 01:26:39,535 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:26:39,535 INFO ]: Found error trace [2018-06-22 01:26:39,535 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:39,535 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:39,535 INFO ]: Analyzing trace with hash -528686836, now seen corresponding path program 19 times [2018-06-22 01:26:39,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:39,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:39,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:39,536 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:39,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:39,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:39,859 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:39,859 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:39,859 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:39,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:39,898 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:39,903 INFO ]: Computing forward predicates... [2018-06-22 01:26:40,451 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:40,471 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:40,471 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-06-22 01:26:40,472 INFO ]: Interpolant automaton has 46 states [2018-06-22 01:26:40,472 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 01:26:40,472 INFO ]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:26:40,472 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 46 states. [2018-06-22 01:26:41,613 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-06-22 01:26:41,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:41,768 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-22 01:26:41,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:26:41,773 INFO ]: Start accepts. Automaton has 46 states. Word has length 28 [2018-06-22 01:26:41,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:41,773 INFO ]: With dead ends: 45 [2018-06-22 01:26:41,773 INFO ]: Without dead ends: 45 [2018-06-22 01:26:41,775 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1068, Invalid=3488, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 01:26:41,775 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:26:41,776 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-06-22 01:26:41,776 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:26:41,776 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-22 01:26:41,776 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-22 01:26:41,776 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:41,776 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-22 01:26:41,776 INFO ]: Interpolant automaton has 46 states. [2018-06-22 01:26:41,776 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-22 01:26:41,777 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:26:41,777 INFO ]: Found error trace [2018-06-22 01:26:41,777 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:41,777 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:41,777 INFO ]: Analyzing trace with hash 788337430, now seen corresponding path program 20 times [2018-06-22 01:26:41,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:41,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:41,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:41,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:41,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:41,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:42,533 INFO ]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:42,533 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:42,533 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:42,539 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:26:42,574 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:26:42,574 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:42,580 INFO ]: Computing forward predicates... [2018-06-22 01:26:43,095 INFO ]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:43,115 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:43,115 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-06-22 01:26:43,115 INFO ]: Interpolant automaton has 48 states [2018-06-22 01:26:43,115 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 01:26:43,115 INFO ]: CoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:26:43,115 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 48 states. [2018-06-22 01:26:43,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:43,610 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-22 01:26:43,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:26:43,610 INFO ]: Start accepts. Automaton has 48 states. Word has length 29 [2018-06-22 01:26:43,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:43,610 INFO ]: With dead ends: 43 [2018-06-22 01:26:43,610 INFO ]: Without dead ends: 31 [2018-06-22 01:26:43,611 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=661, Invalid=2879, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 01:26:43,611 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:26:43,611 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 01:26:43,612 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:26:43,612 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-22 01:26:43,612 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-06-22 01:26:43,612 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:43,612 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-22 01:26:43,612 INFO ]: Interpolant automaton has 48 states. [2018-06-22 01:26:43,612 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-22 01:26:43,612 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:26:43,612 INFO ]: Found error trace [2018-06-22 01:26:43,612 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:43,612 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:43,613 INFO ]: Analyzing trace with hash -1292777193, now seen corresponding path program 21 times [2018-06-22 01:26:43,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:43,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:43,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:43,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:43,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:43,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:44,084 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:44,084 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:44,084 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:44,089 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:26:44,132 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:26:44,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:44,136 INFO ]: Computing forward predicates... [2018-06-22 01:26:44,837 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:44,856 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:44,856 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-06-22 01:26:44,856 INFO ]: Interpolant automaton has 50 states [2018-06-22 01:26:44,856 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 01:26:44,856 INFO ]: CoverageRelationStatistics Valid=451, Invalid=1999, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:26:44,856 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 50 states. [2018-06-22 01:26:45,887 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:45,887 INFO ]: Finished difference Result 48 states and 51 transitions. [2018-06-22 01:26:45,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:26:45,887 INFO ]: Start accepts. Automaton has 50 states. Word has length 30 [2018-06-22 01:26:45,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:45,887 INFO ]: With dead ends: 48 [2018-06-22 01:26:45,887 INFO ]: Without dead ends: 48 [2018-06-22 01:26:45,889 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1255, Invalid=4147, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 01:26:45,889 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:26:45,890 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 32. [2018-06-22 01:26:45,890 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:26:45,890 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-22 01:26:45,890 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-22 01:26:45,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:45,890 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-22 01:26:45,890 INFO ]: Interpolant automaton has 50 states. [2018-06-22 01:26:45,890 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-22 01:26:45,891 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:26:45,891 INFO ]: Found error trace [2018-06-22 01:26:45,891 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:45,891 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:45,891 INFO ]: Analyzing trace with hash -1423627157, now seen corresponding path program 22 times [2018-06-22 01:26:45,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:45,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:45,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:45,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:45,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:45,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:46,220 INFO ]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:46,220 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:46,220 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:46,231 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:26:46,269 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:26:46,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:46,274 INFO ]: Computing forward predicates... [2018-06-22 01:26:47,124 INFO ]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:47,143 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:47,143 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-06-22 01:26:47,143 INFO ]: Interpolant automaton has 52 states [2018-06-22 01:26:47,143 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 01:26:47,144 INFO ]: CoverageRelationStatistics Valid=456, Invalid=2196, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:26:47,144 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 52 states. [2018-06-22 01:26:47,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:47,657 INFO ]: Finished difference Result 46 states and 48 transitions. [2018-06-22 01:26:47,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:26:47,657 INFO ]: Start accepts. Automaton has 52 states. Word has length 31 [2018-06-22 01:26:47,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:47,657 INFO ]: With dead ends: 46 [2018-06-22 01:26:47,657 INFO ]: Without dead ends: 33 [2018-06-22 01:26:47,658 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=768, Invalid=3392, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 01:26:47,658 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:26:47,659 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:26:47,659 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:26:47,659 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-22 01:26:47,659 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-06-22 01:26:47,659 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:47,659 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-22 01:26:47,659 INFO ]: Interpolant automaton has 52 states. [2018-06-22 01:26:47,659 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-22 01:26:47,660 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:26:47,660 INFO ]: Found error trace [2018-06-22 01:26:47,660 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:47,660 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:47,660 INFO ]: Analyzing trace with hash 79980076, now seen corresponding path program 23 times [2018-06-22 01:26:47,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:47,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:47,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:47,660 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:47,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:47,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:48,494 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:48,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:48,494 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:48,499 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:26:48,551 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:26:48,551 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:48,555 INFO ]: Computing forward predicates... [2018-06-22 01:26:49,193 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:49,212 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:49,212 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-06-22 01:26:49,212 INFO ]: Interpolant automaton has 54 states [2018-06-22 01:26:49,212 INFO ]: Constructing interpolant automaton starting with 54 interpolants. [2018-06-22 01:26:49,213 INFO ]: CoverageRelationStatistics Valid=521, Invalid=2341, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:26:49,213 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 54 states. [2018-06-22 01:26:50,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:50,361 INFO ]: Finished difference Result 51 states and 54 transitions. [2018-06-22 01:26:50,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:26:50,363 INFO ]: Start accepts. Automaton has 54 states. Word has length 32 [2018-06-22 01:26:50,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:50,363 INFO ]: With dead ends: 51 [2018-06-22 01:26:50,363 INFO ]: Without dead ends: 51 [2018-06-22 01:26:50,363 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1457, Invalid=4863, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 01:26:50,364 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:26:50,366 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-06-22 01:26:50,366 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:26:50,366 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-22 01:26:50,366 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-06-22 01:26:50,367 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:50,367 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-22 01:26:50,367 INFO ]: Interpolant automaton has 54 states. [2018-06-22 01:26:50,367 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-22 01:26:50,367 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:26:50,367 INFO ]: Found error trace [2018-06-22 01:26:50,367 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:50,367 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:50,367 INFO ]: Analyzing trace with hash -1817824778, now seen corresponding path program 24 times [2018-06-22 01:26:50,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:50,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:50,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:50,368 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:50,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:50,391 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:50,772 INFO ]: Checked inductivity of 169 backedges. 78 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:50,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:50,772 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:50,780 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:26:50,827 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:26:50,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:50,835 INFO ]: Computing forward predicates... [2018-06-22 01:26:51,123 INFO ]: Checked inductivity of 169 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 01:26:51,142 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:51,142 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16] total 43 [2018-06-22 01:26:51,142 INFO ]: Interpolant automaton has 43 states [2018-06-22 01:26:51,142 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 01:26:51,142 INFO ]: CoverageRelationStatistics Valid=331, Invalid=1475, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:26:51,143 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 43 states. [2018-06-22 01:26:51,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:51,640 INFO ]: Finished difference Result 49 states and 51 transitions. [2018-06-22 01:26:51,643 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:26:51,643 INFO ]: Start accepts. Automaton has 43 states. Word has length 33 [2018-06-22 01:26:51,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:51,644 INFO ]: With dead ends: 49 [2018-06-22 01:26:51,644 INFO ]: Without dead ends: 35 [2018-06-22 01:26:51,644 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=578, Invalid=2502, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:26:51,644 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:26:51,645 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 01:26:51,645 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:26:51,645 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-22 01:26:51,645 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2018-06-22 01:26:51,645 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:51,645 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-22 01:26:51,645 INFO ]: Interpolant automaton has 43 states. [2018-06-22 01:26:51,645 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-22 01:26:51,645 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:26:51,645 INFO ]: Found error trace [2018-06-22 01:26:51,645 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:51,645 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:51,645 INFO ]: Analyzing trace with hash 39714679, now seen corresponding path program 25 times [2018-06-22 01:26:51,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:51,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:51,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:51,646 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:51,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:51,672 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:52,308 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:52,308 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:52,308 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:52,314 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:52,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:52,364 INFO ]: Computing forward predicates... [2018-06-22 01:26:53,186 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:53,206 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:53,206 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-06-22 01:26:53,206 INFO ]: Interpolant automaton has 58 states [2018-06-22 01:26:53,206 INFO ]: Constructing interpolant automaton starting with 58 interpolants. [2018-06-22 01:26:53,206 INFO ]: CoverageRelationStatistics Valid=596, Invalid=2710, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 01:26:53,206 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 58 states. [2018-06-22 01:26:54,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:54,517 INFO ]: Finished difference Result 54 states and 57 transitions. [2018-06-22 01:26:54,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 01:26:54,518 INFO ]: Start accepts. Automaton has 58 states. Word has length 34 [2018-06-22 01:26:54,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:54,518 INFO ]: With dead ends: 54 [2018-06-22 01:26:54,518 INFO ]: Without dead ends: 54 [2018-06-22 01:26:54,519 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1674, Invalid=5636, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 01:26:54,519 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:26:54,519 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 36. [2018-06-22 01:26:54,519 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:26:54,519 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-22 01:26:54,520 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-22 01:26:54,520 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:54,520 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-22 01:26:54,520 INFO ]: Interpolant automaton has 58 states. [2018-06-22 01:26:54,520 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-22 01:26:54,520 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:26:54,520 INFO ]: Found error trace [2018-06-22 01:26:54,520 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:54,520 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:54,520 INFO ]: Analyzing trace with hash 1228915211, now seen corresponding path program 26 times [2018-06-22 01:26:54,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:54,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:54,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:54,521 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:54,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:54,544 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:55,220 INFO ]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:55,221 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:55,221 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:55,227 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:26:55,299 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:26:55,299 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:55,308 INFO ]: Computing forward predicates... [2018-06-22 01:26:56,252 INFO ]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:56,271 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:56,271 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2018-06-22 01:26:56,271 INFO ]: Interpolant automaton has 60 states [2018-06-22 01:26:56,272 INFO ]: Constructing interpolant automaton starting with 60 interpolants. [2018-06-22 01:26:56,272 INFO ]: CoverageRelationStatistics Valid=601, Invalid=2939, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 01:26:56,272 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 60 states. [2018-06-22 01:26:56,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:56,954 INFO ]: Finished difference Result 52 states and 54 transitions. [2018-06-22 01:26:56,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:26:56,954 INFO ]: Start accepts. Automaton has 60 states. Word has length 35 [2018-06-22 01:26:56,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:56,954 INFO ]: With dead ends: 52 [2018-06-22 01:26:56,954 INFO ]: Without dead ends: 37 [2018-06-22 01:26:56,955 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1006, Invalid=4544, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 01:26:56,955 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:26:56,956 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-22 01:26:56,956 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:26:56,957 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-22 01:26:56,957 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-06-22 01:26:56,957 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:56,957 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-22 01:26:56,957 INFO ]: Interpolant automaton has 60 states. [2018-06-22 01:26:56,957 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-22 01:26:56,957 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:26:56,957 INFO ]: Found error trace [2018-06-22 01:26:56,957 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:56,957 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:56,957 INFO ]: Analyzing trace with hash -382061748, now seen corresponding path program 27 times [2018-06-22 01:26:56,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:56,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:56,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:56,958 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:26:56,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:56,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:58,125 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:58,125 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:26:58,125 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:26:58,130 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:26:58,179 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 01:26:58,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:58,184 INFO ]: Computing forward predicates... [2018-06-22 01:26:59,035 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:59,054 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:26:59,054 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2018-06-22 01:26:59,054 INFO ]: Interpolant automaton has 62 states [2018-06-22 01:26:59,054 INFO ]: Constructing interpolant automaton starting with 62 interpolants. [2018-06-22 01:26:59,055 INFO ]: CoverageRelationStatistics Valid=676, Invalid=3106, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 01:26:59,055 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 62 states. [2018-06-22 01:27:00,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:00,432 INFO ]: Finished difference Result 57 states and 60 transitions. [2018-06-22 01:27:00,433 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 01:27:00,433 INFO ]: Start accepts. Automaton has 62 states. Word has length 36 [2018-06-22 01:27:00,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:00,433 INFO ]: With dead ends: 57 [2018-06-22 01:27:00,433 INFO ]: Without dead ends: 57 [2018-06-22 01:27:00,434 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2011 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1906, Invalid=6466, Unknown=0, NotChecked=0, Total=8372 [2018-06-22 01:27:00,434 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 01:27:00,435 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 38. [2018-06-22 01:27:00,435 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:27:00,436 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-22 01:27:00,436 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-06-22 01:27:00,436 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:00,436 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-22 01:27:00,436 INFO ]: Interpolant automaton has 62 states. [2018-06-22 01:27:00,436 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-22 01:27:00,436 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:27:00,436 INFO ]: Found error trace [2018-06-22 01:27:00,436 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:00,436 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:00,436 INFO ]: Analyzing trace with hash 1038747862, now seen corresponding path program 28 times [2018-06-22 01:27:00,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:00,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:00,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:00,439 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:00,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:00,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:00,935 INFO ]: Checked inductivity of 225 backedges. 105 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:00,935 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:00,935 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:27:00,941 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:27:00,987 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:27:00,987 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:00,995 INFO ]: Computing forward predicates... [2018-06-22 01:27:01,926 INFO ]: Checked inductivity of 225 backedges. 105 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:01,945 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:01,945 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-06-22 01:27:01,945 INFO ]: Interpolant automaton has 64 states [2018-06-22 01:27:01,945 INFO ]: Constructing interpolant automaton starting with 64 interpolants. [2018-06-22 01:27:01,946 INFO ]: CoverageRelationStatistics Valid=681, Invalid=3351, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:27:01,946 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 64 states. [2018-06-22 01:27:02,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:02,605 INFO ]: Finished difference Result 55 states and 57 transitions. [2018-06-22 01:27:02,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:27:02,605 INFO ]: Start accepts. Automaton has 64 states. Word has length 37 [2018-06-22 01:27:02,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:02,605 INFO ]: With dead ends: 55 [2018-06-22 01:27:02,605 INFO ]: Without dead ends: 39 [2018-06-22 01:27:02,606 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1137, Invalid=5183, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 01:27:02,606 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:27:02,607 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:27:02,607 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:27:02,607 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-22 01:27:02,607 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2018-06-22 01:27:02,607 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:02,607 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-22 01:27:02,607 INFO ]: Interpolant automaton has 64 states. [2018-06-22 01:27:02,607 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-22 01:27:02,607 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:27:02,607 INFO ]: Found error trace [2018-06-22 01:27:02,607 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:02,607 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:02,607 INFO ]: Analyzing trace with hash -921883177, now seen corresponding path program 29 times [2018-06-22 01:27:02,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:02,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:02,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:02,608 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:02,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:02,630 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:03,257 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:03,257 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:03,257 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:27:03,263 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:27:03,334 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 01:27:03,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:03,341 INFO ]: Computing forward predicates... [2018-06-22 01:27:04,301 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:04,320 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:04,320 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-06-22 01:27:04,320 INFO ]: Interpolant automaton has 66 states [2018-06-22 01:27:04,320 INFO ]: Constructing interpolant automaton starting with 66 interpolants. [2018-06-22 01:27:04,320 INFO ]: CoverageRelationStatistics Valid=761, Invalid=3529, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 01:27:04,320 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 66 states. [2018-06-22 01:27:05,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:05,978 INFO ]: Finished difference Result 60 states and 63 transitions. [2018-06-22 01:27:06,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 01:27:06,029 INFO ]: Start accepts. Automaton has 66 states. Word has length 38 [2018-06-22 01:27:06,029 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:06,030 INFO ]: With dead ends: 60 [2018-06-22 01:27:06,030 INFO ]: Without dead ends: 60 [2018-06-22 01:27:06,031 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2297 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2153, Invalid=7353, Unknown=0, NotChecked=0, Total=9506 [2018-06-22 01:27:06,031 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 01:27:06,032 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 40. [2018-06-22 01:27:06,032 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:27:06,032 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-22 01:27:06,032 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-22 01:27:06,033 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:06,033 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-22 01:27:06,033 INFO ]: Interpolant automaton has 66 states. [2018-06-22 01:27:06,033 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-22 01:27:06,033 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:27:06,033 INFO ]: Found error trace [2018-06-22 01:27:06,033 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:06,033 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:06,033 INFO ]: Analyzing trace with hash 1484152747, now seen corresponding path program 30 times [2018-06-22 01:27:06,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:06,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:06,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:06,033 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:06,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:06,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:06,879 INFO ]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:06,879 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:06,879 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:27:06,884 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:27:06,940 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 01:27:06,940 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:06,945 INFO ]: Computing forward predicates... [2018-06-22 01:27:07,272 INFO ]: Checked inductivity of 256 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-06-22 01:27:07,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:07,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19] total 52 [2018-06-22 01:27:07,291 INFO ]: Interpolant automaton has 52 states [2018-06-22 01:27:07,291 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 01:27:07,291 INFO ]: CoverageRelationStatistics Valid=478, Invalid=2174, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:27:07,291 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 52 states. [2018-06-22 01:27:07,906 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:27:07,906 INFO ]: Finished difference Result 58 states and 60 transitions. [2018-06-22 01:27:07,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:27:07,906 INFO ]: Start accepts. Automaton has 52 states. Word has length 39 [2018-06-22 01:27:07,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:27:07,906 INFO ]: With dead ends: 58 [2018-06-22 01:27:07,906 INFO ]: Without dead ends: 41 [2018-06-22 01:27:07,907 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1381 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=830, Invalid=3726, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 01:27:07,907 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:27:07,908 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 01:27:07,908 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:27:07,908 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-22 01:27:07,908 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-06-22 01:27:07,908 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:27:07,908 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-22 01:27:07,908 INFO ]: Interpolant automaton has 52 states. [2018-06-22 01:27:07,908 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-22 01:27:07,908 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:27:07,908 INFO ]: Found error trace [2018-06-22 01:27:07,908 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:27:07,909 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:27:07,909 INFO ]: Analyzing trace with hash -1486600084, now seen corresponding path program 31 times [2018-06-22 01:27:07,909 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:27:07,909 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:27:07,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:07,909 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:27:07,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:27:07,933 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:08,811 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:08,811 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:27:08,811 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:27:08,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:27:08,866 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:27:08,873 INFO ]: Computing forward predicates... [2018-06-22 01:27:10,174 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:27:10,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:27:10,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2018-06-22 01:27:10,193 INFO ]: Interpolant automaton has 70 states [2018-06-22 01:27:10,193 INFO ]: Constructing interpolant automaton starting with 70 interpolants. [2018-06-22 01:27:10,194 INFO ]: CoverageRelationStatistics Valid=851, Invalid=3979, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:27:10,194 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 70 states. Received shutdown request... [2018-06-22 01:27:10,878 WARN ]: Removed 3 from assertion stack [2018-06-22 01:27:10,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:27:10,879 WARN ]: Verification canceled [2018-06-22 01:27:10,982 WARN ]: Timeout [2018-06-22 01:27:10,983 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:27:10 BoogieIcfgContainer [2018-06-22 01:27:10,983 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:27:10,983 INFO ]: Toolchain (without parser) took 58943.27 ms. Allocated memory was 303.0 MB in the beginning and 731.4 MB in the end (delta: 428.3 MB). Free memory was 254.6 MB in the beginning and 704.5 MB in the end (delta: -449.9 MB). Peak memory consumption was 73.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:27:10,984 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:27:10,984 INFO ]: ChcToBoogie took 68.92 ms. Allocated memory is still 303.0 MB. Free memory was 254.6 MB in the beginning and 251.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:27:10,985 INFO ]: Boogie Preprocessor took 57.45 ms. Allocated memory is still 303.0 MB. Free memory was 251.6 MB in the beginning and 250.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:27:10,985 INFO ]: RCFGBuilder took 500.18 ms. Allocated memory is still 303.0 MB. Free memory was 250.6 MB in the beginning and 233.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:27:10,985 INFO ]: TraceAbstraction took 58307.76 ms. Allocated memory was 303.0 MB in the beginning and 731.4 MB in the end (delta: 428.3 MB). Free memory was 232.6 MB in the beginning and 704.5 MB in the end (delta: -471.9 MB). Peak memory consumption was 51.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:27:10,988 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.92 ms. Allocated memory is still 303.0 MB. Free memory was 254.6 MB in the beginning and 251.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 57.45 ms. Allocated memory is still 303.0 MB. Free memory was 251.6 MB in the beginning and 250.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 500.18 ms. Allocated memory is still 303.0 MB. Free memory was 250.6 MB in the beginning and 233.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58307.76 ms. Allocated memory was 303.0 MB in the beginning and 731.4 MB in the end (delta: 428.3 MB). Free memory was 232.6 MB in the beginning and 704.5 MB in the end (delta: -471.9 MB). Peak memory consumption was 51.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (41states) and interpolant automaton (currently 30 states, 70 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. TIMEOUT Result, 58.2s OverallTime, 46 OverallIterations, 16 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 530 SDtfs, 1131 SDslu, 3651 SDs, 0 SdLazy, 10712 SolverSat, 3100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1881 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 1582 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25661 ImplicationChecksByTransitivity, 43.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=45, 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.1s AutomataMinimizationTime, 45 MinimizatonAttempts, 220 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 33.7s InterpolantComputationTime, 1678 NumberOfCodeBlocks, 1678 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 1600 ConstructedInterpolants, 0 QuantifiedInterpolants, 419693 SizeOfPredicates, 184 NumberOfNonLiveVariables, 9632 ConjunctsInSsa, 5688 ConjunctsInUnsatCore, 78 InterpolantComputations, 14 PerfectInterpolantSequences, 2230/6264 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-27-10-998.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-27-10-998.csv Completed graceful shutdown