java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:16:54,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:16:54,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:16:54,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:16:54,582 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:16:54,583 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:16:54,584 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:16:54,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:16:54,589 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:16:54,590 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:16:54,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:16:54,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:16:54,593 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:16:54,594 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:16:54,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:16:54,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:16:54,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:16:54,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:16:54,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:16:54,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:16:54,613 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:16:54,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:16:54,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:16:54,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:16:54,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:16:54,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:16:54,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:16:54,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:16:54,619 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:16:54,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:16:54,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:16:54,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:16:54,629 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:16:54,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:16:54,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:16:54,631 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:16:54,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:16:54,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:16:54,656 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:16:54,656 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:16:54,657 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:16:54,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:16:54,658 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:16:54,658 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:16:54,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:16:54,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:16:54,659 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:16:54,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:16:54,659 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:16:54,660 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:16:54,660 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:16:54,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:16:54,660 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:16:54,661 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:16:54,662 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:16:54,710 INFO ]: Repository-Root is: /tmp [2018-06-22 01:16:54,730 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:16:54,733 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:16:54,735 INFO ]: Initializing SmtParser... [2018-06-22 01:16:54,735 INFO ]: SmtParser initialized [2018-06-22 01:16:54,736 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_safe.c-1.smt2 [2018-06-22 01:16:54,737 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:16:54,827 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_safe.c-1.smt2 unknown [2018-06-22 01:16:54,995 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_safe.c-1.smt2 [2018-06-22 01:16:55,000 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:16:55,006 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:16:55,006 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:16:55,006 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:16:55,006 INFO ]: ChcToBoogie initialized [2018-06-22 01:16:55,010 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:16:54" (1/1) ... [2018-06-22 01:16:55,071 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:16:55 Unit [2018-06-22 01:16:55,071 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:16:55,071 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:16:55,071 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:16:55,071 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:16:55,091 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:16:55" (1/1) ... [2018-06-22 01:16:55,091 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:16:55" (1/1) ... [2018-06-22 01:16:55,097 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:16:55" (1/1) ... [2018-06-22 01:16:55,097 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:16:55" (1/1) ... [2018-06-22 01:16:55,101 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:16:55" (1/1) ... [2018-06-22 01:16:55,102 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:16:55" (1/1) ... [2018-06-22 01:16:55,103 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:16:55" (1/1) ... [2018-06-22 01:16:55,104 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:16:55,105 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:16:55,105 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:16:55,105 INFO ]: RCFGBuilder initialized [2018-06-22 01:16:55,106 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:16:55" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:16:55,124 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:16:55,124 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:16:55,124 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:16:55,124 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:16:55,124 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:16:55,124 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:16:55,362 INFO ]: Using library mode [2018-06-22 01:16:55,362 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:16:55 BoogieIcfgContainer [2018-06-22 01:16:55,362 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:16:55,370 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:16:55,370 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:16:55,374 INFO ]: TraceAbstraction initialized [2018-06-22 01:16:55,374 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:16:54" (1/3) ... [2018-06-22 01:16:55,375 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451f9c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:16:55, skipping insertion in model container [2018-06-22 01:16:55,375 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:16:55" (2/3) ... [2018-06-22 01:16:55,375 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451f9c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:16:55, skipping insertion in model container [2018-06-22 01:16:55,375 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:16:55" (3/3) ... [2018-06-22 01:16:55,385 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:16:55,394 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:16:55,400 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:16:55,435 INFO ]: Using default assertion order modulation [2018-06-22 01:16:55,435 INFO ]: Interprodecural is true [2018-06-22 01:16:55,435 INFO ]: Hoare is false [2018-06-22 01:16:55,435 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:16:55,435 INFO ]: Backedges is TWOTRACK [2018-06-22 01:16:55,435 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:16:55,435 INFO ]: Difference is false [2018-06-22 01:16:55,435 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:16:55,435 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:16:55,448 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:16:55,458 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:16:55,458 INFO ]: Found error trace [2018-06-22 01:16:55,459 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:55,459 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:55,464 INFO ]: Analyzing trace with hash 823983054, now seen corresponding path program 1 times [2018-06-22 01:16:55,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:55,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:55,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:55,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:55,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:55,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:55,648 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:16:55,650 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:16:55,650 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:16:55,651 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:16:55,661 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:16:55,662 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:16:55,664 INFO ]: Start difference. First operand 13 states. Second operand 5 states. [2018-06-22 01:16:55,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:55,863 INFO ]: Finished difference Result 12 states and 13 transitions. [2018-06-22 01:16:55,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:16:55,865 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:16:55,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:55,872 INFO ]: With dead ends: 12 [2018-06-22 01:16:55,872 INFO ]: Without dead ends: 12 [2018-06-22 01:16:55,874 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:16:55,887 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:16:55,914 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:16:55,915 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:16:55,915 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-22 01:16:55,916 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-22 01:16:55,916 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:55,917 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-22 01:16:55,917 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:16:55,917 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-22 01:16:55,917 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:16:55,917 INFO ]: Found error trace [2018-06-22 01:16:55,917 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:55,917 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:55,917 INFO ]: Analyzing trace with hash -285469858, now seen corresponding path program 1 times [2018-06-22 01:16:55,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:55,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:55,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:55,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:55,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:55,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:56,344 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:16:56,344 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:56,344 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) [2018-06-22 01:16:56,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:16:56,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:56,412 INFO ]: Computing forward predicates... [2018-06-22 01:16:56,757 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:16:56,783 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:56,783 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 01:16:56,784 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:16:56,784 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:16:56,784 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:16:56,785 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 10 states. [2018-06-22 01:16:57,002 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:57,002 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-22 01:16:57,002 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:16:57,002 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-22 01:16:57,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:57,005 INFO ]: With dead ends: 19 [2018-06-22 01:16:57,005 INFO ]: Without dead ends: 19 [2018-06-22 01:16:57,006 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:16:57,007 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:16:57,009 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-22 01:16:57,009 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:16:57,012 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-22 01:16:57,012 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-06-22 01:16:57,012 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:57,012 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-22 01:16:57,012 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:16:57,012 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-22 01:16:57,013 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:16:57,013 INFO ]: Found error trace [2018-06-22 01:16:57,013 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:57,013 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:57,013 INFO ]: Analyzing trace with hash 1235527436, now seen corresponding path program 1 times [2018-06-22 01:16:57,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:57,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:57,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:57,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:57,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:57,035 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:57,136 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:16:57,136 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:57,136 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:16:57,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:57,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:57,169 INFO ]: Computing forward predicates... [2018-06-22 01:16:57,276 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:16:57,295 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:57,295 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 01:16:57,295 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:16:57,295 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:16:57,295 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:16:57,296 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2018-06-22 01:16:57,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:57,423 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-22 01:16:57,423 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:16:57,423 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-22 01:16:57,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:57,424 INFO ]: With dead ends: 20 [2018-06-22 01:16:57,424 INFO ]: Without dead ends: 20 [2018-06-22 01:16:57,424 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:16:57,425 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:16:57,426 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-06-22 01:16:57,426 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:16:57,427 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-22 01:16:57,427 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-06-22 01:16:57,427 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:57,427 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-22 01:16:57,427 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:16:57,427 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-22 01:16:57,428 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:16:57,428 INFO ]: Found error trace [2018-06-22 01:16:57,428 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:57,428 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:57,428 INFO ]: Analyzing trace with hash -318771762, now seen corresponding path program 2 times [2018-06-22 01:16:57,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:57,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:57,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:57,429 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:16:57,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:57,440 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:57,656 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:57,656 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:57,656 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:16:57,668 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:16:57,716 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:16:57,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:57,718 INFO ]: Computing forward predicates... [2018-06-22 01:16:57,955 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:57,978 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:16:57,978 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-06-22 01:16:57,978 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:16:57,979 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:16:57,979 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:16:57,979 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 10 states. [2018-06-22 01:16:58,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:58,093 INFO ]: Finished difference Result 17 states and 19 transitions. [2018-06-22 01:16:58,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:16:58,093 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-22 01:16:58,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:58,094 INFO ]: With dead ends: 17 [2018-06-22 01:16:58,094 INFO ]: Without dead ends: 14 [2018-06-22 01:16:58,094 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:16:58,094 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:16:58,095 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:16:58,095 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:16:58,096 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-22 01:16:58,096 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-22 01:16:58,096 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:58,096 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-22 01:16:58,096 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:16:58,096 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-22 01:16:58,096 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:16:58,096 INFO ]: Found error trace [2018-06-22 01:16:58,096 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:58,096 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:58,097 INFO ]: Analyzing trace with hash -412495904, now seen corresponding path program 2 times [2018-06-22 01:16:58,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:58,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:58,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:58,097 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:58,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:58,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:58,206 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:58,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:58,206 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:16:58,214 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:16:58,257 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:16:58,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:58,260 INFO ]: Computing forward predicates... [2018-06-22 01:16:58,311 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:58,330 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:58,330 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:16:58,330 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:16:58,330 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:16:58,330 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:16:58,331 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 8 states. [2018-06-22 01:16:58,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:58,491 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-22 01:16:58,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:16:58,503 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 01:16:58,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:58,504 INFO ]: With dead ends: 22 [2018-06-22 01:16:58,504 INFO ]: Without dead ends: 22 [2018-06-22 01:16:58,505 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:16:58,505 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:16:58,506 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-22 01:16:58,506 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:16:58,507 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-22 01:16:58,507 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-06-22 01:16:58,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:58,507 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-22 01:16:58,507 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:16:58,507 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-22 01:16:58,507 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:16:58,507 INFO ]: Found error trace [2018-06-22 01:16:58,508 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:58,508 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:58,508 INFO ]: Analyzing trace with hash 977022990, now seen corresponding path program 3 times [2018-06-22 01:16:58,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:58,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:58,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:58,508 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:58,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:58,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:58,619 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:16:58,619 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:58,619 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:16:58,625 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:16:58,658 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:16:58,658 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:58,660 INFO ]: Computing forward predicates... [2018-06-22 01:16:58,867 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:16:58,886 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:58,886 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 01:16:58,886 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:16:58,886 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:16:58,886 INFO ]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:16:58,887 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 10 states. [2018-06-22 01:16:59,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:59,021 INFO ]: Finished difference Result 23 states and 26 transitions. [2018-06-22 01:16:59,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:16:59,021 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-22 01:16:59,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:59,022 INFO ]: With dead ends: 23 [2018-06-22 01:16:59,022 INFO ]: Without dead ends: 23 [2018-06-22 01:16:59,022 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:16:59,022 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:16:59,023 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-06-22 01:16:59,024 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:16:59,024 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-22 01:16:59,024 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-06-22 01:16:59,024 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:59,024 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-22 01:16:59,024 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:16:59,024 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-22 01:16:59,024 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:16:59,024 INFO ]: Found error trace [2018-06-22 01:16:59,024 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:59,024 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:59,024 INFO ]: Analyzing trace with hash 38388108, now seen corresponding path program 4 times [2018-06-22 01:16:59,024 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:59,024 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:59,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:59,026 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:59,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:59,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:59,130 INFO ]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:59,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:59,131 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:16:59,138 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:16:59,155 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:16:59,155 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:59,156 INFO ]: Computing forward predicates... [2018-06-22 01:16:59,224 INFO ]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:59,243 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:59,243 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 01:16:59,243 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:16:59,243 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:16:59,243 INFO ]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:16:59,244 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2018-06-22 01:16:59,337 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:59,337 INFO ]: Finished difference Result 20 states and 22 transitions. [2018-06-22 01:16:59,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:16:59,337 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-22 01:16:59,337 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:59,338 INFO ]: With dead ends: 20 [2018-06-22 01:16:59,338 INFO ]: Without dead ends: 16 [2018-06-22 01:16:59,338 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:16:59,338 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:16:59,339 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:16:59,339 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:16:59,340 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-22 01:16:59,340 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-22 01:16:59,340 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:59,340 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-22 01:16:59,340 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:16:59,340 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-22 01:16:59,340 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:16:59,340 INFO ]: Found error trace [2018-06-22 01:16:59,340 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:59,341 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:59,341 INFO ]: Analyzing trace with hash 163800862, now seen corresponding path program 5 times [2018-06-22 01:16:59,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:59,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:59,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:59,341 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:59,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:59,357 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:59,465 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:59,465 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:59,465 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:16:59,480 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:16:59,506 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:16:59,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:59,508 INFO ]: Computing forward predicates... [2018-06-22 01:16:59,571 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:16:59,590 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:16:59,590 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 01:16:59,591 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:16:59,591 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:16:59,591 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:16:59,591 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 10 states. [2018-06-22 01:16:59,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:16:59,799 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-22 01:16:59,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:16:59,799 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-22 01:16:59,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:16:59,800 INFO ]: With dead ends: 25 [2018-06-22 01:16:59,800 INFO ]: Without dead ends: 25 [2018-06-22 01:16:59,800 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:16:59,800 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:16:59,802 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-22 01:16:59,802 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:16:59,802 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-22 01:16:59,803 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-06-22 01:16:59,803 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:16:59,803 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-22 01:16:59,803 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:16:59,803 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-22 01:16:59,803 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:16:59,803 INFO ]: Found error trace [2018-06-22 01:16:59,803 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:16:59,803 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:16:59,803 INFO ]: Analyzing trace with hash -243371060, now seen corresponding path program 6 times [2018-06-22 01:16:59,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:16:59,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:16:59,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:59,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:16:59,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:16:59,815 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:59,890 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:16:59,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:16:59,890 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:16:59,899 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:16:59,963 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:16:59,963 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:16:59,965 INFO ]: Computing forward predicates... [2018-06-22 01:17:00,009 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:17:00,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:00,028 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 01:17:00,028 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:17:00,028 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:17:00,028 INFO ]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:17:00,029 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 13 states. [2018-06-22 01:17:00,268 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:00,268 INFO ]: Finished difference Result 26 states and 29 transitions. [2018-06-22 01:17:00,269 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:17:00,269 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-22 01:17:00,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:00,270 INFO ]: With dead ends: 26 [2018-06-22 01:17:00,270 INFO ]: Without dead ends: 26 [2018-06-22 01:17:00,270 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:17:00,270 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:17:00,272 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 17. [2018-06-22 01:17:00,272 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:17:00,272 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-22 01:17:00,272 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-06-22 01:17:00,273 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:00,273 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-22 01:17:00,273 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:17:00,273 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-22 01:17:00,273 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:17:00,273 INFO ]: Found error trace [2018-06-22 01:17:00,273 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:00,273 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:00,273 INFO ]: Analyzing trace with hash 723718670, now seen corresponding path program 7 times [2018-06-22 01:17:00,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:00,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:00,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:00,274 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:00,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:00,286 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:00,628 INFO ]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:00,628 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:00,628 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) [2018-06-22 01:17:00,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:00,664 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:00,666 INFO ]: Computing forward predicates... [2018-06-22 01:17:00,720 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:00,739 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:00,739 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 01:17:00,739 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:17:00,739 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:17:00,739 INFO ]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:17:00,739 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 14 states. [2018-06-22 01:17:00,844 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:00,844 INFO ]: Finished difference Result 23 states and 25 transitions. [2018-06-22 01:17:00,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:17:00,844 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-22 01:17:00,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:00,844 INFO ]: With dead ends: 23 [2018-06-22 01:17:00,844 INFO ]: Without dead ends: 18 [2018-06-22 01:17:00,845 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:17:00,845 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:17:00,846 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:17:00,846 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:17:00,847 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-22 01:17:00,847 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-22 01:17:00,847 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:00,847 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-22 01:17:00,847 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:17:00,847 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-22 01:17:00,847 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:17:00,847 INFO ]: Found error trace [2018-06-22 01:17:00,847 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:00,847 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:00,847 INFO ]: Analyzing trace with hash 986290976, now seen corresponding path program 8 times [2018-06-22 01:17:00,847 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:00,847 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:00,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:00,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:00,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:00,876 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:01,073 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:01,073 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:01,073 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:17:01,080 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:17:01,129 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:17:01,129 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:01,132 INFO ]: Computing forward predicates... [2018-06-22 01:17:01,207 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:01,227 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:01,227 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 01:17:01,227 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:17:01,228 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:17:01,228 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:17:01,228 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2018-06-22 01:17:01,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:01,465 INFO ]: Finished difference Result 28 states and 31 transitions. [2018-06-22 01:17:01,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:17:01,465 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 01:17:01,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:01,465 INFO ]: With dead ends: 28 [2018-06-22 01:17:01,465 INFO ]: Without dead ends: 28 [2018-06-22 01:17:01,466 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:17:01,466 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:17:01,468 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-06-22 01:17:01,468 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:17:01,468 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-22 01:17:01,468 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-06-22 01:17:01,468 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:01,468 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-22 01:17:01,468 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:17:01,468 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-22 01:17:01,469 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:17:01,469 INFO ]: Found error trace [2018-06-22 01:17:01,469 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:01,469 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:01,469 INFO ]: Analyzing trace with hash 536097870, now seen corresponding path program 9 times [2018-06-22 01:17:01,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:01,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:01,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:01,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:01,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:01,479 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:01,572 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:17:01,572 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:01,572 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:17:01,579 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:17:01,618 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:17:01,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:01,621 INFO ]: Computing forward predicates... [2018-06-22 01:17:01,682 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:17:01,701 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:01,701 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-22 01:17:01,702 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:17:01,702 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:17:01,702 INFO ]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:17:01,702 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 16 states. [2018-06-22 01:17:01,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:01,824 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-22 01:17:01,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:17:01,825 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-22 01:17:01,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:01,825 INFO ]: With dead ends: 29 [2018-06-22 01:17:01,825 INFO ]: Without dead ends: 29 [2018-06-22 01:17:01,826 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:17:01,826 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:17:01,827 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-06-22 01:17:01,827 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:17:01,828 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 01:17:01,828 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-06-22 01:17:01,828 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:01,828 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 01:17:01,828 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:17:01,828 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 01:17:01,828 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:17:01,828 INFO ]: Found error trace [2018-06-22 01:17:01,829 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:01,829 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:01,829 INFO ]: Analyzing trace with hash 451108428, now seen corresponding path program 10 times [2018-06-22 01:17:01,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:01,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:01,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:01,829 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:01,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:01,838 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:02,020 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:02,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:02,020 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:17:02,026 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:17:02,047 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:17:02,047 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:02,049 INFO ]: Computing forward predicates... [2018-06-22 01:17:02,170 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:02,189 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:02,189 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-22 01:17:02,190 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:17:02,190 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:17:02,190 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:17:02,190 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 17 states. [2018-06-22 01:17:02,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:02,273 INFO ]: Finished difference Result 26 states and 28 transitions. [2018-06-22 01:17:02,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:17:02,274 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-22 01:17:02,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:02,274 INFO ]: With dead ends: 26 [2018-06-22 01:17:02,274 INFO ]: Without dead ends: 20 [2018-06-22 01:17:02,274 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:17:02,274 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:17:02,276 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:17:02,276 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:17:02,276 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-22 01:17:02,276 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-22 01:17:02,276 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:02,276 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-22 01:17:02,276 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:17:02,276 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-22 01:17:02,276 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:17:02,276 INFO ]: Found error trace [2018-06-22 01:17:02,277 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:02,277 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:02,277 INFO ]: Analyzing trace with hash -619975970, now seen corresponding path program 11 times [2018-06-22 01:17:02,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:02,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:02,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:02,277 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:02,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:02,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:03,031 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:03,032 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:03,032 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:03,038 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:17:03,061 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:17:03,061 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:03,064 INFO ]: Computing forward predicates... [2018-06-22 01:17:03,161 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:03,181 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:03,181 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 01:17:03,181 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:17:03,181 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:17:03,181 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:17:03,181 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 14 states. [2018-06-22 01:17:03,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:03,554 INFO ]: Finished difference Result 31 states and 34 transitions. [2018-06-22 01:17:03,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:17:03,554 INFO ]: Start accepts. Automaton has 14 states. Word has length 19 [2018-06-22 01:17:03,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:03,555 INFO ]: With dead ends: 31 [2018-06-22 01:17:03,555 INFO ]: Without dead ends: 31 [2018-06-22 01:17:03,555 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:17:03,555 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:17:03,557 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-06-22 01:17:03,557 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:17:03,557 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-22 01:17:03,557 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-06-22 01:17:03,557 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:03,557 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-22 01:17:03,557 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:17:03,557 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-22 01:17:03,558 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:17:03,558 INFO ]: Found error trace [2018-06-22 01:17:03,558 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:03,558 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:03,558 INFO ]: Analyzing trace with hash 536146060, now seen corresponding path program 12 times [2018-06-22 01:17:03,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:03,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:03,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:03,559 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:03,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:03,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:03,800 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:17:03,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:03,800 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) [2018-06-22 01:17:03,814 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:03,889 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:17:03,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:03,891 INFO ]: Computing forward predicates... [2018-06-22 01:17:03,991 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:17:04,011 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:04,012 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-22 01:17:04,012 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:17:04,012 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:17:04,012 INFO ]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:17:04,012 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 19 states. [2018-06-22 01:17:04,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:04,199 INFO ]: Finished difference Result 32 states and 35 transitions. [2018-06-22 01:17:04,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:17:04,200 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-22 01:17:04,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:04,201 INFO ]: With dead ends: 32 [2018-06-22 01:17:04,201 INFO ]: Without dead ends: 32 [2018-06-22 01:17:04,202 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=600, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:17:04,202 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:17:04,203 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-06-22 01:17:04,203 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:17:04,204 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 01:17:04,204 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-06-22 01:17:04,205 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:04,205 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 01:17:04,205 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:17:04,205 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 01:17:04,205 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:17:04,205 INFO ]: Found error trace [2018-06-22 01:17:04,205 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:04,205 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:04,205 INFO ]: Analyzing trace with hash -2098526642, now seen corresponding path program 13 times [2018-06-22 01:17:04,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:04,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:04,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:04,206 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:04,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:04,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:04,343 INFO ]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:04,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:04,343 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:17:04,349 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:04,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:04,379 INFO ]: Computing forward predicates... [2018-06-22 01:17:04,817 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:04,839 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:04,839 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-22 01:17:04,839 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:17:04,839 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:17:04,839 INFO ]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:17:04,839 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 20 states. [2018-06-22 01:17:04,925 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:04,925 INFO ]: Finished difference Result 29 states and 31 transitions. [2018-06-22 01:17:04,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:17:04,926 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-22 01:17:04,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:04,926 INFO ]: With dead ends: 29 [2018-06-22 01:17:04,926 INFO ]: Without dead ends: 22 [2018-06-22 01:17:04,926 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:17:04,927 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:17:04,932 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 01:17:04,932 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:17:04,933 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-22 01:17:04,933 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-06-22 01:17:04,933 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:04,933 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-22 01:17:04,933 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:17:04,933 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-22 01:17:04,933 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:17:04,933 INFO ]: Found error trace [2018-06-22 01:17:04,933 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:04,933 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:04,933 INFO ]: Analyzing trace with hash -618482080, now seen corresponding path program 14 times [2018-06-22 01:17:04,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:04,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:04,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:04,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:04,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:04,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:05,392 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:05,392 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:05,392 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:17:05,398 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:17:05,421 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:17:05,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:05,424 INFO ]: Computing forward predicates... [2018-06-22 01:17:05,486 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:05,505 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:05,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-22 01:17:05,505 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:17:05,505 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:17:05,506 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:17:05,506 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 16 states. [2018-06-22 01:17:05,854 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:05,854 INFO ]: Finished difference Result 34 states and 37 transitions. [2018-06-22 01:17:05,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:17:05,854 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 01:17:05,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:05,854 INFO ]: With dead ends: 34 [2018-06-22 01:17:05,854 INFO ]: Without dead ends: 34 [2018-06-22 01:17:05,855 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:17:05,855 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:17:05,856 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-06-22 01:17:05,856 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:17:05,857 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-22 01:17:05,857 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-06-22 01:17:05,857 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:05,857 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-22 01:17:05,857 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:17:05,857 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-22 01:17:05,857 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:17:05,857 INFO ]: Found error trace [2018-06-22 01:17:05,858 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:05,858 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:05,858 INFO ]: Analyzing trace with hash -1981740914, now seen corresponding path program 15 times [2018-06-22 01:17:05,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:05,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:05,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:05,858 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:05,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:05,867 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:06,015 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:17:06,015 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:06,015 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:17:06,021 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:17:06,048 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:17:06,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:06,050 INFO ]: Computing forward predicates... [2018-06-22 01:17:06,155 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:17:06,185 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:06,185 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-22 01:17:06,185 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:17:06,185 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:17:06,185 INFO ]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:17:06,185 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 22 states. [2018-06-22 01:17:06,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:06,445 INFO ]: Finished difference Result 35 states and 38 transitions. [2018-06-22 01:17:06,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:17:06,446 INFO ]: Start accepts. Automaton has 22 states. Word has length 22 [2018-06-22 01:17:06,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:06,447 INFO ]: With dead ends: 35 [2018-06-22 01:17:06,447 INFO ]: Without dead ends: 35 [2018-06-22 01:17:06,447 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=364, Invalid=826, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:17:06,447 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:17:06,449 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-06-22 01:17:06,449 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:17:06,449 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-22 01:17:06,449 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-06-22 01:17:06,449 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:06,449 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-22 01:17:06,449 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:17:06,449 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-22 01:17:06,450 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:17:06,450 INFO ]: Found error trace [2018-06-22 01:17:06,450 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:06,450 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:06,450 INFO ]: Analyzing trace with hash -2052216052, now seen corresponding path program 16 times [2018-06-22 01:17:06,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:06,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:06,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:06,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:06,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:06,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:06,731 INFO ]: Checked inductivity of 43 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:06,731 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:06,731 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:17:06,737 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:17:06,760 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:17:06,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:06,762 INFO ]: Computing forward predicates... [2018-06-22 01:17:06,901 INFO ]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:06,920 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:06,920 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-22 01:17:06,920 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:17:06,921 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:17:06,921 INFO ]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:17:06,921 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 23 states. [2018-06-22 01:17:07,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:07,093 INFO ]: Finished difference Result 32 states and 34 transitions. [2018-06-22 01:17:07,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:17:07,093 INFO ]: Start accepts. Automaton has 23 states. Word has length 22 [2018-06-22 01:17:07,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:07,094 INFO ]: With dead ends: 32 [2018-06-22 01:17:07,094 INFO ]: Without dead ends: 24 [2018-06-22 01:17:07,094 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:17:07,094 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:17:07,096 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 01:17:07,096 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:17:07,096 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-22 01:17:07,096 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-22 01:17:07,096 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:07,096 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-22 01:17:07,096 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:17:07,096 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-22 01:17:07,096 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:17:07,096 INFO ]: Found error trace [2018-06-22 01:17:07,097 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:07,097 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:07,097 INFO ]: Analyzing trace with hash -1363566946, now seen corresponding path program 17 times [2018-06-22 01:17:07,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:07,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:07,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:07,097 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:07,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:07,109 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:07,512 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:07,512 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:07,512 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:17:07,519 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:17:07,587 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:17:07,587 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:07,591 INFO ]: Computing forward predicates... [2018-06-22 01:17:07,946 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:07,965 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:07,965 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-22 01:17:07,965 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:17:07,965 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:17:07,966 INFO ]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:17:07,966 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 34 states. [2018-06-22 01:17:09,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:09,038 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-22 01:17:09,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:17:09,059 INFO ]: Start accepts. Automaton has 34 states. Word has length 23 [2018-06-22 01:17:09,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:09,059 INFO ]: With dead ends: 37 [2018-06-22 01:17:09,059 INFO ]: Without dead ends: 37 [2018-06-22 01:17:09,060 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=237, Invalid=2313, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 01:17:09,060 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:17:09,062 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-06-22 01:17:09,062 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:17:09,062 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-22 01:17:09,062 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-22 01:17:09,062 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:09,062 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-22 01:17:09,062 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:17:09,062 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-22 01:17:09,063 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:17:09,063 INFO ]: Found error trace [2018-06-22 01:17:09,063 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:09,063 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:09,063 INFO ]: Analyzing trace with hash -1490281140, now seen corresponding path program 18 times [2018-06-22 01:17:09,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:09,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:09,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:09,064 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:09,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:09,072 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:09,341 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:17:09,341 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:09,341 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:17:09,346 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:17:09,380 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:17:09,380 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:09,382 INFO ]: Computing forward predicates... [2018-06-22 01:17:09,502 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:17:09,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:09,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-22 01:17:09,522 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:17:09,522 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:17:09,522 INFO ]: CoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:17:09,522 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 25 states. [2018-06-22 01:17:09,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:09,743 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-22 01:17:09,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:17:09,743 INFO ]: Start accepts. Automaton has 25 states. Word has length 24 [2018-06-22 01:17:09,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:09,743 INFO ]: With dead ends: 38 [2018-06-22 01:17:09,743 INFO ]: Without dead ends: 38 [2018-06-22 01:17:09,744 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=472, Invalid=1088, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:17:09,744 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:17:09,746 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 25. [2018-06-22 01:17:09,746 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:17:09,746 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-22 01:17:09,746 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-06-22 01:17:09,747 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:09,747 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-22 01:17:09,747 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:17:09,747 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-22 01:17:09,747 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:17:09,747 INFO ]: Found error trace [2018-06-22 01:17:09,747 INFO ]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:09,747 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:09,747 INFO ]: Analyzing trace with hash 619956878, now seen corresponding path program 19 times [2018-06-22 01:17:09,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:09,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:09,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:09,748 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:09,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:09,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:10,125 INFO ]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:10,125 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:10,125 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:17:10,133 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:10,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:10,162 INFO ]: Computing forward predicates... [2018-06-22 01:17:10,435 INFO ]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:10,455 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:10,455 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-06-22 01:17:10,455 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:17:10,455 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:17:10,455 INFO ]: CoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:17:10,455 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 26 states. [2018-06-22 01:17:10,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:10,591 INFO ]: Finished difference Result 35 states and 37 transitions. [2018-06-22 01:17:10,592 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:17:10,592 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-22 01:17:10,592 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:10,592 INFO ]: With dead ends: 35 [2018-06-22 01:17:10,592 INFO ]: Without dead ends: 26 [2018-06-22 01:17:10,593 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:17:10,593 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:17:10,594 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 01:17:10,594 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:17:10,595 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-22 01:17:10,595 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-22 01:17:10,595 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:10,595 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-22 01:17:10,595 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:17:10,595 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-22 01:17:10,595 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:17:10,595 INFO ]: Found error trace [2018-06-22 01:17:10,595 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:10,595 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:10,595 INFO ]: Analyzing trace with hash 986784160, now seen corresponding path program 20 times [2018-06-22 01:17:10,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:10,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:10,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:10,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:10,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:10,619 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:11,357 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:11,358 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:11,358 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:17:11,363 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:17:11,394 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:17:11,394 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:11,396 INFO ]: Computing forward predicates... [2018-06-22 01:17:11,439 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:11,470 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:11,470 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-22 01:17:11,470 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:17:11,470 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:17:11,470 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:17:11,470 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 20 states. [2018-06-22 01:17:11,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:11,968 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-22 01:17:11,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:17:11,968 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 01:17:11,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:11,968 INFO ]: With dead ends: 40 [2018-06-22 01:17:11,968 INFO ]: Without dead ends: 40 [2018-06-22 01:17:11,969 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=1326, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:17:11,969 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:17:11,971 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-06-22 01:17:11,971 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:17:11,971 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-22 01:17:11,971 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-06-22 01:17:11,971 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:11,971 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-22 01:17:11,971 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:17:11,971 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-22 01:17:11,971 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:17:11,971 INFO ]: Found error trace [2018-06-22 01:17:11,972 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:11,972 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:11,972 INFO ]: Analyzing trace with hash -526471986, now seen corresponding path program 21 times [2018-06-22 01:17:11,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:11,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:11,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:11,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:11,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:11,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:12,238 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:17:12,238 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:12,238 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:17:12,243 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:17:12,275 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:17:12,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:12,278 INFO ]: Computing forward predicates... [2018-06-22 01:17:12,423 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:17:12,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:12,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-22 01:17:12,443 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:17:12,444 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:17:12,444 INFO ]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:17:12,444 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 28 states. [2018-06-22 01:17:12,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:12,744 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-22 01:17:12,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:17:12,745 INFO ]: Start accepts. Automaton has 28 states. Word has length 26 [2018-06-22 01:17:12,745 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:12,745 INFO ]: With dead ends: 41 [2018-06-22 01:17:12,745 INFO ]: Without dead ends: 41 [2018-06-22 01:17:12,746 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=594, Invalid=1386, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:17:12,746 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:17:12,747 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-06-22 01:17:12,747 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:17:12,748 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-22 01:17:12,748 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-06-22 01:17:12,748 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:12,748 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-22 01:17:12,748 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:17:12,748 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-22 01:17:12,748 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:17:12,748 INFO ]: Found error trace [2018-06-22 01:17:12,748 INFO ]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:12,748 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:12,748 INFO ]: Analyzing trace with hash 466397132, now seen corresponding path program 22 times [2018-06-22 01:17:12,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:12,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:12,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:12,749 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:12,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:12,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:13,300 INFO ]: Checked inductivity of 73 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:13,300 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:13,300 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:17:13,306 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:17:13,335 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:17:13,335 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:13,338 INFO ]: Computing forward predicates... [2018-06-22 01:17:13,482 INFO ]: Checked inductivity of 73 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:13,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:13,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-06-22 01:17:13,501 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:17:13,501 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:17:13,501 INFO ]: CoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:17:13,501 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 29 states. [2018-06-22 01:17:13,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:13,632 INFO ]: Finished difference Result 38 states and 40 transitions. [2018-06-22 01:17:13,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:17:13,635 INFO ]: Start accepts. Automaton has 29 states. Word has length 26 [2018-06-22 01:17:13,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:13,635 INFO ]: With dead ends: 38 [2018-06-22 01:17:13,635 INFO ]: Without dead ends: 28 [2018-06-22 01:17:13,636 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=376, Invalid=1106, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:17:13,636 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:17:13,638 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 01:17:13,638 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:17:13,638 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-22 01:17:13,638 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-22 01:17:13,638 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:13,638 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-22 01:17:13,638 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:17:13,638 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-22 01:17:13,639 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:17:13,639 INFO ]: Found error trace [2018-06-22 01:17:13,639 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:13,639 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:13,639 INFO ]: Analyzing trace with hash 800096862, now seen corresponding path program 23 times [2018-06-22 01:17:13,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:13,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:13,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:13,646 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:13,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:13,675 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:14,205 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:14,205 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:14,236 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:17:14,243 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:17:14,280 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:17:14,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:14,283 INFO ]: Computing forward predicates... [2018-06-22 01:17:14,331 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:14,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:14,351 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-22 01:17:14,351 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:17:14,351 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:17:14,351 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:17:14,351 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 22 states. [2018-06-22 01:17:14,893 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:14,894 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-22 01:17:14,894 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:17:14,894 INFO ]: Start accepts. Automaton has 22 states. Word has length 27 [2018-06-22 01:17:14,894 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:14,894 INFO ]: With dead ends: 43 [2018-06-22 01:17:14,894 INFO ]: Without dead ends: 43 [2018-06-22 01:17:14,895 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:17:14,895 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:17:14,897 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-06-22 01:17:14,897 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:17:14,897 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-22 01:17:14,897 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-06-22 01:17:14,897 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:14,897 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-22 01:17:14,897 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:17:14,897 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-22 01:17:14,899 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:17:14,899 INFO ]: Found error trace [2018-06-22 01:17:14,899 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:14,899 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:14,899 INFO ]: Analyzing trace with hash -1740113396, now seen corresponding path program 24 times [2018-06-22 01:17:14,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:14,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:14,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:14,900 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:14,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:14,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:15,554 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:17:15,554 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:15,554 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:17:15,566 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:17:15,605 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:17:15,605 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:15,607 INFO ]: Computing forward predicates... [2018-06-22 01:17:15,749 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:17:15,768 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:15,768 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-22 01:17:15,768 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:17:15,768 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:17:15,769 INFO ]: CoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:17:15,769 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 31 states. [2018-06-22 01:17:16,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:16,045 INFO ]: Finished difference Result 44 states and 47 transitions. [2018-06-22 01:17:16,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:17:16,046 INFO ]: Start accepts. Automaton has 31 states. Word has length 28 [2018-06-22 01:17:16,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:16,046 INFO ]: With dead ends: 44 [2018-06-22 01:17:16,046 INFO ]: Without dead ends: 44 [2018-06-22 01:17:16,047 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=730, Invalid=1720, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:17:16,047 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 01:17:16,048 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 29. [2018-06-22 01:17:16,048 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:17:16,049 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-22 01:17:16,049 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-06-22 01:17:16,049 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:16,049 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-22 01:17:16,049 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:17:16,049 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-22 01:17:16,049 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:17:16,049 INFO ]: Found error trace [2018-06-22 01:17:16,049 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:16,049 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:16,049 INFO ]: Analyzing trace with hash -1025941810, now seen corresponding path program 25 times [2018-06-22 01:17:16,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:16,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:16,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:16,050 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:16,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:16,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:16,743 INFO ]: Checked inductivity of 91 backedges. 36 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:16,743 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:16,743 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:17:16,749 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:16,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:16,785 INFO ]: Computing forward predicates... [2018-06-22 01:17:17,028 INFO ]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:17,059 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:17,059 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-06-22 01:17:17,060 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:17:17,060 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:17:17,060 INFO ]: CoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:17:17,060 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 32 states. [2018-06-22 01:17:17,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:17,243 INFO ]: Finished difference Result 41 states and 43 transitions. [2018-06-22 01:17:17,243 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:17:17,243 INFO ]: Start accepts. Automaton has 32 states. Word has length 28 [2018-06-22 01:17:17,243 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:17,243 INFO ]: With dead ends: 41 [2018-06-22 01:17:17,244 INFO ]: Without dead ends: 30 [2018-06-22 01:17:17,244 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=452, Invalid=1354, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:17:17,244 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:17:17,245 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 01:17:17,245 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:17:17,246 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-22 01:17:17,246 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-22 01:17:17,246 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:17,246 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-22 01:17:17,246 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:17:17,246 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-22 01:17:17,246 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:17:17,246 INFO ]: Found error trace [2018-06-22 01:17:17,246 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:17,246 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:17,246 INFO ]: Analyzing trace with hash 1831918816, now seen corresponding path program 26 times [2018-06-22 01:17:17,246 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:17,246 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:17,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:17,247 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:17,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:17,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:17,638 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:17,638 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:17,638 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) [2018-06-22 01:17:17,652 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:17,717 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:17:17,717 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:17,722 INFO ]: Computing forward predicates... [2018-06-22 01:17:17,836 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:17,867 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:17,867 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-22 01:17:17,868 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:17:17,868 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:17:17,868 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:17:17,868 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 24 states. [2018-06-22 01:17:19,163 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:19,163 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-22 01:17:19,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:17:19,163 INFO ]: Start accepts. Automaton has 24 states. Word has length 29 [2018-06-22 01:17:19,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:19,164 INFO ]: With dead ends: 46 [2018-06-22 01:17:19,164 INFO ]: Without dead ends: 46 [2018-06-22 01:17:19,164 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=1972, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:17:19,164 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 01:17:19,167 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-06-22 01:17:19,167 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:17:19,167 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-22 01:17:19,167 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-06-22 01:17:19,168 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:19,168 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-22 01:17:19,168 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:17:19,168 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-22 01:17:19,168 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:17:19,168 INFO ]: Found error trace [2018-06-22 01:17:19,168 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:19,168 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:19,168 INFO ]: Analyzing trace with hash 231285006, now seen corresponding path program 27 times [2018-06-22 01:17:19,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:19,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:19,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:19,169 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:19,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:19,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:19,801 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:17:19,802 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:19,802 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:17:19,808 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:17:19,906 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:17:19,906 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:19,909 INFO ]: Computing forward predicates... [2018-06-22 01:17:20,057 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:17:20,076 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:20,076 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-22 01:17:20,076 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:17:20,076 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:17:20,077 INFO ]: CoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:17:20,077 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 34 states. [2018-06-22 01:17:20,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:20,400 INFO ]: Finished difference Result 47 states and 50 transitions. [2018-06-22 01:17:20,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:17:20,400 INFO ]: Start accepts. Automaton has 34 states. Word has length 30 [2018-06-22 01:17:20,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:20,401 INFO ]: With dead ends: 47 [2018-06-22 01:17:20,401 INFO ]: Without dead ends: 47 [2018-06-22 01:17:20,402 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=880, Invalid=2090, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:17:20,402 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:17:20,403 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 31. [2018-06-22 01:17:20,403 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:17:20,403 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-22 01:17:20,403 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-06-22 01:17:20,403 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:20,403 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-22 01:17:20,403 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:17:20,403 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-22 01:17:20,404 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:17:20,404 INFO ]: Found error trace [2018-06-22 01:17:20,404 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:20,404 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:20,404 INFO ]: Analyzing trace with hash 895767692, now seen corresponding path program 28 times [2018-06-22 01:17:20,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:20,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:20,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:20,404 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:20,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:20,413 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:20,633 INFO ]: Checked inductivity of 111 backedges. 45 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:20,633 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:20,633 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:17:20,639 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:17:20,673 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:17:20,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:20,675 INFO ]: Computing forward predicates... [2018-06-22 01:17:21,397 INFO ]: Checked inductivity of 111 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:21,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:21,416 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-06-22 01:17:21,416 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:17:21,416 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:17:21,416 INFO ]: CoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:17:21,416 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 35 states. [2018-06-22 01:17:21,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:21,616 INFO ]: Finished difference Result 44 states and 46 transitions. [2018-06-22 01:17:21,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:17:21,619 INFO ]: Start accepts. Automaton has 35 states. Word has length 30 [2018-06-22 01:17:21,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:21,619 INFO ]: With dead ends: 44 [2018-06-22 01:17:21,619 INFO ]: Without dead ends: 32 [2018-06-22 01:17:21,620 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=535, Invalid=1627, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:17:21,620 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:17:21,621 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 01:17:21,621 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:17:21,622 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-22 01:17:21,622 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-22 01:17:21,622 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:21,622 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-22 01:17:21,622 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:17:21,622 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-22 01:17:21,622 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:17:21,622 INFO ]: Found error trace [2018-06-22 01:17:21,622 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:21,622 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:21,622 INFO ]: Analyzing trace with hash -1479240162, now seen corresponding path program 29 times [2018-06-22 01:17:21,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:21,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:21,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:21,625 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:21,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:21,643 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:22,093 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:22,093 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:22,093 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:17:22,098 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:17:22,139 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:17:22,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:22,143 INFO ]: Computing forward predicates... [2018-06-22 01:17:22,196 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:22,217 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:22,217 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-22 01:17:22,218 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:17:22,218 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:17:22,218 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:17:22,218 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 26 states. [2018-06-22 01:17:22,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:22,966 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-22 01:17:22,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:17:22,966 INFO ]: Start accepts. Automaton has 26 states. Word has length 31 [2018-06-22 01:17:22,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:22,966 INFO ]: With dead ends: 49 [2018-06-22 01:17:22,966 INFO ]: Without dead ends: 49 [2018-06-22 01:17:22,967 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=2343, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 01:17:22,967 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 01:17:22,968 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-06-22 01:17:22,968 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:17:22,969 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-22 01:17:22,972 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-06-22 01:17:22,972 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:22,972 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-22 01:17:22,972 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:17:22,972 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-22 01:17:22,972 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:17:22,972 INFO ]: Found error trace [2018-06-22 01:17:22,972 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:22,972 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:22,972 INFO ]: Analyzing trace with hash -2090039604, now seen corresponding path program 30 times [2018-06-22 01:17:22,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:22,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:22,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:22,973 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:22,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:22,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:23,996 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:17:23,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:23,996 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:17:24,003 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:17:24,045 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:17:24,045 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:24,048 INFO ]: Computing forward predicates... [2018-06-22 01:17:24,260 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:17:24,278 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:24,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-22 01:17:24,278 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:17:24,278 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:17:24,279 INFO ]: CoverageRelationStatistics Valid=336, Invalid=996, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:17:24,279 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 37 states. [2018-06-22 01:17:24,584 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:24,584 INFO ]: Finished difference Result 50 states and 53 transitions. [2018-06-22 01:17:24,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:17:24,585 INFO ]: Start accepts. Automaton has 37 states. Word has length 32 [2018-06-22 01:17:24,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:24,585 INFO ]: With dead ends: 50 [2018-06-22 01:17:24,585 INFO ]: Without dead ends: 50 [2018-06-22 01:17:24,586 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1044, Invalid=2496, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 01:17:24,586 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 01:17:24,587 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 33. [2018-06-22 01:17:24,587 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:17:24,587 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-22 01:17:24,587 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-06-22 01:17:24,587 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:24,587 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-22 01:17:24,587 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:17:24,587 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-22 01:17:24,587 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:17:24,587 INFO ]: Found error trace [2018-06-22 01:17:24,587 INFO ]: trace histogram [12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:24,587 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:24,587 INFO ]: Analyzing trace with hash 1329054478, now seen corresponding path program 31 times [2018-06-22 01:17:24,587 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:24,587 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:24,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:24,588 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:24,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:24,602 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:24,906 INFO ]: Checked inductivity of 133 backedges. 55 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:24,906 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:24,906 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:24,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:24,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:24,956 INFO ]: Computing forward predicates... [2018-06-22 01:17:25,207 INFO ]: Checked inductivity of 133 backedges. 78 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:25,226 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:25,227 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2018-06-22 01:17:25,227 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:17:25,227 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:17:25,227 INFO ]: CoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:17:25,227 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 38 states. [2018-06-22 01:17:25,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:25,461 INFO ]: Finished difference Result 47 states and 49 transitions. [2018-06-22 01:17:25,461 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:17:25,461 INFO ]: Start accepts. Automaton has 38 states. Word has length 32 [2018-06-22 01:17:25,461 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:25,462 INFO ]: With dead ends: 47 [2018-06-22 01:17:25,462 INFO ]: Without dead ends: 34 [2018-06-22 01:17:25,462 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=625, Invalid=1925, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 01:17:25,462 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:17:25,463 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 01:17:25,463 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:17:25,464 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-22 01:17:25,464 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-06-22 01:17:25,464 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:25,464 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-22 01:17:25,464 INFO ]: Interpolant automaton has 38 states. [2018-06-22 01:17:25,464 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-22 01:17:25,464 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:17:25,464 INFO ]: Found error trace [2018-06-22 01:17:25,464 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:25,464 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:25,464 INFO ]: Analyzing trace with hash -425859040, now seen corresponding path program 32 times [2018-06-22 01:17:25,464 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:25,464 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:25,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:25,465 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:25,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:25,479 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:25,880 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:25,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:25,880 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:25,886 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:17:25,927 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:17:25,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:25,932 INFO ]: Computing forward predicates... [2018-06-22 01:17:26,013 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:26,032 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:26,032 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-22 01:17:26,032 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:17:26,032 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:17:26,033 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:17:26,033 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 28 states. [2018-06-22 01:17:26,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:26,877 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-22 01:17:26,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:17:26,877 INFO ]: Start accepts. Automaton has 28 states. Word has length 33 [2018-06-22 01:17:26,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:26,877 INFO ]: With dead ends: 52 [2018-06-22 01:17:26,877 INFO ]: Without dead ends: 52 [2018-06-22 01:17:26,878 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=2746, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:17:26,878 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 01:17:26,879 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-06-22 01:17:26,879 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:17:26,881 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-22 01:17:26,881 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-06-22 01:17:26,881 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:26,881 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-22 01:17:26,881 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:17:26,881 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-22 01:17:26,881 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:17:26,881 INFO ]: Found error trace [2018-06-22 01:17:26,881 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:26,882 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:26,882 INFO ]: Analyzing trace with hash 1006396750, now seen corresponding path program 33 times [2018-06-22 01:17:26,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:26,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:26,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:26,882 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:26,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:26,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:27,237 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:17:27,237 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:27,237 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:27,243 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:17:27,288 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:17:27,288 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:27,291 INFO ]: Computing forward predicates... [2018-06-22 01:17:27,458 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:17:27,477 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:27,477 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2018-06-22 01:17:27,477 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:17:27,477 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:17:27,477 INFO ]: CoverageRelationStatistics Valid=390, Invalid=1170, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:17:27,478 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 40 states. [2018-06-22 01:17:27,813 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:27,813 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-22 01:17:27,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:17:27,814 INFO ]: Start accepts. Automaton has 40 states. Word has length 34 [2018-06-22 01:17:27,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:27,814 INFO ]: With dead ends: 53 [2018-06-22 01:17:27,814 INFO ]: Without dead ends: 53 [2018-06-22 01:17:27,814 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1222, Invalid=2938, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 01:17:27,814 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:17:27,816 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-06-22 01:17:27,816 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:17:27,816 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-22 01:17:27,816 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-06-22 01:17:27,816 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:27,816 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-22 01:17:27,816 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:17:27,816 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-22 01:17:27,817 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:17:27,817 INFO ]: Found error trace [2018-06-22 01:17:27,817 INFO ]: trace histogram [13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:27,817 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:27,817 INFO ]: Analyzing trace with hash -375869108, now seen corresponding path program 34 times [2018-06-22 01:17:27,817 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:27,817 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:27,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:27,817 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:27,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:27,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:28,530 INFO ]: Checked inductivity of 157 backedges. 66 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:28,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:28,530 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:28,544 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:17:28,584 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:17:28,584 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:28,587 INFO ]: Computing forward predicates... [2018-06-22 01:17:28,852 INFO ]: Checked inductivity of 157 backedges. 91 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:28,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:28,872 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 41 [2018-06-22 01:17:28,872 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:17:28,872 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:17:28,872 INFO ]: CoverageRelationStatistics Valid=393, Invalid=1247, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:17:28,872 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 41 states. [2018-06-22 01:17:29,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:29,114 INFO ]: Finished difference Result 50 states and 52 transitions. [2018-06-22 01:17:29,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:17:29,114 INFO ]: Start accepts. Automaton has 41 states. Word has length 34 [2018-06-22 01:17:29,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:29,114 INFO ]: With dead ends: 50 [2018-06-22 01:17:29,114 INFO ]: Without dead ends: 36 [2018-06-22 01:17:29,115 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=722, Invalid=2248, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:17:29,115 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:17:29,116 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 01:17:29,116 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:17:29,116 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-22 01:17:29,116 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-22 01:17:29,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:29,116 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-22 01:17:29,116 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:17:29,116 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-22 01:17:29,116 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:17:29,116 INFO ]: Found error trace [2018-06-22 01:17:29,116 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:29,116 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:29,116 INFO ]: Analyzing trace with hash 1074387422, now seen corresponding path program 35 times [2018-06-22 01:17:29,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:29,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:29,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:29,117 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:29,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:29,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:29,774 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:29,774 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:29,774 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:29,780 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:17:29,833 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 01:17:29,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:29,837 INFO ]: Computing forward predicates... [2018-06-22 01:17:29,902 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:29,922 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:29,922 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-22 01:17:29,922 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:17:29,922 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:17:29,922 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:17:29,923 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 30 states. [2018-06-22 01:17:30,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:30,967 INFO ]: Finished difference Result 55 states and 58 transitions. [2018-06-22 01:17:30,967 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:17:30,967 INFO ]: Start accepts. Automaton has 30 states. Word has length 35 [2018-06-22 01:17:30,967 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:30,968 INFO ]: With dead ends: 55 [2018-06-22 01:17:30,968 INFO ]: Without dead ends: 55 [2018-06-22 01:17:30,968 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=241, Invalid=3181, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:17:30,968 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:17:30,969 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-06-22 01:17:30,969 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:17:30,969 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-22 01:17:30,969 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-22 01:17:30,969 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:30,969 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-22 01:17:30,969 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:17:30,969 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-22 01:17:30,970 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:17:30,970 INFO ]: Found error trace [2018-06-22 01:17:30,970 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:30,970 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:30,970 INFO ]: Analyzing trace with hash -1212300404, now seen corresponding path program 36 times [2018-06-22 01:17:30,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:30,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:30,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:30,970 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:30,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:30,980 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:31,261 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:17:31,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:31,261 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:31,267 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:17:31,316 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:17:31,316 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:31,319 INFO ]: Computing forward predicates... [2018-06-22 01:17:31,540 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:17:31,559 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:31,559 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2018-06-22 01:17:31,559 INFO ]: Interpolant automaton has 43 states [2018-06-22 01:17:31,559 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 01:17:31,559 INFO ]: CoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:17:31,559 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 43 states. [2018-06-22 01:17:32,039 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:32,039 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-22 01:17:32,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:17:32,039 INFO ]: Start accepts. Automaton has 43 states. Word has length 36 [2018-06-22 01:17:32,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:32,039 INFO ]: With dead ends: 56 [2018-06-22 01:17:32,039 INFO ]: Without dead ends: 56 [2018-06-22 01:17:32,040 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1414, Invalid=3416, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:17:32,040 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:17:32,041 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 37. [2018-06-22 01:17:32,041 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:17:32,041 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-22 01:17:32,041 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-06-22 01:17:32,041 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:32,041 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-22 01:17:32,041 INFO ]: Interpolant automaton has 43 states. [2018-06-22 01:17:32,041 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-22 01:17:32,042 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:17:32,042 INFO ]: Found error trace [2018-06-22 01:17:32,042 INFO ]: trace histogram [14, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:32,042 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:32,042 INFO ]: Analyzing trace with hash -1112869042, now seen corresponding path program 37 times [2018-06-22 01:17:32,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:32,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:32,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:32,042 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:32,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:32,051 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:32,437 INFO ]: Checked inductivity of 183 backedges. 78 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:32,437 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:32,437 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:32,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:32,488 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:32,491 INFO ]: Computing forward predicates... [2018-06-22 01:17:32,844 INFO ]: Checked inductivity of 183 backedges. 105 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:32,862 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:32,863 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 44 [2018-06-22 01:17:32,863 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:17:32,863 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:17:32,863 INFO ]: CoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:17:32,863 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 44 states. [2018-06-22 01:17:33,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:33,215 INFO ]: Finished difference Result 53 states and 55 transitions. [2018-06-22 01:17:33,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:17:33,215 INFO ]: Start accepts. Automaton has 44 states. Word has length 36 [2018-06-22 01:17:33,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:33,216 INFO ]: With dead ends: 53 [2018-06-22 01:17:33,216 INFO ]: Without dead ends: 38 [2018-06-22 01:17:33,216 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=826, Invalid=2596, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:17:33,216 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:17:33,217 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 01:17:33,217 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:17:33,217 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-22 01:17:33,217 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-06-22 01:17:33,217 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:33,217 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-22 01:17:33,217 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:17:33,217 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-22 01:17:33,217 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:17:33,217 INFO ]: Found error trace [2018-06-22 01:17:33,217 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:33,217 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:33,217 INFO ]: Analyzing trace with hash 1014252384, now seen corresponding path program 38 times [2018-06-22 01:17:33,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:33,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:33,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:33,218 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:33,218 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:33,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:33,702 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:33,702 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:33,702 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:33,707 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:17:33,756 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:17:33,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:33,760 INFO ]: Computing forward predicates... [2018-06-22 01:17:33,865 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:33,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:33,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-22 01:17:33,885 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:17:33,885 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:17:33,885 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:17:33,885 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 32 states. [2018-06-22 01:17:34,917 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:34,917 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-22 01:17:34,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:17:34,937 INFO ]: Start accepts. Automaton has 32 states. Word has length 37 [2018-06-22 01:17:34,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:34,938 INFO ]: With dead ends: 58 [2018-06-22 01:17:34,938 INFO ]: Without dead ends: 58 [2018-06-22 01:17:34,938 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=258, Invalid=3648, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:17:34,938 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 01:17:34,939 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 40. [2018-06-22 01:17:34,939 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:17:34,940 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-06-22 01:17:34,940 INFO ]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-06-22 01:17:34,940 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:34,940 INFO ]: Abstraction has 40 states and 42 transitions. [2018-06-22 01:17:34,940 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:17:34,940 INFO ]: Start isEmpty. Operand 40 states and 42 transitions. [2018-06-22 01:17:34,940 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:17:34,940 INFO ]: Found error trace [2018-06-22 01:17:34,940 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:34,940 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:34,940 INFO ]: Analyzing trace with hash -1764460146, now seen corresponding path program 39 times [2018-06-22 01:17:34,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:34,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:34,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:34,941 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:34,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:34,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:35,397 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:17:35,397 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:35,397 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:35,403 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:17:35,457 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 01:17:35,457 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:35,461 INFO ]: Computing forward predicates... [2018-06-22 01:17:35,792 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:17:35,811 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:35,811 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2018-06-22 01:17:35,811 INFO ]: Interpolant automaton has 46 states [2018-06-22 01:17:35,811 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 01:17:35,811 INFO ]: CoverageRelationStatistics Valid=510, Invalid=1560, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:17:35,811 INFO ]: Start difference. First operand 40 states and 42 transitions. Second operand 46 states. [2018-06-22 01:17:36,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:36,404 INFO ]: Finished difference Result 59 states and 62 transitions. [2018-06-22 01:17:36,404 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 01:17:36,404 INFO ]: Start accepts. Automaton has 46 states. Word has length 38 [2018-06-22 01:17:36,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:36,405 INFO ]: With dead ends: 59 [2018-06-22 01:17:36,405 INFO ]: Without dead ends: 59 [2018-06-22 01:17:36,406 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1502 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1620, Invalid=3930, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 01:17:36,406 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 01:17:36,407 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 39. [2018-06-22 01:17:36,407 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:17:36,407 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-22 01:17:36,407 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-06-22 01:17:36,407 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:36,407 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-22 01:17:36,407 INFO ]: Interpolant automaton has 46 states. [2018-06-22 01:17:36,407 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-22 01:17:36,407 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:17:36,407 INFO ]: Found error trace [2018-06-22 01:17:36,407 INFO ]: trace histogram [15, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:36,407 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:36,407 INFO ]: Analyzing trace with hash 1317912076, now seen corresponding path program 40 times [2018-06-22 01:17:36,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:36,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:36,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:36,408 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:36,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:36,416 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:36,773 INFO ]: Checked inductivity of 211 backedges. 91 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:36,773 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:36,773 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:36,779 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:17:36,836 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:17:36,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:36,841 INFO ]: Computing forward predicates... [2018-06-22 01:17:37,194 INFO ]: Checked inductivity of 211 backedges. 120 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:37,213 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:37,213 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 47 [2018-06-22 01:17:37,213 INFO ]: Interpolant automaton has 47 states [2018-06-22 01:17:37,213 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-22 01:17:37,214 INFO ]: CoverageRelationStatistics Valid=513, Invalid=1649, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:17:37,214 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 47 states. [2018-06-22 01:17:37,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:37,555 INFO ]: Finished difference Result 56 states and 58 transitions. [2018-06-22 01:17:37,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:17:37,555 INFO ]: Start accepts. Automaton has 47 states. Word has length 38 [2018-06-22 01:17:37,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:37,555 INFO ]: With dead ends: 56 [2018-06-22 01:17:37,555 INFO ]: Without dead ends: 40 [2018-06-22 01:17:37,556 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=937, Invalid=2969, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:17:37,556 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:17:37,557 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-22 01:17:37,557 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:17:37,557 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-22 01:17:37,557 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-22 01:17:37,557 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:37,557 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-22 01:17:37,557 INFO ]: Interpolant automaton has 47 states. [2018-06-22 01:17:37,557 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-22 01:17:37,558 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:17:37,558 INFO ]: Found error trace [2018-06-22 01:17:37,558 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:37,558 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:37,558 INFO ]: Analyzing trace with hash 1077169566, now seen corresponding path program 41 times [2018-06-22 01:17:37,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:37,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:37,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:37,558 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:37,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:37,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:38,482 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:38,482 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:38,482 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:38,488 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:17:38,552 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 01:17:38,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:38,556 INFO ]: Computing forward predicates... [2018-06-22 01:17:38,636 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:38,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:38,654 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-22 01:17:38,655 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:17:38,655 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:17:38,655 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:17:38,655 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 34 states. [2018-06-22 01:17:39,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:39,830 INFO ]: Finished difference Result 61 states and 64 transitions. [2018-06-22 01:17:39,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:17:39,830 INFO ]: Start accepts. Automaton has 34 states. Word has length 39 [2018-06-22 01:17:39,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:39,830 INFO ]: With dead ends: 61 [2018-06-22 01:17:39,830 INFO ]: Without dead ends: 61 [2018-06-22 01:17:39,831 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=275, Invalid=4147, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 01:17:39,831 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 01:17:39,833 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 42. [2018-06-22 01:17:39,833 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:17:39,833 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-22 01:17:39,833 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-06-22 01:17:39,833 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:39,833 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-22 01:17:39,833 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:17:39,833 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-22 01:17:39,834 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:17:39,834 INFO ]: Found error trace [2018-06-22 01:17:39,834 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:39,834 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:39,834 INFO ]: Analyzing trace with hash -2090880948, now seen corresponding path program 42 times [2018-06-22 01:17:39,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:39,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:39,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:39,834 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:39,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:39,843 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:40,242 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:17:40,242 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:40,242 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:40,254 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:17:40,310 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 01:17:40,310 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:40,313 INFO ]: Computing forward predicates... [2018-06-22 01:17:40,579 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:17:40,598 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:40,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2018-06-22 01:17:40,598 INFO ]: Interpolant automaton has 49 states [2018-06-22 01:17:40,598 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 01:17:40,598 INFO ]: CoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:17:40,599 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 49 states. [2018-06-22 01:17:41,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:41,241 INFO ]: Finished difference Result 62 states and 65 transitions. [2018-06-22 01:17:41,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 01:17:41,241 INFO ]: Start accepts. Automaton has 49 states. Word has length 40 [2018-06-22 01:17:41,241 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:41,242 INFO ]: With dead ends: 62 [2018-06-22 01:17:41,242 INFO ]: Without dead ends: 62 [2018-06-22 01:17:41,243 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1840, Invalid=4480, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 01:17:41,243 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 01:17:41,244 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 41. [2018-06-22 01:17:41,244 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:17:41,245 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-22 01:17:41,245 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2018-06-22 01:17:41,245 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:41,245 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-22 01:17:41,245 INFO ]: Interpolant automaton has 49 states. [2018-06-22 01:17:41,245 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-22 01:17:41,245 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:17:41,245 INFO ]: Found error trace [2018-06-22 01:17:41,245 INFO ]: trace histogram [16, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:41,245 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:41,245 INFO ]: Analyzing trace with hash -1026622578, now seen corresponding path program 43 times [2018-06-22 01:17:41,245 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:41,245 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:41,246 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:41,246 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:41,246 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:41,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:42,087 INFO ]: Checked inductivity of 241 backedges. 105 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:42,087 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:42,087 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:42,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:42,141 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:42,145 INFO ]: Computing forward predicates... [2018-06-22 01:17:42,556 INFO ]: Checked inductivity of 241 backedges. 136 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:42,576 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:42,576 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 50 [2018-06-22 01:17:42,576 INFO ]: Interpolant automaton has 50 states [2018-06-22 01:17:42,577 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 01:17:42,577 INFO ]: CoverageRelationStatistics Valid=579, Invalid=1871, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:17:42,577 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 50 states. [2018-06-22 01:17:42,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:42,991 INFO ]: Finished difference Result 59 states and 61 transitions. [2018-06-22 01:17:42,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:17:42,991 INFO ]: Start accepts. Automaton has 50 states. Word has length 40 [2018-06-22 01:17:42,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:42,991 INFO ]: With dead ends: 59 [2018-06-22 01:17:42,991 INFO ]: Without dead ends: 42 [2018-06-22 01:17:42,991 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1055, Invalid=3367, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 01:17:42,991 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:17:42,992 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 01:17:42,992 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:17:42,992 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-06-22 01:17:42,992 INFO ]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-06-22 01:17:42,992 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:42,992 INFO ]: Abstraction has 42 states and 43 transitions. [2018-06-22 01:17:42,992 INFO ]: Interpolant automaton has 50 states. [2018-06-22 01:17:42,993 INFO ]: Start isEmpty. Operand 42 states and 43 transitions. [2018-06-22 01:17:42,993 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:17:42,993 INFO ]: Found error trace [2018-06-22 01:17:42,993 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:42,993 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:42,993 INFO ]: Analyzing trace with hash -451940704, now seen corresponding path program 44 times [2018-06-22 01:17:42,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:42,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:42,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:42,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:17:42,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:43,011 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:44,490 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:44,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:44,490 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:44,495 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:17:44,545 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:17:44,545 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:44,550 INFO ]: Computing forward predicates... [2018-06-22 01:17:44,629 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:44,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:44,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-22 01:17:44,656 INFO ]: Interpolant automaton has 36 states [2018-06-22 01:17:44,656 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 01:17:44,656 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:17:44,656 INFO ]: Start difference. First operand 42 states and 43 transitions. Second operand 36 states. [2018-06-22 01:17:45,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:45,959 INFO ]: Finished difference Result 64 states and 67 transitions. [2018-06-22 01:17:45,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:17:45,959 INFO ]: Start accepts. Automaton has 36 states. Word has length 41 [2018-06-22 01:17:45,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:45,959 INFO ]: With dead ends: 64 [2018-06-22 01:17:45,959 INFO ]: Without dead ends: 64 [2018-06-22 01:17:45,959 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=292, Invalid=4678, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 01:17:45,960 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 01:17:45,961 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 44. [2018-06-22 01:17:45,961 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:17:45,961 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-22 01:17:45,961 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-06-22 01:17:45,962 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:45,962 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-22 01:17:45,962 INFO ]: Interpolant automaton has 36 states. [2018-06-22 01:17:45,962 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-22 01:17:45,962 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:17:45,962 INFO ]: Found error trace [2018-06-22 01:17:45,962 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:45,962 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:45,962 INFO ]: Analyzing trace with hash 183328206, now seen corresponding path program 45 times [2018-06-22 01:17:45,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:45,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:45,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:45,963 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:45,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:45,974 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:46,735 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:17:46,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:46,736 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:46,741 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:17:46,800 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:17:46,800 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:46,803 INFO ]: Computing forward predicates... [2018-06-22 01:17:47,239 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:17:47,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:47,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2018-06-22 01:17:47,258 INFO ]: Interpolant automaton has 52 states [2018-06-22 01:17:47,259 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 01:17:47,259 INFO ]: CoverageRelationStatistics Valid=646, Invalid=2006, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:17:47,259 INFO ]: Start difference. First operand 44 states and 46 transitions. Second operand 52 states. [2018-06-22 01:17:48,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:48,096 INFO ]: Finished difference Result 65 states and 68 transitions. [2018-06-22 01:17:48,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 01:17:48,096 INFO ]: Start accepts. Automaton has 52 states. Word has length 42 [2018-06-22 01:17:48,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:48,096 INFO ]: With dead ends: 65 [2018-06-22 01:17:48,096 INFO ]: Without dead ends: 65 [2018-06-22 01:17:48,097 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2074, Invalid=5066, Unknown=0, NotChecked=0, Total=7140 [2018-06-22 01:17:48,097 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 01:17:48,098 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 43. [2018-06-22 01:17:48,098 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:17:48,098 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-06-22 01:17:48,099 INFO ]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 42 [2018-06-22 01:17:48,099 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:48,099 INFO ]: Abstraction has 43 states and 44 transitions. [2018-06-22 01:17:48,099 INFO ]: Interpolant automaton has 52 states. [2018-06-22 01:17:48,099 INFO ]: Start isEmpty. Operand 43 states and 44 transitions. [2018-06-22 01:17:48,099 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:17:48,099 INFO ]: Found error trace [2018-06-22 01:17:48,099 INFO ]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:48,099 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:48,099 INFO ]: Analyzing trace with hash -1184400692, now seen corresponding path program 46 times [2018-06-22 01:17:48,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:48,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:48,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:48,100 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:48,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:48,109 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:49,525 INFO ]: Checked inductivity of 273 backedges. 120 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:49,525 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:49,525 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:49,530 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:17:49,581 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:17:49,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:49,584 INFO ]: Computing forward predicates... [2018-06-22 01:17:50,028 INFO ]: Checked inductivity of 273 backedges. 153 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:50,047 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:17:50,047 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 53 [2018-06-22 01:17:50,048 INFO ]: Interpolant automaton has 53 states [2018-06-22 01:17:50,048 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-22 01:17:50,048 INFO ]: CoverageRelationStatistics Valid=649, Invalid=2107, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:17:50,048 INFO ]: Start difference. First operand 43 states and 44 transitions. Second operand 53 states. [2018-06-22 01:17:50,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:17:50,450 INFO ]: Finished difference Result 62 states and 64 transitions. [2018-06-22 01:17:50,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:17:50,450 INFO ]: Start accepts. Automaton has 53 states. Word has length 42 [2018-06-22 01:17:50,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:17:50,450 INFO ]: With dead ends: 62 [2018-06-22 01:17:50,450 INFO ]: Without dead ends: 44 [2018-06-22 01:17:50,450 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1180, Invalid=3790, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 01:17:50,451 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 01:17:50,451 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 01:17:50,451 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:17:50,452 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-06-22 01:17:50,452 INFO ]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-06-22 01:17:50,452 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:17:50,452 INFO ]: Abstraction has 44 states and 45 transitions. [2018-06-22 01:17:50,452 INFO ]: Interpolant automaton has 53 states. [2018-06-22 01:17:50,452 INFO ]: Start isEmpty. Operand 44 states and 45 transitions. [2018-06-22 01:17:50,452 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:17:50,452 INFO ]: Found error trace [2018-06-22 01:17:50,452 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:17:50,452 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:17:50,452 INFO ]: Analyzing trace with hash 1329066334, now seen corresponding path program 47 times [2018-06-22 01:17:50,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:17:50,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:17:50,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:50,452 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:17:50,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:17:50,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:51,319 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:17:51,319 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:17:51,319 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:51,325 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:17:51,389 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 01:17:51,389 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:17:51,395 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 01:17:52,029 INFO ]: Timeout while computing interpolants [2018-06-22 01:17:52,229 WARN ]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:17:52,229 WARN ]: Verification canceled [2018-06-22 01:17:52,234 WARN ]: Timeout [2018-06-22 01:17:52,234 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:17:52 BoogieIcfgContainer [2018-06-22 01:17:52,234 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:17:52,235 INFO ]: Toolchain (without parser) took 57234.82 ms. Allocated memory was 308.8 MB in the beginning and 618.1 MB in the end (delta: 309.3 MB). Free memory was 265.2 MB in the beginning and 206.1 MB in the end (delta: 59.1 MB). Peak memory consumption was 368.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:17:52,236 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:17:52,236 INFO ]: ChcToBoogie took 64.68 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 263.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:17:52,237 INFO ]: Boogie Preprocessor took 33.22 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:17:52,237 INFO ]: RCFGBuilder took 257.48 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 253.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:17:52,237 INFO ]: TraceAbstraction took 56863.94 ms. Allocated memory was 308.8 MB in the beginning and 618.1 MB in the end (delta: 309.3 MB). Free memory was 253.2 MB in the beginning and 206.1 MB in the end (delta: 47.2 MB). Peak memory consumption was 356.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:17:52,250 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.68 ms. Allocated memory is still 308.8 MB. Free memory was 265.2 MB in the beginning and 263.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.22 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 257.48 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 253.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56863.94 ms. Allocated memory was 308.8 MB in the beginning and 618.1 MB in the end (delta: 309.3 MB). Free memory was 253.2 MB in the beginning and 206.1 MB in the end (delta: 47.2 MB). Peak memory consumption was 356.5 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 analyzing trace of length 44 with TraceHistMax 17, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 56.8s OverallTime, 50 OverallIterations, 17 TraceHistogramMax, 20.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 570 SDtfs, 1403 SDslu, 6690 SDs, 0 SdLazy, 13119 SolverSat, 2059 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3053 GetRequests, 975 SyntacticMatches, 77 SemanticMatches, 2001 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20630 ImplicationChecksByTransitivity, 40.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=47, 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, 49 MinimizatonAttempts, 432 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 30.4s InterpolantComputationTime, 2570 NumberOfCodeBlocks, 2570 NumberOfCodeBlocksAsserted, 212 NumberOfCheckSat, 2473 ConstructedInterpolants, 0 QuantifiedInterpolants, 335824 SizeOfPredicates, 256 NumberOfNonLiveVariables, 15072 ConjunctsInSsa, 3344 ConjunctsInUnsatCore, 97 InterpolantComputations, 2 PerfectInterpolantSequences, 3280/9552 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/upcount_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-17-52-268.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-17-52-268.csv Completed graceful shutdown