java -Xss4m -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/llreve-bench/smt2/loop__barthe2-big2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:50:33,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:50:33,774 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:50:33,786 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:50:33,786 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:50:33,787 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:50:33,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:50:33,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:50:33,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:50:33,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:50:33,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:50:33,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:50:33,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:50:33,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:50:33,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:50:33,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:50:33,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:50:33,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:50:33,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:50:33,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:50:33,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:50:33,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:50:33,806 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:50:33,806 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:50:33,807 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:50:33,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:50:33,809 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:50:33,810 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:50:33,811 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:50:33,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:50:33,812 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:50:33,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:50:33,813 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:50:33,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:50:33,814 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:50:33,814 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:50:33,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:50:33,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:50:33,829 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:50:33,829 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:50:33,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:50:33,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:50:33,830 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:50:33,831 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:50:33,831 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:50:33,831 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:50:33,831 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:50:33,831 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:50:33,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:50:33,832 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:50:33,832 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:50:33,832 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:50:33,832 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:50:33,833 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:50:33,833 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:50:33,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:50:33,833 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:50:33,834 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:50:33,834 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:50:33,884 INFO ]: Repository-Root is: /tmp [2018-06-25 09:50:33,897 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:50:33,904 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:50:33,906 INFO ]: Initializing SmtParser... [2018-06-25 09:50:33,906 INFO ]: SmtParser initialized [2018-06-25 09:50:33,907 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 [2018-06-25 09:50:33,908 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-25 09:50:33,996 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@49cad285 [2018-06-25 09:50:34,198 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big2.smt2 [2018-06-25 09:50:34,203 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:50:34,217 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:50:34,218 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:50:34,218 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:50:34,218 INFO ]: ChcToBoogie initialized [2018-06-25 09:50:34,221 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:50:34" (1/1) ... [2018-06-25 09:50:34,293 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:34 Unit [2018-06-25 09:50:34,293 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:50:34,294 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:50:34,294 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:50:34,294 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:50:34,315 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:34" (1/1) ... [2018-06-25 09:50:34,315 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:34" (1/1) ... [2018-06-25 09:50:34,322 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:34" (1/1) ... [2018-06-25 09:50:34,322 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:34" (1/1) ... [2018-06-25 09:50:34,327 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:34" (1/1) ... [2018-06-25 09:50:34,329 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:34" (1/1) ... [2018-06-25 09:50:34,330 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:34" (1/1) ... [2018-06-25 09:50:34,332 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:50:34,333 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:50:34,333 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:50:34,333 INFO ]: RCFGBuilder initialized [2018-06-25 09:50:34,334 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:34" (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-25 09:50:34,351 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:50:34,351 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:50:34,351 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:50:34,351 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:50:34,351 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:50:34,351 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-25 09:50:34,695 INFO ]: Using library mode [2018-06-25 09:50:34,695 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:50:34 BoogieIcfgContainer [2018-06-25 09:50:34,695 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:50:34,697 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:50:34,697 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:50:34,700 INFO ]: TraceAbstraction initialized [2018-06-25 09:50:34,700 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:50:34" (1/3) ... [2018-06-25 09:50:34,701 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9334b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:50:34, skipping insertion in model container [2018-06-25 09:50:34,701 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:34" (2/3) ... [2018-06-25 09:50:34,701 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9334b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:50:34, skipping insertion in model container [2018-06-25 09:50:34,701 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:50:34" (3/3) ... [2018-06-25 09:50:34,703 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:50:34,711 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:50:34,721 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:50:34,757 INFO ]: Using default assertion order modulation [2018-06-25 09:50:34,757 INFO ]: Interprodecural is true [2018-06-25 09:50:34,758 INFO ]: Hoare is false [2018-06-25 09:50:34,758 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:50:34,758 INFO ]: Backedges is TWOTRACK [2018-06-25 09:50:34,758 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:50:34,758 INFO ]: Difference is false [2018-06-25 09:50:34,758 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:50:34,758 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:50:34,769 INFO ]: Start isEmpty. Operand 12 states. [2018-06-25 09:50:34,778 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:50:34,779 INFO ]: Found error trace [2018-06-25 09:50:34,779 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:34,780 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:34,784 INFO ]: Analyzing trace with hash 1877976436, now seen corresponding path program 1 times [2018-06-25 09:50:34,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:34,787 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:34,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:34,824 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:34,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:34,866 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:34,980 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:34,982 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:34,982 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:50:34,983 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:50:34,994 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:50:34,994 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:34,996 INFO ]: Start difference. First operand 12 states. Second operand 5 states. [2018-06-25 09:50:35,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:35,375 INFO ]: Finished difference Result 17 states and 39 transitions. [2018-06-25 09:50:35,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:35,376 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-25 09:50:35,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:35,386 INFO ]: With dead ends: 17 [2018-06-25 09:50:35,386 INFO ]: Without dead ends: 16 [2018-06-25 09:50:35,387 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-25 09:50:35,401 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:50:35,421 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 09:50:35,423 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:50:35,423 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-06-25 09:50:35,424 INFO ]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 9 [2018-06-25 09:50:35,426 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:35,426 INFO ]: Abstraction has 12 states and 25 transitions. [2018-06-25 09:50:35,426 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:50:35,426 INFO ]: Start isEmpty. Operand 12 states and 25 transitions. [2018-06-25 09:50:35,427 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:50:35,427 INFO ]: Found error trace [2018-06-25 09:50:35,427 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:35,427 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:35,427 INFO ]: Analyzing trace with hash -1819955914, now seen corresponding path program 1 times [2018-06-25 09:50:35,427 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:35,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:35,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:35,428 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:35,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:35,473 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:35,634 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:35,634 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:35,634 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:35,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:35,694 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:35,702 INFO ]: Computing forward predicates... [2018-06-25 09:50:35,965 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:35,985 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:35,985 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-25 09:50:35,986 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:50:35,986 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:50:35,986 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:35,986 INFO ]: Start difference. First operand 12 states and 25 transitions. Second operand 9 states. [2018-06-25 09:50:36,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:36,258 INFO ]: Finished difference Result 18 states and 42 transitions. [2018-06-25 09:50:36,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:50:36,260 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 09:50:36,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:36,260 INFO ]: With dead ends: 18 [2018-06-25 09:50:36,260 INFO ]: Without dead ends: 17 [2018-06-25 09:50:36,261 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:50:36,262 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:50:36,268 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-25 09:50:36,269 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:50:36,269 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2018-06-25 09:50:36,269 INFO ]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 10 [2018-06-25 09:50:36,269 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:36,269 INFO ]: Abstraction has 13 states and 28 transitions. [2018-06-25 09:50:36,269 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:50:36,269 INFO ]: Start isEmpty. Operand 13 states and 28 transitions. [2018-06-25 09:50:36,270 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:50:36,270 INFO ]: Found error trace [2018-06-25 09:50:36,270 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:36,270 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:36,270 INFO ]: Analyzing trace with hash -1705439310, now seen corresponding path program 1 times [2018-06-25 09:50:36,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:36,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:36,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:36,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:36,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:36,293 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:36,338 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:36,338 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:36,338 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:36,338 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:36,338 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:36,338 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:36,339 INFO ]: Start difference. First operand 13 states and 28 transitions. Second operand 4 states. [2018-06-25 09:50:36,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:36,664 INFO ]: Finished difference Result 18 states and 40 transitions. [2018-06-25 09:50:36,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:50:36,665 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-25 09:50:36,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:36,666 INFO ]: With dead ends: 18 [2018-06-25 09:50:36,666 INFO ]: Without dead ends: 18 [2018-06-25 09:50:36,666 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:36,666 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:50:36,668 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-25 09:50:36,668 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:50:36,669 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. [2018-06-25 09:50:36,669 INFO ]: Start accepts. Automaton has 15 states and 34 transitions. Word has length 10 [2018-06-25 09:50:36,669 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:36,669 INFO ]: Abstraction has 15 states and 34 transitions. [2018-06-25 09:50:36,669 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:36,669 INFO ]: Start isEmpty. Operand 15 states and 34 transitions. [2018-06-25 09:50:36,669 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:50:36,669 INFO ]: Found error trace [2018-06-25 09:50:36,669 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:36,669 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:36,669 INFO ]: Analyzing trace with hash 1215923384, now seen corresponding path program 1 times [2018-06-25 09:50:36,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:36,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:36,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:36,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:36,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:36,693 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:36,764 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:36,764 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:36,764 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:50:36,764 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:50:36,764 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:50:36,764 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:36,764 INFO ]: Start difference. First operand 15 states and 34 transitions. Second operand 5 states. [2018-06-25 09:50:36,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:36,867 INFO ]: Finished difference Result 27 states and 68 transitions. [2018-06-25 09:50:36,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:36,868 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-25 09:50:36,868 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:36,869 INFO ]: With dead ends: 27 [2018-06-25 09:50:36,869 INFO ]: Without dead ends: 27 [2018-06-25 09:50:36,869 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:50:36,869 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:50:36,872 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-25 09:50:36,872 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:50:36,873 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 59 transitions. [2018-06-25 09:50:36,873 INFO ]: Start accepts. Automaton has 23 states and 59 transitions. Word has length 10 [2018-06-25 09:50:36,873 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:36,873 INFO ]: Abstraction has 23 states and 59 transitions. [2018-06-25 09:50:36,873 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:50:36,873 INFO ]: Start isEmpty. Operand 23 states and 59 transitions. [2018-06-25 09:50:36,874 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:50:36,874 INFO ]: Found error trace [2018-06-25 09:50:36,874 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:36,874 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:36,874 INFO ]: Analyzing trace with hash 470970812, now seen corresponding path program 1 times [2018-06-25 09:50:36,874 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:36,874 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:36,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:36,875 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:36,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:36,885 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:36,939 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:36,939 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:36,939 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:36,939 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:36,939 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:36,940 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:36,940 INFO ]: Start difference. First operand 23 states and 59 transitions. Second operand 4 states. [2018-06-25 09:50:36,987 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:36,988 INFO ]: Finished difference Result 34 states and 86 transitions. [2018-06-25 09:50:36,988 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:50:36,988 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-25 09:50:36,988 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:36,989 INFO ]: With dead ends: 34 [2018-06-25 09:50:36,989 INFO ]: Without dead ends: 34 [2018-06-25 09:50:36,989 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:36,989 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:50:36,992 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 23. [2018-06-25 09:50:36,992 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:50:36,993 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 57 transitions. [2018-06-25 09:50:36,993 INFO ]: Start accepts. Automaton has 23 states and 57 transitions. Word has length 10 [2018-06-25 09:50:36,993 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:36,993 INFO ]: Abstraction has 23 states and 57 transitions. [2018-06-25 09:50:36,993 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:36,993 INFO ]: Start isEmpty. Operand 23 states and 57 transitions. [2018-06-25 09:50:36,993 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:36,994 INFO ]: Found error trace [2018-06-25 09:50:36,994 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:36,994 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:36,994 INFO ]: Analyzing trace with hash -491741772, now seen corresponding path program 2 times [2018-06-25 09:50:36,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:36,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:36,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:36,995 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:36,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:37,010 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:37,091 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:37,091 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:37,091 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-25 09:50:37,099 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:50:37,122 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:37,122 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:37,124 INFO ]: Computing forward predicates... [2018-06-25 09:50:37,276 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:37,295 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:37,295 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-25 09:50:37,295 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:50:37,295 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:50:37,295 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:37,295 INFO ]: Start difference. First operand 23 states and 57 transitions. Second operand 9 states. [2018-06-25 09:50:37,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:37,671 INFO ]: Finished difference Result 53 states and 123 transitions. [2018-06-25 09:50:37,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:50:37,671 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-25 09:50:37,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:37,672 INFO ]: With dead ends: 53 [2018-06-25 09:50:37,672 INFO ]: Without dead ends: 48 [2018-06-25 09:50:37,673 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:50:37,673 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 09:50:37,679 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 24. [2018-06-25 09:50:37,679 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:50:37,682 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 54 transitions. [2018-06-25 09:50:37,682 INFO ]: Start accepts. Automaton has 24 states and 54 transitions. Word has length 11 [2018-06-25 09:50:37,682 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:37,682 INFO ]: Abstraction has 24 states and 54 transitions. [2018-06-25 09:50:37,682 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:50:37,682 INFO ]: Start isEmpty. Operand 24 states and 54 transitions. [2018-06-25 09:50:37,682 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:37,682 INFO ]: Found error trace [2018-06-25 09:50:37,682 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:37,682 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:37,683 INFO ]: Analyzing trace with hash -1338281654, now seen corresponding path program 1 times [2018-06-25 09:50:37,683 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:37,683 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:37,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:37,683 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:37,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:37,712 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:37,850 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:37,850 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:37,850 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:37,862 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:37,883 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:37,884 INFO ]: Computing forward predicates... [2018-06-25 09:50:37,889 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:37,910 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:37,910 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 09:50:37,910 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:50:37,910 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:50:37,910 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:37,910 INFO ]: Start difference. First operand 24 states and 54 transitions. Second operand 5 states. [2018-06-25 09:50:38,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:38,131 INFO ]: Finished difference Result 33 states and 70 transitions. [2018-06-25 09:50:38,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:38,131 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 09:50:38,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:38,132 INFO ]: With dead ends: 33 [2018-06-25 09:50:38,132 INFO ]: Without dead ends: 28 [2018-06-25 09:50:38,132 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 12 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-25 09:50:38,133 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:50:38,135 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-06-25 09:50:38,135 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:50:38,135 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2018-06-25 09:50:38,135 INFO ]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2018-06-25 09:50:38,136 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:38,136 INFO ]: Abstraction has 23 states and 48 transitions. [2018-06-25 09:50:38,136 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:50:38,136 INFO ]: Start isEmpty. Operand 23 states and 48 transitions. [2018-06-25 09:50:38,136 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:38,136 INFO ]: Found error trace [2018-06-25 09:50:38,136 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:38,136 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:38,136 INFO ]: Analyzing trace with hash -970351356, now seen corresponding path program 1 times [2018-06-25 09:50:38,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:38,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:38,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:38,137 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:38,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:38,146 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:38,187 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:38,187 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:38,187 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-25 09:50:38,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:38,214 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:38,215 INFO ]: Computing forward predicates... [2018-06-25 09:50:38,246 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:38,266 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:50:38,266 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-25 09:50:38,266 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:50:38,266 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:50:38,266 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:50:38,266 INFO ]: Start difference. First operand 23 states and 48 transitions. Second operand 7 states. [2018-06-25 09:50:38,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:38,454 INFO ]: Finished difference Result 34 states and 72 transitions. [2018-06-25 09:50:38,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:50:38,454 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-25 09:50:38,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:38,455 INFO ]: With dead ends: 34 [2018-06-25 09:50:38,455 INFO ]: Without dead ends: 32 [2018-06-25 09:50:38,455 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:50:38,455 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-25 09:50:38,459 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-25 09:50:38,459 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:50:38,460 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 51 transitions. [2018-06-25 09:50:38,460 INFO ]: Start accepts. Automaton has 26 states and 51 transitions. Word has length 11 [2018-06-25 09:50:38,460 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:38,460 INFO ]: Abstraction has 26 states and 51 transitions. [2018-06-25 09:50:38,460 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:50:38,460 INFO ]: Start isEmpty. Operand 26 states and 51 transitions. [2018-06-25 09:50:38,461 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:38,461 INFO ]: Found error trace [2018-06-25 09:50:38,461 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:38,461 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:38,461 INFO ]: Analyzing trace with hash -1501214196, now seen corresponding path program 1 times [2018-06-25 09:50:38,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:38,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:38,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:38,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:38,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:38,476 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:38,528 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:38,528 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:38,528 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-25 09:50:38,535 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:38,556 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:38,558 INFO ]: Computing forward predicates... [2018-06-25 09:50:38,571 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:38,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:38,594 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 09:50:38,594 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:50:38,595 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:50:38,595 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:50:38,595 INFO ]: Start difference. First operand 26 states and 51 transitions. Second operand 6 states. [2018-06-25 09:50:38,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:38,636 INFO ]: Finished difference Result 33 states and 64 transitions. [2018-06-25 09:50:38,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:38,636 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-25 09:50:38,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:38,636 INFO ]: With dead ends: 33 [2018-06-25 09:50:38,636 INFO ]: Without dead ends: 33 [2018-06-25 09:50:38,637 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:50:38,637 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 09:50:38,639 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-06-25 09:50:38,639 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:50:38,640 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 53 transitions. [2018-06-25 09:50:38,640 INFO ]: Start accepts. Automaton has 28 states and 53 transitions. Word has length 12 [2018-06-25 09:50:38,640 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:38,640 INFO ]: Abstraction has 28 states and 53 transitions. [2018-06-25 09:50:38,640 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:50:38,640 INFO ]: Start isEmpty. Operand 28 states and 53 transitions. [2018-06-25 09:50:38,641 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:38,641 INFO ]: Found error trace [2018-06-25 09:50:38,641 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:38,641 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:38,641 INFO ]: Analyzing trace with hash -555988078, now seen corresponding path program 1 times [2018-06-25 09:50:38,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:38,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:38,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:38,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:38,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:38,654 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:38,687 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:38,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:38,687 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-25 09:50:38,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:38,709 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:38,710 INFO ]: Computing forward predicates... [2018-06-25 09:50:38,726 INFO ]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:38,745 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:38,745 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 09:50:38,745 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:50:38,746 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:50:38,746 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:50:38,746 INFO ]: Start difference. First operand 28 states and 53 transitions. Second operand 7 states. [2018-06-25 09:50:38,801 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:38,801 INFO ]: Finished difference Result 34 states and 68 transitions. [2018-06-25 09:50:38,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:38,802 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-25 09:50:38,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:38,803 INFO ]: With dead ends: 34 [2018-06-25 09:50:38,803 INFO ]: Without dead ends: 32 [2018-06-25 09:50:38,803 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:38,803 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-25 09:50:38,806 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-25 09:50:38,806 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:50:38,806 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-06-25 09:50:38,807 INFO ]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 12 [2018-06-25 09:50:38,807 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:38,807 INFO ]: Abstraction has 30 states and 56 transitions. [2018-06-25 09:50:38,807 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:50:38,807 INFO ]: Start isEmpty. Operand 30 states and 56 transitions. [2018-06-25 09:50:38,807 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:38,807 INFO ]: Found error trace [2018-06-25 09:50:38,807 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:38,807 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:38,807 INFO ]: Analyzing trace with hash -548599910, now seen corresponding path program 1 times [2018-06-25 09:50:38,807 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:38,807 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:38,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:38,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:38,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:38,824 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:38,890 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:38,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:38,890 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-25 09:50:38,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:38,935 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:38,937 INFO ]: Computing forward predicates... [2018-06-25 09:50:39,222 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:39,243 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:50:39,243 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-06-25 09:50:39,243 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:50:39,243 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:50:39,243 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:50:39,243 INFO ]: Start difference. First operand 30 states and 56 transitions. Second operand 8 states. [2018-06-25 09:50:39,292 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:39,292 INFO ]: Finished difference Result 32 states and 57 transitions. [2018-06-25 09:50:39,293 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:50:39,293 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-25 09:50:39,293 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:39,293 INFO ]: With dead ends: 32 [2018-06-25 09:50:39,293 INFO ]: Without dead ends: 30 [2018-06-25 09:50:39,293 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:50:39,294 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 09:50:39,296 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-06-25 09:50:39,296 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:50:39,297 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 50 transitions. [2018-06-25 09:50:39,297 INFO ]: Start accepts. Automaton has 27 states and 50 transitions. Word has length 12 [2018-06-25 09:50:39,297 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:39,297 INFO ]: Abstraction has 27 states and 50 transitions. [2018-06-25 09:50:39,297 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:50:39,297 INFO ]: Start isEmpty. Operand 27 states and 50 transitions. [2018-06-25 09:50:39,298 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:39,298 INFO ]: Found error trace [2018-06-25 09:50:39,298 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:39,298 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:39,298 INFO ]: Analyzing trace with hash 1219019284, now seen corresponding path program 1 times [2018-06-25 09:50:39,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:39,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:39,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:39,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:39,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:39,307 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:39,501 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:39,501 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:39,501 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-25 09:50:39,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:39,537 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:39,539 INFO ]: Computing forward predicates... [2018-06-25 09:50:39,557 INFO ]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:39,577 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:39,577 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-06-25 09:50:39,577 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:50:39,577 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:50:39,577 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:39,577 INFO ]: Start difference. First operand 27 states and 50 transitions. Second operand 9 states. [2018-06-25 09:50:39,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:39,638 INFO ]: Finished difference Result 33 states and 65 transitions. [2018-06-25 09:50:39,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:50:39,638 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-25 09:50:39,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:39,638 INFO ]: With dead ends: 33 [2018-06-25 09:50:39,638 INFO ]: Without dead ends: 31 [2018-06-25 09:50:39,639 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:50:39,639 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:50:39,641 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-25 09:50:39,641 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:50:39,641 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. [2018-06-25 09:50:39,641 INFO ]: Start accepts. Automaton has 29 states and 53 transitions. Word has length 12 [2018-06-25 09:50:39,641 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:39,641 INFO ]: Abstraction has 29 states and 53 transitions. [2018-06-25 09:50:39,641 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:50:39,642 INFO ]: Start isEmpty. Operand 29 states and 53 transitions. [2018-06-25 09:50:39,642 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:39,642 INFO ]: Found error trace [2018-06-25 09:50:39,642 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:39,642 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:39,642 INFO ]: Analyzing trace with hash 1226407452, now seen corresponding path program 1 times [2018-06-25 09:50:39,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:39,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:39,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:39,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:39,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:39,654 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:39,755 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:39,755 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:39,755 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-25 09:50:39,769 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-25 09:50:39,788 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:39,789 INFO ]: Computing forward predicates... [2018-06-25 09:50:39,874 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:39,893 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:50:39,894 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-06-25 09:50:39,894 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:50:39,894 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:50:39,894 INFO ]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:50:39,894 INFO ]: Start difference. First operand 29 states and 53 transitions. Second operand 10 states. [2018-06-25 09:50:40,002 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:40,002 INFO ]: Finished difference Result 29 states and 52 transitions. [2018-06-25 09:50:40,002 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:50:40,002 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-25 09:50:40,002 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:40,002 INFO ]: With dead ends: 29 [2018-06-25 09:50:40,002 INFO ]: Without dead ends: 25 [2018-06-25 09:50:40,003 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:50:40,003 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:50:40,005 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-25 09:50:40,005 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:50:40,005 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2018-06-25 09:50:40,005 INFO ]: Start accepts. Automaton has 25 states and 46 transitions. Word has length 12 [2018-06-25 09:50:40,005 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:40,005 INFO ]: Abstraction has 25 states and 46 transitions. [2018-06-25 09:50:40,005 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:50:40,005 INFO ]: Start isEmpty. Operand 25 states and 46 transitions. [2018-06-25 09:50:40,006 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:50:40,006 INFO ]: Found error trace [2018-06-25 09:50:40,006 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:40,006 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:40,006 INFO ]: Analyzing trace with hash -1284903730, now seen corresponding path program 1 times [2018-06-25 09:50:40,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:40,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:40,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:40,007 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:40,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:40,018 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:40,129 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:40,129 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:40,129 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-25 09:50:40,135 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:40,165 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:40,168 INFO ]: Computing forward predicates... [2018-06-25 09:50:40,511 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:40,533 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:40,533 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-25 09:50:40,533 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:50:40,533 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:50:40,533 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:50:40,534 INFO ]: Start difference. First operand 25 states and 46 transitions. Second operand 12 states. [2018-06-25 09:50:41,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:41,103 INFO ]: Finished difference Result 64 states and 137 transitions. [2018-06-25 09:50:41,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:50:41,103 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-25 09:50:41,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:41,104 INFO ]: With dead ends: 64 [2018-06-25 09:50:41,104 INFO ]: Without dead ends: 56 [2018-06-25 09:50:41,104 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:50:41,104 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-25 09:50:41,107 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 32. [2018-06-25 09:50:41,107 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:50:41,108 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2018-06-25 09:50:41,108 INFO ]: Start accepts. Automaton has 32 states and 61 transitions. Word has length 13 [2018-06-25 09:50:41,108 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:41,108 INFO ]: Abstraction has 32 states and 61 transitions. [2018-06-25 09:50:41,108 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:50:41,108 INFO ]: Start isEmpty. Operand 32 states and 61 transitions. [2018-06-25 09:50:41,108 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:50:41,108 INFO ]: Found error trace [2018-06-25 09:50:41,108 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:41,109 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:41,109 INFO ]: Analyzing trace with hash 582023688, now seen corresponding path program 2 times [2018-06-25 09:50:41,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:41,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:41,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:41,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:41,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:41,123 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:41,185 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:41,185 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:41,185 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-25 09:50:41,191 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:50:41,210 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:41,210 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:41,211 INFO ]: Computing forward predicates... [2018-06-25 09:50:41,231 INFO ]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:41,250 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:41,250 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 09:50:41,251 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:50:41,251 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:50:41,251 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:41,251 INFO ]: Start difference. First operand 32 states and 61 transitions. Second operand 9 states. [2018-06-25 09:50:41,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:41,342 INFO ]: Finished difference Result 50 states and 96 transitions. [2018-06-25 09:50:41,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:50:41,342 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-25 09:50:41,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:41,343 INFO ]: With dead ends: 50 [2018-06-25 09:50:41,343 INFO ]: Without dead ends: 44 [2018-06-25 09:50:41,343 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:50:41,343 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 09:50:41,346 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-06-25 09:50:41,346 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 09:50:41,346 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 62 transitions. [2018-06-25 09:50:41,346 INFO ]: Start accepts. Automaton has 34 states and 62 transitions. Word has length 13 [2018-06-25 09:50:41,346 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:41,346 INFO ]: Abstraction has 34 states and 62 transitions. [2018-06-25 09:50:41,346 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:50:41,346 INFO ]: Start isEmpty. Operand 34 states and 62 transitions. [2018-06-25 09:50:41,347 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:50:41,347 INFO ]: Found error trace [2018-06-25 09:50:41,347 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:41,347 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:41,347 INFO ]: Analyzing trace with hash 1197648840, now seen corresponding path program 1 times [2018-06-25 09:50:41,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:41,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:41,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:41,348 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:41,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:41,358 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:41,591 INFO ]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:41,592 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:41,592 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-25 09:50:41,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:41,615 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:41,617 INFO ]: Computing forward predicates... [2018-06-25 09:50:41,674 INFO ]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:50:41,693 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:50:41,693 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-06-25 09:50:41,693 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:50:41,693 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:50:41,694 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:50:41,694 INFO ]: Start difference. First operand 34 states and 62 transitions. Second operand 11 states. [2018-06-25 09:50:41,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:41,933 INFO ]: Finished difference Result 34 states and 61 transitions. [2018-06-25 09:50:41,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:50:41,933 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-25 09:50:41,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:41,934 INFO ]: With dead ends: 34 [2018-06-25 09:50:41,934 INFO ]: Without dead ends: 29 [2018-06-25 09:50:41,934 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:50:41,934 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:50:41,935 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-25 09:50:41,935 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:50:41,936 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. [2018-06-25 09:50:41,936 INFO ]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 13 [2018-06-25 09:50:41,936 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:41,936 INFO ]: Abstraction has 29 states and 54 transitions. [2018-06-25 09:50:41,936 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:50:41,936 INFO ]: Start isEmpty. Operand 29 states and 54 transitions. [2018-06-25 09:50:41,936 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:50:41,936 INFO ]: Found error trace [2018-06-25 09:50:41,936 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:41,936 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:41,937 INFO ]: Analyzing trace with hash 1125753420, now seen corresponding path program 2 times [2018-06-25 09:50:41,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:41,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:41,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:41,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:41,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:41,953 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:42,007 INFO ]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:42,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:42,007 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-25 09:50:42,013 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:50:42,034 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:42,034 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:42,035 INFO ]: Computing forward predicates... [2018-06-25 09:50:42,146 INFO ]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:42,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:42,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-25 09:50:42,177 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:50:42,177 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:50:42,177 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:50:42,178 INFO ]: Start difference. First operand 29 states and 54 transitions. Second operand 13 states. [2018-06-25 09:50:42,587 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:42,587 INFO ]: Finished difference Result 64 states and 126 transitions. [2018-06-25 09:50:42,588 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:50:42,588 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-25 09:50:42,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:42,588 INFO ]: With dead ends: 64 [2018-06-25 09:50:42,588 INFO ]: Without dead ends: 56 [2018-06-25 09:50:42,589 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:50:42,589 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-25 09:50:42,591 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-06-25 09:50:42,591 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:50:42,591 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 74 transitions. [2018-06-25 09:50:42,592 INFO ]: Start accepts. Automaton has 39 states and 74 transitions. Word has length 14 [2018-06-25 09:50:42,592 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:42,592 INFO ]: Abstraction has 39 states and 74 transitions. [2018-06-25 09:50:42,592 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:50:42,592 INFO ]: Start isEmpty. Operand 39 states and 74 transitions. [2018-06-25 09:50:42,592 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:50:42,592 INFO ]: Found error trace [2018-06-25 09:50:42,592 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:42,592 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:42,592 INFO ]: Analyzing trace with hash -2057384888, now seen corresponding path program 3 times [2018-06-25 09:50:42,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:42,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:42,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:42,593 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:42,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:42,602 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:42,675 INFO ]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:42,675 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:42,675 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:42,685 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:50:42,705 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-25 09:50:42,705 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:42,706 INFO ]: Computing forward predicates... [2018-06-25 09:50:42,720 INFO ]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:42,739 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:42,739 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 09:50:42,739 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:50:42,739 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:50:42,739 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:50:42,739 INFO ]: Start difference. First operand 39 states and 74 transitions. Second operand 8 states. [2018-06-25 09:50:42,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:42,841 INFO ]: Finished difference Result 49 states and 94 transitions. [2018-06-25 09:50:42,841 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:50:42,841 INFO ]: Start accepts. Automaton has 8 states. Word has length 14 [2018-06-25 09:50:42,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:42,842 INFO ]: With dead ends: 49 [2018-06-25 09:50:42,842 INFO ]: Without dead ends: 48 [2018-06-25 09:50:42,842 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:50:42,842 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 09:50:42,845 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-06-25 09:50:42,845 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 09:50:42,845 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 64 transitions. [2018-06-25 09:50:42,845 INFO ]: Start accepts. Automaton has 35 states and 64 transitions. Word has length 14 [2018-06-25 09:50:42,846 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:42,846 INFO ]: Abstraction has 35 states and 64 transitions. [2018-06-25 09:50:42,846 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:50:42,846 INFO ]: Start isEmpty. Operand 35 states and 64 transitions. [2018-06-25 09:50:42,846 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:50:42,846 INFO ]: Found error trace [2018-06-25 09:50:42,846 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:42,846 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:42,846 INFO ]: Analyzing trace with hash -1120053994, now seen corresponding path program 1 times [2018-06-25 09:50:42,846 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:42,846 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:42,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:42,847 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:42,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:42,859 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:42,921 INFO ]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:42,922 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:42,922 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-25 09:50:42,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:42,955 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:42,957 INFO ]: Computing forward predicates... [2018-06-25 09:50:43,001 INFO ]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:43,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:43,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-06-25 09:50:43,020 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:50:43,020 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:50:43,020 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:50:43,020 INFO ]: Start difference. First operand 35 states and 64 transitions. Second operand 9 states. [2018-06-25 09:50:43,082 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:43,083 INFO ]: Finished difference Result 52 states and 96 transitions. [2018-06-25 09:50:43,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:50:43,083 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-25 09:50:43,083 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:43,083 INFO ]: With dead ends: 52 [2018-06-25 09:50:43,083 INFO ]: Without dead ends: 50 [2018-06-25 09:50:43,083 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:50:43,084 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-25 09:50:43,086 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 33. [2018-06-25 09:50:43,086 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 09:50:43,087 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2018-06-25 09:50:43,087 INFO ]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 14 [2018-06-25 09:50:43,087 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:43,088 INFO ]: Abstraction has 33 states and 59 transitions. [2018-06-25 09:50:43,088 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:50:43,088 INFO ]: Start isEmpty. Operand 33 states and 59 transitions. [2018-06-25 09:50:43,088 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:50:43,088 INFO ]: Found error trace [2018-06-25 09:50:43,088 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:43,088 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:43,088 INFO ]: Analyzing trace with hash 746873424, now seen corresponding path program 1 times [2018-06-25 09:50:43,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:43,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:43,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:43,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:43,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:43,104 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:43,593 INFO ]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:43,593 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:43,593 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-25 09:50:43,599 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:43,618 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:43,619 INFO ]: Computing forward predicates... [2018-06-25 09:50:43,662 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:43,681 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:43,681 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-06-25 09:50:43,682 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:50:43,682 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:50:43,682 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:50:43,682 INFO ]: Start difference. First operand 33 states and 59 transitions. Second operand 14 states. [2018-06-25 09:50:44,803 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:44,803 INFO ]: Finished difference Result 53 states and 113 transitions. [2018-06-25 09:50:44,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:50:44,803 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-25 09:50:44,804 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:44,804 INFO ]: With dead ends: 53 [2018-06-25 09:50:44,804 INFO ]: Without dead ends: 43 [2018-06-25 09:50:44,804 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:50:44,804 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:50:44,807 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-06-25 09:50:44,807 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 09:50:44,808 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 62 transitions. [2018-06-25 09:50:44,808 INFO ]: Start accepts. Automaton has 32 states and 62 transitions. Word has length 14 [2018-06-25 09:50:44,808 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:44,808 INFO ]: Abstraction has 32 states and 62 transitions. [2018-06-25 09:50:44,808 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:50:44,808 INFO ]: Start isEmpty. Operand 32 states and 62 transitions. [2018-06-25 09:50:44,808 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:50:44,808 INFO ]: Found error trace [2018-06-25 09:50:44,808 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:44,808 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:44,809 INFO ]: Analyzing trace with hash 128585270, now seen corresponding path program 3 times [2018-06-25 09:50:44,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:44,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:44,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:44,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:44,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:44,821 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:44,995 INFO ]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:50:44,995 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:44,995 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-25 09:50:45,001 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:50:45,031 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:50:45,031 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:45,035 INFO ]: Computing forward predicates... [2018-06-25 09:50:45,533 WARN ]: Spent 171.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-06-25 09:50:45,748 INFO ]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:45,767 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:45,767 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-06-25 09:50:45,767 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:50:45,767 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:50:45,767 INFO ]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:50:45,767 INFO ]: Start difference. First operand 32 states and 62 transitions. Second operand 16 states. [2018-06-25 09:50:46,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:46,359 INFO ]: Finished difference Result 97 states and 220 transitions. [2018-06-25 09:50:46,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:50:46,359 INFO ]: Start accepts. Automaton has 16 states. Word has length 16 [2018-06-25 09:50:46,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:46,360 INFO ]: With dead ends: 97 [2018-06-25 09:50:46,360 INFO ]: Without dead ends: 79 [2018-06-25 09:50:46,360 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:50:46,360 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-25 09:50:46,363 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 40. [2018-06-25 09:50:46,363 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 09:50:46,364 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 78 transitions. [2018-06-25 09:50:46,364 INFO ]: Start accepts. Automaton has 40 states and 78 transitions. Word has length 16 [2018-06-25 09:50:46,364 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:46,364 INFO ]: Abstraction has 40 states and 78 transitions. [2018-06-25 09:50:46,364 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:50:46,364 INFO ]: Start isEmpty. Operand 40 states and 78 transitions. [2018-06-25 09:50:46,364 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:50:46,364 INFO ]: Found error trace [2018-06-25 09:50:46,364 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:46,364 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:46,364 INFO ]: Analyzing trace with hash -1050495760, now seen corresponding path program 4 times [2018-06-25 09:50:46,365 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:46,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:46,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:46,366 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:46,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:46,379 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:46,486 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:46,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:46,486 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-25 09:50:46,491 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:50:46,517 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:50:46,517 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:46,519 INFO ]: Computing forward predicates... [2018-06-25 09:50:46,653 INFO ]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:46,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:46,676 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-25 09:50:46,676 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:50:46,676 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:50:46,677 INFO ]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:50:46,677 INFO ]: Start difference. First operand 40 states and 78 transitions. Second operand 15 states. [2018-06-25 09:50:47,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:47,108 INFO ]: Finished difference Result 97 states and 205 transitions. [2018-06-25 09:50:47,109 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:50:47,109 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-25 09:50:47,109 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:47,110 INFO ]: With dead ends: 97 [2018-06-25 09:50:47,110 INFO ]: Without dead ends: 87 [2018-06-25 09:50:47,110 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:50:47,110 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-25 09:50:47,113 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 48. [2018-06-25 09:50:47,113 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 09:50:47,113 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 92 transitions. [2018-06-25 09:50:47,113 INFO ]: Start accepts. Automaton has 48 states and 92 transitions. Word has length 16 [2018-06-25 09:50:47,114 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:47,114 INFO ]: Abstraction has 48 states and 92 transitions. [2018-06-25 09:50:47,114 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:50:47,114 INFO ]: Start isEmpty. Operand 48 states and 92 transitions. [2018-06-25 09:50:47,114 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:50:47,114 INFO ]: Found error trace [2018-06-25 09:50:47,114 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:47,114 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:47,114 INFO ]: Analyzing trace with hash 1209765428, now seen corresponding path program 1 times [2018-06-25 09:50:47,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:47,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:47,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:47,116 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:47,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:47,125 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:47,661 INFO ]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:50:47,662 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:47,662 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) [2018-06-25 09:50:47,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:47,712 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:47,714 INFO ]: Computing forward predicates... [2018-06-25 09:50:47,869 INFO ]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:50:47,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:47,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-06-25 09:50:47,898 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:50:47,898 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:50:47,898 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:50:47,899 INFO ]: Start difference. First operand 48 states and 92 transitions. Second operand 10 states. [2018-06-25 09:50:47,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:47,990 INFO ]: Finished difference Result 62 states and 127 transitions. [2018-06-25 09:50:47,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:50:47,990 INFO ]: Start accepts. Automaton has 10 states. Word has length 16 [2018-06-25 09:50:47,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:47,991 INFO ]: With dead ends: 62 [2018-06-25 09:50:47,991 INFO ]: Without dead ends: 59 [2018-06-25 09:50:47,991 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:50:47,991 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-25 09:50:47,993 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-06-25 09:50:47,994 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-25 09:50:47,994 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 105 transitions. [2018-06-25 09:50:47,994 INFO ]: Start accepts. Automaton has 54 states and 105 transitions. Word has length 16 [2018-06-25 09:50:47,994 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:47,994 INFO ]: Abstraction has 54 states and 105 transitions. [2018-06-25 09:50:47,994 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:50:47,994 INFO ]: Start isEmpty. Operand 54 states and 105 transitions. [2018-06-25 09:50:47,995 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:50:47,995 INFO ]: Found error trace [2018-06-25 09:50:47,995 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:47,995 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:47,995 INFO ]: Analyzing trace with hash 1213459512, now seen corresponding path program 1 times [2018-06-25 09:50:47,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:47,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:47,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:47,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:47,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:48,004 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:48,063 INFO ]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:50:48,063 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:48,063 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:48,064 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:48,064 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:48,064 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:48,064 INFO ]: Start difference. First operand 54 states and 105 transitions. Second operand 3 states. [2018-06-25 09:50:48,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:48,135 INFO ]: Finished difference Result 57 states and 102 transitions. [2018-06-25 09:50:48,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:48,136 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-25 09:50:48,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:48,136 INFO ]: With dead ends: 57 [2018-06-25 09:50:48,136 INFO ]: Without dead ends: 55 [2018-06-25 09:50:48,136 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:48,136 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-25 09:50:48,138 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-06-25 09:50:48,138 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-25 09:50:48,138 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 93 transitions. [2018-06-25 09:50:48,138 INFO ]: Start accepts. Automaton has 52 states and 93 transitions. Word has length 16 [2018-06-25 09:50:48,139 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:48,139 INFO ]: Abstraction has 52 states and 93 transitions. [2018-06-25 09:50:48,139 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:48,139 INFO ]: Start isEmpty. Operand 52 states and 93 transitions. [2018-06-25 09:50:48,139 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:50:48,139 INFO ]: Found error trace [2018-06-25 09:50:48,139 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:48,139 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:48,139 INFO ]: Analyzing trace with hash 1324282032, now seen corresponding path program 2 times [2018-06-25 09:50:48,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:48,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:48,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:48,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:48,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:48,150 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:48,230 INFO ]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:50:48,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:48,230 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-25 09:50:48,237 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:50:48,259 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:48,259 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:48,261 INFO ]: Computing forward predicates... [2018-06-25 09:50:48,317 INFO ]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 09:50:48,349 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:48,349 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-25 09:50:48,349 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:50:48,350 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:50:48,350 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:50:48,350 INFO ]: Start difference. First operand 52 states and 93 transitions. Second operand 13 states. [2018-06-25 09:50:48,611 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:48,611 INFO ]: Finished difference Result 56 states and 100 transitions. [2018-06-25 09:50:48,611 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:50:48,611 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-25 09:50:48,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:48,611 INFO ]: With dead ends: 56 [2018-06-25 09:50:48,611 INFO ]: Without dead ends: 48 [2018-06-25 09:50:48,611 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:50:48,611 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 09:50:48,612 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-06-25 09:50:48,612 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 09:50:48,613 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 80 transitions. [2018-06-25 09:50:48,613 INFO ]: Start accepts. Automaton has 44 states and 80 transitions. Word has length 16 [2018-06-25 09:50:48,613 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:48,613 INFO ]: Abstraction has 44 states and 80 transitions. [2018-06-25 09:50:48,613 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:50:48,613 INFO ]: Start isEmpty. Operand 44 states and 80 transitions. [2018-06-25 09:50:48,614 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:50:48,614 INFO ]: Found error trace [2018-06-25 09:50:48,614 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:48,614 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:48,614 INFO ]: Analyzing trace with hash 1569071028, now seen corresponding path program 4 times [2018-06-25 09:50:48,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:48,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:48,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:48,615 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:48,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:48,624 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:49,034 INFO ]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:49,034 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:49,034 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-25 09:50:49,041 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:50:49,067 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:50:49,067 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:49,068 INFO ]: Computing forward predicates... [2018-06-25 09:50:49,137 INFO ]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:49,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:49,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-25 09:50:49,165 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:50:49,166 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:50:49,166 INFO ]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:50:49,166 INFO ]: Start difference. First operand 44 states and 80 transitions. Second operand 17 states. [2018-06-25 09:50:49,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:49,619 INFO ]: Finished difference Result 118 states and 221 transitions. [2018-06-25 09:50:49,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:50:49,621 INFO ]: Start accepts. Automaton has 17 states. Word has length 17 [2018-06-25 09:50:49,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:49,622 INFO ]: With dead ends: 118 [2018-06-25 09:50:49,622 INFO ]: Without dead ends: 103 [2018-06-25 09:50:49,622 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=758, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:50:49,622 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-25 09:50:49,625 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 62. [2018-06-25 09:50:49,625 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-25 09:50:49,625 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 110 transitions. [2018-06-25 09:50:49,625 INFO ]: Start accepts. Automaton has 62 states and 110 transitions. Word has length 17 [2018-06-25 09:50:49,625 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:49,625 INFO ]: Abstraction has 62 states and 110 transitions. [2018-06-25 09:50:49,625 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:50:49,625 INFO ]: Start isEmpty. Operand 62 states and 110 transitions. [2018-06-25 09:50:49,626 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:50:49,626 INFO ]: Found error trace [2018-06-25 09:50:49,626 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:49,626 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:49,626 INFO ]: Analyzing trace with hash -253281678, now seen corresponding path program 2 times [2018-06-25 09:50:49,626 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:49,626 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:49,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:49,627 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:49,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:49,641 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:49,784 INFO ]: Checked inductivity of 15 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:49,784 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:49,784 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-25 09:50:49,790 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:50:49,815 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:49,815 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:49,817 INFO ]: Computing forward predicates... [2018-06-25 09:50:49,851 INFO ]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:49,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:49,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-25 09:50:49,871 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:50:49,871 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:50:49,871 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:50:49,871 INFO ]: Start difference. First operand 62 states and 110 transitions. Second operand 10 states. [2018-06-25 09:50:49,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:49,959 INFO ]: Finished difference Result 87 states and 157 transitions. [2018-06-25 09:50:49,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:50:49,960 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-25 09:50:49,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:49,960 INFO ]: With dead ends: 87 [2018-06-25 09:50:49,960 INFO ]: Without dead ends: 85 [2018-06-25 09:50:49,961 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:50:49,961 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-25 09:50:49,963 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 55. [2018-06-25 09:50:49,963 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-25 09:50:49,963 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 96 transitions. [2018-06-25 09:50:49,963 INFO ]: Start accepts. Automaton has 55 states and 96 transitions. Word has length 17 [2018-06-25 09:50:49,963 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:49,963 INFO ]: Abstraction has 55 states and 96 transitions. [2018-06-25 09:50:49,963 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:50:49,964 INFO ]: Start isEmpty. Operand 55 states and 96 transitions. [2018-06-25 09:50:49,964 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:50:49,964 INFO ]: Found error trace [2018-06-25 09:50:49,964 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:49,964 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:49,964 INFO ]: Analyzing trace with hash 2019451118, now seen corresponding path program 2 times [2018-06-25 09:50:49,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:49,964 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:49,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:49,965 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:49,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:49,974 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:50,034 INFO ]: Checked inductivity of 15 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:50,034 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:50,034 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-25 09:50:50,041 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:50:50,066 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:50,066 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:50,068 INFO ]: Computing forward predicates... [2018-06-25 09:50:50,135 INFO ]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:50:50,154 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:50,154 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-06-25 09:50:50,154 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:50:50,154 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:50:50,154 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:50:50,154 INFO ]: Start difference. First operand 55 states and 96 transitions. Second operand 11 states. [2018-06-25 09:50:50,237 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:50,237 INFO ]: Finished difference Result 77 states and 128 transitions. [2018-06-25 09:50:50,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:50:50,238 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-25 09:50:50,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:50,239 INFO ]: With dead ends: 77 [2018-06-25 09:50:50,239 INFO ]: Without dead ends: 74 [2018-06-25 09:50:50,239 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:50:50,239 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-25 09:50:50,241 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 48. [2018-06-25 09:50:50,241 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 09:50:50,241 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2018-06-25 09:50:50,241 INFO ]: Start accepts. Automaton has 48 states and 85 transitions. Word has length 17 [2018-06-25 09:50:50,241 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:50,241 INFO ]: Abstraction has 48 states and 85 transitions. [2018-06-25 09:50:50,241 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:50:50,241 INFO ]: Start isEmpty. Operand 48 states and 85 transitions. [2018-06-25 09:50:50,241 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:50:50,241 INFO ]: Found error trace [2018-06-25 09:50:50,241 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:50,242 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:50,242 INFO ]: Analyzing trace with hash 272398356, now seen corresponding path program 2 times [2018-06-25 09:50:50,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:50,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:50,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:50,242 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:50,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:50,251 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:50,339 INFO ]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:50,339 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:50,339 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-25 09:50:50,345 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:50:50,372 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:50,372 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:50,374 INFO ]: Computing forward predicates... [2018-06-25 09:50:50,567 INFO ]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:50:50,587 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:50,587 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2018-06-25 09:50:50,587 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:50:50,587 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:50:50,587 INFO ]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:50:50,587 INFO ]: Start difference. First operand 48 states and 85 transitions. Second operand 16 states. [2018-06-25 09:50:50,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:50,829 INFO ]: Finished difference Result 67 states and 125 transitions. [2018-06-25 09:50:50,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:50:50,829 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-25 09:50:50,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:50,829 INFO ]: With dead ends: 67 [2018-06-25 09:50:50,829 INFO ]: Without dead ends: 50 [2018-06-25 09:50:50,829 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:50:50,829 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-25 09:50:50,831 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-06-25 09:50:50,831 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:50:50,831 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2018-06-25 09:50:50,831 INFO ]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 18 [2018-06-25 09:50:50,831 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:50,831 INFO ]: Abstraction has 42 states and 77 transitions. [2018-06-25 09:50:50,831 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:50:50,831 INFO ]: Start isEmpty. Operand 42 states and 77 transitions. [2018-06-25 09:50:50,832 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:50:50,832 INFO ]: Found error trace [2018-06-25 09:50:50,832 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:50,832 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:50,832 INFO ]: Analyzing trace with hash -664262706, now seen corresponding path program 5 times [2018-06-25 09:50:50,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:50,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:50,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:50,832 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:50,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:50,848 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:51,251 INFO ]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:50:51,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:51,251 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-25 09:50:51,258 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:50:51,290 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:50:51,291 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:51,294 INFO ]: Computing forward predicates... [2018-06-25 09:50:51,423 INFO ]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:50:51,445 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:51,445 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2018-06-25 09:50:51,445 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:50:51,445 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:50:51,445 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:50:51,445 INFO ]: Start difference. First operand 42 states and 77 transitions. Second operand 17 states. [2018-06-25 09:50:52,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:52,116 INFO ]: Finished difference Result 80 states and 154 transitions. [2018-06-25 09:50:52,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:50:52,116 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-25 09:50:52,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:52,117 INFO ]: With dead ends: 80 [2018-06-25 09:50:52,117 INFO ]: Without dead ends: 69 [2018-06-25 09:50:52,117 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:50:52,117 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-25 09:50:52,119 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 47. [2018-06-25 09:50:52,119 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-25 09:50:52,119 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. [2018-06-25 09:50:52,119 INFO ]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 19 [2018-06-25 09:50:52,119 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:52,119 INFO ]: Abstraction has 47 states and 86 transitions. [2018-06-25 09:50:52,119 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:50:52,119 INFO ]: Start isEmpty. Operand 47 states and 86 transitions. [2018-06-25 09:50:52,119 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:50:52,119 INFO ]: Found error trace [2018-06-25 09:50:52,119 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:52,120 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:52,120 INFO ]: Analyzing trace with hash 110233608, now seen corresponding path program 5 times [2018-06-25 09:50:52,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:52,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:52,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:52,120 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:52,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:52,131 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:52,358 INFO ]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:50:52,358 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:52,358 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-25 09:50:52,364 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:50:52,436 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:50:52,436 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:52,438 INFO ]: Computing forward predicates... [2018-06-25 09:50:52,758 INFO ]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:50:52,777 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:52,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-25 09:50:52,777 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:50:52,777 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:50:52,777 INFO ]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:50:52,777 INFO ]: Start difference. First operand 47 states and 86 transitions. Second operand 13 states. [2018-06-25 09:50:52,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:52,915 INFO ]: Finished difference Result 96 states and 173 transitions. [2018-06-25 09:50:52,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:50:52,916 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-25 09:50:52,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:52,916 INFO ]: With dead ends: 96 [2018-06-25 09:50:52,916 INFO ]: Without dead ends: 82 [2018-06-25 09:50:52,916 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:50:52,917 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-25 09:50:52,918 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 55. [2018-06-25 09:50:52,918 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-25 09:50:52,919 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 97 transitions. [2018-06-25 09:50:52,919 INFO ]: Start accepts. Automaton has 55 states and 97 transitions. Word has length 19 [2018-06-25 09:50:52,919 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:52,919 INFO ]: Abstraction has 55 states and 97 transitions. [2018-06-25 09:50:52,919 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:50:52,919 INFO ]: Start isEmpty. Operand 55 states and 97 transitions. [2018-06-25 09:50:52,919 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:50:52,919 INFO ]: Found error trace [2018-06-25 09:50:52,919 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:52,919 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:52,919 INFO ]: Analyzing trace with hash -514625852, now seen corresponding path program 3 times [2018-06-25 09:50:52,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:52,920 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:52,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:52,922 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:52,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:52,931 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:53,069 INFO ]: Checked inductivity of 22 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:50:53,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:53,070 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-25 09:50:53,076 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:50:53,106 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:50:53,106 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:53,108 INFO ]: Computing forward predicates... [2018-06-25 09:50:53,176 INFO ]: Checked inductivity of 22 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:50:53,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:53,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-25 09:50:53,195 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:50:53,195 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:50:53,195 INFO ]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:50:53,195 INFO ]: Start difference. First operand 55 states and 97 transitions. Second operand 15 states. [2018-06-25 09:50:53,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:53,514 INFO ]: Finished difference Result 77 states and 135 transitions. [2018-06-25 09:50:53,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:50:53,515 INFO ]: Start accepts. Automaton has 15 states. Word has length 19 [2018-06-25 09:50:53,515 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:53,515 INFO ]: With dead ends: 77 [2018-06-25 09:50:53,515 INFO ]: Without dead ends: 56 [2018-06-25 09:50:53,516 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:50:53,516 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-25 09:50:53,517 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 46. [2018-06-25 09:50:53,517 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-25 09:50:53,518 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 78 transitions. [2018-06-25 09:50:53,518 INFO ]: Start accepts. Automaton has 46 states and 78 transitions. Word has length 19 [2018-06-25 09:50:53,518 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:53,518 INFO ]: Abstraction has 46 states and 78 transitions. [2018-06-25 09:50:53,518 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:50:53,518 INFO ]: Start isEmpty. Operand 46 states and 78 transitions. [2018-06-25 09:50:53,518 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:50:53,518 INFO ]: Found error trace [2018-06-25 09:50:53,518 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:53,518 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:53,518 INFO ]: Analyzing trace with hash 574709324, now seen corresponding path program 6 times [2018-06-25 09:50:53,518 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:53,518 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:53,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:53,520 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:53,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:53,530 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:53,680 INFO ]: Checked inductivity of 27 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:50:53,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:53,681 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:53,686 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:50:53,720 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:50:53,720 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:53,722 INFO ]: Computing forward predicates... [2018-06-25 09:50:53,819 INFO ]: Checked inductivity of 27 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:50:53,838 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:53,838 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-06-25 09:50:53,838 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:50:53,838 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:50:53,838 INFO ]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:50:53,838 INFO ]: Start difference. First operand 46 states and 78 transitions. Second operand 21 states. [2018-06-25 09:50:54,337 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:54,337 INFO ]: Finished difference Result 132 states and 226 transitions. [2018-06-25 09:50:54,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 09:50:54,337 INFO ]: Start accepts. Automaton has 21 states. Word has length 20 [2018-06-25 09:50:54,337 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:54,338 INFO ]: With dead ends: 132 [2018-06-25 09:50:54,338 INFO ]: Without dead ends: 110 [2018-06-25 09:50:54,338 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=1198, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:50:54,338 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-25 09:50:54,340 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 60. [2018-06-25 09:50:54,340 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-25 09:50:54,341 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 101 transitions. [2018-06-25 09:50:54,341 INFO ]: Start accepts. Automaton has 60 states and 101 transitions. Word has length 20 [2018-06-25 09:50:54,341 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:54,341 INFO ]: Abstraction has 60 states and 101 transitions. [2018-06-25 09:50:54,343 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:50:54,343 INFO ]: Start isEmpty. Operand 60 states and 101 transitions. [2018-06-25 09:50:54,343 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:50:54,343 INFO ]: Found error trace [2018-06-25 09:50:54,343 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:54,343 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:54,343 INFO ]: Analyzing trace with hash 162081352, now seen corresponding path program 6 times [2018-06-25 09:50:54,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:54,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:54,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:54,344 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:54,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:54,351 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:54,540 INFO ]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:50:54,540 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:54,540 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-25 09:50:54,546 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:50:54,580 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 09:50:54,580 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:54,582 INFO ]: Computing forward predicates... [2018-06-25 09:50:54,718 INFO ]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:50:54,737 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:54,737 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-06-25 09:50:54,737 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:50:54,737 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:50:54,737 INFO ]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:50:54,737 INFO ]: Start difference. First operand 60 states and 101 transitions. Second operand 19 states. [2018-06-25 09:50:56,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:56,125 INFO ]: Finished difference Result 183 states and 322 transitions. [2018-06-25 09:50:56,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-25 09:50:56,126 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-25 09:50:56,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:56,127 INFO ]: With dead ends: 183 [2018-06-25 09:50:56,127 INFO ]: Without dead ends: 180 [2018-06-25 09:50:56,128 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1904 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1337, Invalid=5143, Unknown=0, NotChecked=0, Total=6480 [2018-06-25 09:50:56,128 INFO ]: Start minimizeSevpa. Operand 180 states. [2018-06-25 09:50:56,131 INFO ]: Finished minimizeSevpa. Reduced states from 180 to 69. [2018-06-25 09:50:56,131 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-25 09:50:56,131 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 118 transitions. [2018-06-25 09:50:56,131 INFO ]: Start accepts. Automaton has 69 states and 118 transitions. Word has length 20 [2018-06-25 09:50:56,131 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:56,131 INFO ]: Abstraction has 69 states and 118 transitions. [2018-06-25 09:50:56,131 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:50:56,132 INFO ]: Start isEmpty. Operand 69 states and 118 transitions. [2018-06-25 09:50:56,132 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:50:56,132 INFO ]: Found error trace [2018-06-25 09:50:56,132 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:56,132 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:56,132 INFO ]: Analyzing trace with hash 1624128022, now seen corresponding path program 3 times [2018-06-25 09:50:56,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:56,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:56,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,133 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:56,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,142 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:56,257 INFO ]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:50:56,258 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:56,258 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-25 09:50:56,263 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:50:56,336 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:50:56,336 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:56,338 INFO ]: Computing forward predicates... [2018-06-25 09:50:56,404 INFO ]: Checked inductivity of 26 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:50:56,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:56,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2018-06-25 09:50:56,424 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:50:56,424 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:50:56,424 INFO ]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:50:56,424 INFO ]: Start difference. First operand 69 states and 118 transitions. Second operand 15 states. [2018-06-25 09:50:56,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:56,608 INFO ]: Finished difference Result 115 states and 189 transitions. [2018-06-25 09:50:56,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:50:56,608 INFO ]: Start accepts. Automaton has 15 states. Word has length 20 [2018-06-25 09:50:56,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:56,608 INFO ]: With dead ends: 115 [2018-06-25 09:50:56,608 INFO ]: Without dead ends: 111 [2018-06-25 09:50:56,608 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:50:56,609 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-25 09:50:56,610 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 60. [2018-06-25 09:50:56,610 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-25 09:50:56,610 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 105 transitions. [2018-06-25 09:50:56,610 INFO ]: Start accepts. Automaton has 60 states and 105 transitions. Word has length 20 [2018-06-25 09:50:56,610 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:56,610 INFO ]: Abstraction has 60 states and 105 transitions. [2018-06-25 09:50:56,610 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:50:56,610 INFO ]: Start isEmpty. Operand 60 states and 105 transitions. [2018-06-25 09:50:56,610 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:50:56,610 INFO ]: Found error trace [2018-06-25 09:50:56,610 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:56,611 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:56,611 INFO ]: Analyzing trace with hash 1333639788, now seen corresponding path program 3 times [2018-06-25 09:50:56,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:56,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:56,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,611 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:56,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:56,622 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:56,743 INFO ]: Checked inductivity of 30 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:50:56,743 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:56,743 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-25 09:50:56,749 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:50:56,797 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:50:56,797 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:56,800 INFO ]: Computing forward predicates... [2018-06-25 09:50:56,875 INFO ]: Checked inductivity of 30 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-25 09:50:56,895 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:56,895 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2018-06-25 09:50:56,895 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:50:56,895 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:50:56,895 INFO ]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:50:56,895 INFO ]: Start difference. First operand 60 states and 105 transitions. Second operand 19 states. [2018-06-25 09:50:57,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:57,233 INFO ]: Finished difference Result 91 states and 166 transitions. [2018-06-25 09:50:57,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 09:50:57,234 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-25 09:50:57,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:57,234 INFO ]: With dead ends: 91 [2018-06-25 09:50:57,234 INFO ]: Without dead ends: 67 [2018-06-25 09:50:57,234 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:50:57,235 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-25 09:50:57,236 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 52. [2018-06-25 09:50:57,236 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-25 09:50:57,236 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 95 transitions. [2018-06-25 09:50:57,236 INFO ]: Start accepts. Automaton has 52 states and 95 transitions. Word has length 21 [2018-06-25 09:50:57,236 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:57,236 INFO ]: Abstraction has 52 states and 95 transitions. [2018-06-25 09:50:57,236 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:50:57,236 INFO ]: Start isEmpty. Operand 52 states and 95 transitions. [2018-06-25 09:50:57,237 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:50:57,237 INFO ]: Found error trace [2018-06-25 09:50:57,237 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:57,237 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:57,237 INFO ]: Analyzing trace with hash 1447472950, now seen corresponding path program 7 times [2018-06-25 09:50:57,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:57,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:57,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:57,238 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:57,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:57,264 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:57,433 INFO ]: Checked inductivity of 35 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:50:57,433 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:57,433 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-25 09:50:57,439 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:57,477 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:57,482 INFO ]: Computing forward predicates... [2018-06-25 09:50:57,787 INFO ]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:50:57,806 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:57,806 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 21 [2018-06-25 09:50:57,806 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:50:57,806 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:50:57,807 INFO ]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:50:57,807 INFO ]: Start difference. First operand 52 states and 95 transitions. Second operand 21 states. [2018-06-25 09:50:58,374 WARN ]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-06-25 09:50:59,648 WARN ]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-06-25 09:50:59,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:59,742 INFO ]: Finished difference Result 158 states and 309 transitions. [2018-06-25 09:50:59,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 09:50:59,742 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-25 09:50:59,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:59,742 INFO ]: With dead ends: 158 [2018-06-25 09:50:59,742 INFO ]: Without dead ends: 126 [2018-06-25 09:50:59,743 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=317, Invalid=1243, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:50:59,743 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-25 09:50:59,746 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 65. [2018-06-25 09:50:59,746 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-25 09:50:59,746 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 116 transitions. [2018-06-25 09:50:59,746 INFO ]: Start accepts. Automaton has 65 states and 116 transitions. Word has length 22 [2018-06-25 09:50:59,746 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:59,746 INFO ]: Abstraction has 65 states and 116 transitions. [2018-06-25 09:50:59,746 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:50:59,746 INFO ]: Start isEmpty. Operand 65 states and 116 transitions. [2018-06-25 09:50:59,746 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:50:59,746 INFO ]: Found error trace [2018-06-25 09:50:59,747 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:59,747 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:59,749 INFO ]: Analyzing trace with hash -1585878800, now seen corresponding path program 7 times [2018-06-25 09:50:59,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:59,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:59,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:59,749 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:59,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:59,759 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:00,478 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:00,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:00,478 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-25 09:51:00,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:00,517 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:00,519 INFO ]: Computing forward predicates... [2018-06-25 09:51:00,616 INFO ]: Checked inductivity of 35 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:00,636 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:00,636 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-06-25 09:51:00,636 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:51:00,636 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:51:00,637 INFO ]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:51:00,637 INFO ]: Start difference. First operand 65 states and 116 transitions. Second operand 23 states. [2018-06-25 09:51:01,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:01,354 INFO ]: Finished difference Result 205 states and 367 transitions. [2018-06-25 09:51:01,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-25 09:51:01,354 INFO ]: Start accepts. Automaton has 23 states. Word has length 22 [2018-06-25 09:51:01,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:01,355 INFO ]: With dead ends: 205 [2018-06-25 09:51:01,355 INFO ]: Without dead ends: 181 [2018-06-25 09:51:01,356 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=590, Invalid=2166, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 09:51:01,356 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-25 09:51:01,360 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 80. [2018-06-25 09:51:01,360 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-25 09:51:01,360 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 145 transitions. [2018-06-25 09:51:01,360 INFO ]: Start accepts. Automaton has 80 states and 145 transitions. Word has length 22 [2018-06-25 09:51:01,360 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:01,360 INFO ]: Abstraction has 80 states and 145 transitions. [2018-06-25 09:51:01,360 INFO ]: Interpolant automaton has 23 states. [2018-06-25 09:51:01,360 INFO ]: Start isEmpty. Operand 80 states and 145 transitions. [2018-06-25 09:51:01,361 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:51:01,361 INFO ]: Found error trace [2018-06-25 09:51:01,361 INFO ]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:01,361 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:01,361 INFO ]: Analyzing trace with hash -169996492, now seen corresponding path program 4 times [2018-06-25 09:51:01,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:01,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:01,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:01,361 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:01,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:01,370 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:01,599 INFO ]: Checked inductivity of 35 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 09:51:01,600 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:01,600 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-25 09:51:01,605 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:51:01,640 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:51:01,640 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:01,642 INFO ]: Computing forward predicates... [2018-06-25 09:51:01,720 INFO ]: Checked inductivity of 35 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:01,751 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:01,751 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2018-06-25 09:51:01,752 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:51:01,752 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:51:01,752 INFO ]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:51:01,752 INFO ]: Start difference. First operand 80 states and 145 transitions. Second operand 16 states. [2018-06-25 09:51:02,379 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:02,379 INFO ]: Finished difference Result 117 states and 209 transitions. [2018-06-25 09:51:02,379 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:51:02,379 INFO ]: Start accepts. Automaton has 16 states. Word has length 22 [2018-06-25 09:51:02,379 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:02,380 INFO ]: With dead ends: 117 [2018-06-25 09:51:02,380 INFO ]: Without dead ends: 103 [2018-06-25 09:51:02,380 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:51:02,380 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-25 09:51:02,382 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 86. [2018-06-25 09:51:02,382 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-25 09:51:02,383 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 151 transitions. [2018-06-25 09:51:02,383 INFO ]: Start accepts. Automaton has 86 states and 151 transitions. Word has length 22 [2018-06-25 09:51:02,383 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:02,383 INFO ]: Abstraction has 86 states and 151 transitions. [2018-06-25 09:51:02,383 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:51:02,383 INFO ]: Start isEmpty. Operand 86 states and 151 transitions. [2018-06-25 09:51:02,383 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:51:02,383 INFO ]: Found error trace [2018-06-25 09:51:02,383 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:02,383 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:02,383 INFO ]: Analyzing trace with hash -1788689744, now seen corresponding path program 3 times [2018-06-25 09:51:02,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:02,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:02,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:02,384 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:02,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:02,395 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:02,957 INFO ]: Checked inductivity of 35 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:51:02,957 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:02,957 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) [2018-06-25 09:51:02,972 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:51:03,047 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:51:03,047 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:03,049 INFO ]: Computing forward predicates... [2018-06-25 09:51:03,171 INFO ]: Checked inductivity of 35 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:51:03,190 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:03,190 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-06-25 09:51:03,190 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:51:03,190 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:51:03,190 INFO ]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:51:03,190 INFO ]: Start difference. First operand 86 states and 151 transitions. Second operand 17 states. [2018-06-25 09:51:03,650 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:03,651 INFO ]: Finished difference Result 107 states and 163 transitions. [2018-06-25 09:51:03,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:51:03,652 INFO ]: Start accepts. Automaton has 17 states. Word has length 22 [2018-06-25 09:51:03,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:03,652 INFO ]: With dead ends: 107 [2018-06-25 09:51:03,652 INFO ]: Without dead ends: 90 [2018-06-25 09:51:03,653 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=777, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:51:03,653 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-25 09:51:03,655 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 63. [2018-06-25 09:51:03,655 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-25 09:51:03,655 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2018-06-25 09:51:03,655 INFO ]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 22 [2018-06-25 09:51:03,655 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:03,655 INFO ]: Abstraction has 63 states and 96 transitions. [2018-06-25 09:51:03,655 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:51:03,656 INFO ]: Start isEmpty. Operand 63 states and 96 transitions. [2018-06-25 09:51:03,656 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:51:03,656 INFO ]: Found error trace [2018-06-25 09:51:03,656 INFO ]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:03,656 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:03,656 INFO ]: Analyzing trace with hash -1779473996, now seen corresponding path program 8 times [2018-06-25 09:51:03,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:03,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:03,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:03,657 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:03,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:03,668 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:04,343 INFO ]: Checked inductivity of 41 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:04,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:04,343 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-25 09:51:04,348 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:04,384 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:04,384 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:04,386 INFO ]: Computing forward predicates... [2018-06-25 09:51:04,543 INFO ]: Checked inductivity of 41 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:04,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:04,567 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-25 09:51:04,567 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:51:04,567 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:51:04,567 INFO ]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:51:04,567 INFO ]: Start difference. First operand 63 states and 96 transitions. Second operand 25 states. [2018-06-25 09:51:05,322 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 09:51:05,857 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:05,857 INFO ]: Finished difference Result 241 states and 360 transitions. [2018-06-25 09:51:05,857 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 09:51:05,857 INFO ]: Start accepts. Automaton has 25 states. Word has length 23 [2018-06-25 09:51:05,857 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:05,858 INFO ]: With dead ends: 241 [2018-06-25 09:51:05,858 INFO ]: Without dead ends: 208 [2018-06-25 09:51:05,858 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=1737, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 09:51:05,858 INFO ]: Start minimizeSevpa. Operand 208 states. [2018-06-25 09:51:05,861 INFO ]: Finished minimizeSevpa. Reduced states from 208 to 89. [2018-06-25 09:51:05,861 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-25 09:51:05,862 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 134 transitions. [2018-06-25 09:51:05,862 INFO ]: Start accepts. Automaton has 89 states and 134 transitions. Word has length 23 [2018-06-25 09:51:05,862 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:05,862 INFO ]: Abstraction has 89 states and 134 transitions. [2018-06-25 09:51:05,862 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:51:05,862 INFO ]: Start isEmpty. Operand 89 states and 134 transitions. [2018-06-25 09:51:05,862 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:51:05,862 INFO ]: Found error trace [2018-06-25 09:51:05,862 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:05,863 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:05,863 INFO ]: Analyzing trace with hash -1779909006, now seen corresponding path program 5 times [2018-06-25 09:51:05,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:05,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:05,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:05,863 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:05,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:05,873 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:06,014 INFO ]: Checked inductivity of 40 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:06,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:06,014 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-25 09:51:06,020 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:51:06,058 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:51:06,058 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:06,060 INFO ]: Computing forward predicates... [2018-06-25 09:51:06,184 INFO ]: Checked inductivity of 40 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:06,203 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:06,203 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 20 [2018-06-25 09:51:06,203 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:51:06,204 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:51:06,204 INFO ]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:51:06,204 INFO ]: Start difference. First operand 89 states and 134 transitions. Second operand 20 states. [2018-06-25 09:51:06,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:06,713 INFO ]: Finished difference Result 159 states and 230 transitions. [2018-06-25 09:51:06,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:51:06,713 INFO ]: Start accepts. Automaton has 20 states. Word has length 23 [2018-06-25 09:51:06,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:06,713 INFO ]: With dead ends: 159 [2018-06-25 09:51:06,713 INFO ]: Without dead ends: 155 [2018-06-25 09:51:06,714 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:51:06,714 INFO ]: Start minimizeSevpa. Operand 155 states. [2018-06-25 09:51:06,716 INFO ]: Finished minimizeSevpa. Reduced states from 155 to 78. [2018-06-25 09:51:06,716 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-25 09:51:06,717 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2018-06-25 09:51:06,717 INFO ]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 23 [2018-06-25 09:51:06,717 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:06,717 INFO ]: Abstraction has 78 states and 116 transitions. [2018-06-25 09:51:06,717 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:51:06,717 INFO ]: Start isEmpty. Operand 78 states and 116 transitions. [2018-06-25 09:51:06,717 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:51:06,717 INFO ]: Found error trace [2018-06-25 09:51:06,717 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:06,717 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:06,717 INFO ]: Analyzing trace with hash 879761390, now seen corresponding path program 4 times [2018-06-25 09:51:06,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:06,717 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:06,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:06,719 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:06,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:06,729 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:06,984 INFO ]: Checked inductivity of 40 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:06,984 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:06,984 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-25 09:51:06,989 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:51:07,024 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:51:07,024 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:07,026 INFO ]: Computing forward predicates... [2018-06-25 09:51:07,046 INFO ]: Checked inductivity of 40 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 09:51:07,065 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:07,065 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 15 [2018-06-25 09:51:07,065 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:51:07,065 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:51:07,065 INFO ]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:51:07,065 INFO ]: Start difference. First operand 78 states and 116 transitions. Second operand 15 states. [2018-06-25 09:51:07,209 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:07,209 INFO ]: Finished difference Result 127 states and 180 transitions. [2018-06-25 09:51:07,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:51:07,210 INFO ]: Start accepts. Automaton has 15 states. Word has length 23 [2018-06-25 09:51:07,210 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:07,210 INFO ]: With dead ends: 127 [2018-06-25 09:51:07,210 INFO ]: Without dead ends: 122 [2018-06-25 09:51:07,211 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=400, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:51:07,211 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-25 09:51:07,214 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 66. [2018-06-25 09:51:07,214 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-25 09:51:07,215 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2018-06-25 09:51:07,215 INFO ]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 23 [2018-06-25 09:51:07,215 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:07,215 INFO ]: Abstraction has 66 states and 98 transitions. [2018-06-25 09:51:07,215 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:51:07,215 INFO ]: Start isEmpty. Operand 66 states and 98 transitions. [2018-06-25 09:51:07,215 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:51:07,215 INFO ]: Found error trace [2018-06-25 09:51:07,215 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:07,215 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:07,215 INFO ]: Analyzing trace with hash 1948904980, now seen corresponding path program 4 times [2018-06-25 09:51:07,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:07,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:07,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:07,216 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:07,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:07,226 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:07,400 INFO ]: Checked inductivity of 45 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:51:07,401 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:07,401 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-25 09:51:07,406 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:51:07,443 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:51:07,443 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:07,445 INFO ]: Computing forward predicates... [2018-06-25 09:51:07,549 INFO ]: Checked inductivity of 45 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 09:51:07,568 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:07,568 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2018-06-25 09:51:07,568 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:51:07,568 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:51:07,568 INFO ]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:51:07,568 INFO ]: Start difference. First operand 66 states and 98 transitions. Second operand 21 states. [2018-06-25 09:51:07,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:07,736 INFO ]: Finished difference Result 100 states and 150 transitions. [2018-06-25 09:51:07,736 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:51:07,736 INFO ]: Start accepts. Automaton has 21 states. Word has length 24 [2018-06-25 09:51:07,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:07,736 INFO ]: With dead ends: 100 [2018-06-25 09:51:07,736 INFO ]: Without dead ends: 84 [2018-06-25 09:51:07,737 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:51:07,737 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-25 09:51:07,738 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 72. [2018-06-25 09:51:07,738 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-25 09:51:07,738 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2018-06-25 09:51:07,738 INFO ]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 24 [2018-06-25 09:51:07,738 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:07,738 INFO ]: Abstraction has 72 states and 108 transitions. [2018-06-25 09:51:07,738 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:51:07,738 INFO ]: Start isEmpty. Operand 72 states and 108 transitions. [2018-06-25 09:51:07,739 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:51:07,739 INFO ]: Found error trace [2018-06-25 09:51:07,739 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:07,739 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:07,739 INFO ]: Analyzing trace with hash 1956293148, now seen corresponding path program 1 times [2018-06-25 09:51:07,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:07,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:07,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:07,739 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:07,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:07,748 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:07,828 INFO ]: Checked inductivity of 45 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-25 09:51:07,828 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:51:07,828 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:51:07,828 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:51:07,829 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:51:07,829 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:51:07,829 INFO ]: Start difference. First operand 72 states and 108 transitions. Second operand 3 states. [2018-06-25 09:51:07,835 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:07,835 INFO ]: Finished difference Result 81 states and 125 transitions. [2018-06-25 09:51:07,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:51:07,837 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-25 09:51:07,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:07,837 INFO ]: With dead ends: 81 [2018-06-25 09:51:07,837 INFO ]: Without dead ends: 79 [2018-06-25 09:51:07,838 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:51:07,838 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-25 09:51:07,839 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-06-25 09:51:07,839 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-25 09:51:07,840 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2018-06-25 09:51:07,840 INFO ]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 24 [2018-06-25 09:51:07,840 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:07,840 INFO ]: Abstraction has 70 states and 103 transitions. [2018-06-25 09:51:07,840 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:51:07,840 INFO ]: Start isEmpty. Operand 70 states and 103 transitions. [2018-06-25 09:51:07,840 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:51:07,840 INFO ]: Found error trace [2018-06-25 09:51:07,840 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:07,840 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:07,840 INFO ]: Analyzing trace with hash -2117029108, now seen corresponding path program 2 times [2018-06-25 09:51:07,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:07,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:07,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:07,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:07,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:07,857 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:08,312 INFO ]: Checked inductivity of 45 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:51:08,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:08,313 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-25 09:51:08,318 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:08,355 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:08,355 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:08,357 INFO ]: Computing forward predicates... [2018-06-25 09:51:08,415 INFO ]: Checked inductivity of 45 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-25 09:51:08,434 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:51:08,434 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2018-06-25 09:51:08,435 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:51:08,435 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:51:08,435 INFO ]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:51:08,435 INFO ]: Start difference. First operand 70 states and 103 transitions. Second operand 17 states. [2018-06-25 09:51:09,071 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:09,071 INFO ]: Finished difference Result 96 states and 129 transitions. [2018-06-25 09:51:09,071 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:51:09,072 INFO ]: Start accepts. Automaton has 17 states. Word has length 24 [2018-06-25 09:51:09,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:09,072 INFO ]: With dead ends: 96 [2018-06-25 09:51:09,072 INFO ]: Without dead ends: 71 [2018-06-25 09:51:09,072 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:51:09,073 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-25 09:51:09,074 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 45. [2018-06-25 09:51:09,074 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:51:09,074 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2018-06-25 09:51:09,074 INFO ]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 24 [2018-06-25 09:51:09,075 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:09,075 INFO ]: Abstraction has 45 states and 64 transitions. [2018-06-25 09:51:09,075 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:51:09,075 INFO ]: Start isEmpty. Operand 45 states and 64 transitions. [2018-06-25 09:51:09,075 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:51:09,075 INFO ]: Found error trace [2018-06-25 09:51:09,075 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:09,075 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:09,075 INFO ]: Analyzing trace with hash 131605198, now seen corresponding path program 9 times [2018-06-25 09:51:09,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:09,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:09,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:09,076 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:09,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:09,094 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:09,292 INFO ]: Checked inductivity of 51 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:51:09,292 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:09,292 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-25 09:51:09,298 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:09,343 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:51:09,343 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:09,349 INFO ]: Computing forward predicates... [2018-06-25 09:51:15,779 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-25 09:51:20,426 INFO ]: Checked inductivity of 51 backedges. 0 proven. 35 refuted. 1 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 09:51:20,445 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:20,445 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 25 [2018-06-25 09:51:20,446 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:51:20,446 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:51:20,446 INFO ]: CoverageRelationStatistics Valid=76, Invalid=513, Unknown=11, NotChecked=0, Total=600 [2018-06-25 09:51:20,446 INFO ]: Start difference. First operand 45 states and 64 transitions. Second operand 25 states. Received shutdown request... [2018-06-25 09:51:37,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:51:37,973 WARN ]: Verification canceled [2018-06-25 09:51:37,978 WARN ]: Timeout [2018-06-25 09:51:37,978 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:51:37 BoogieIcfgContainer [2018-06-25 09:51:37,978 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:51:37,979 INFO ]: Toolchain (without parser) took 63775.67 ms. Allocated memory was 307.2 MB in the beginning and 568.9 MB in the end (delta: 261.6 MB). Free memory was 261.8 MB in the beginning and 409.4 MB in the end (delta: -147.7 MB). Peak memory consumption was 113.9 MB. Max. memory is 3.6 GB. [2018-06-25 09:51:37,980 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 307.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:51:37,980 INFO ]: ChcToBoogie took 76.08 ms. Allocated memory is still 307.2 MB. Free memory was 261.8 MB in the beginning and 259.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:51:37,980 INFO ]: Boogie Preprocessor took 38.07 ms. Allocated memory is still 307.2 MB. Free memory was 259.8 MB in the beginning and 257.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:51:37,981 INFO ]: RCFGBuilder took 362.44 ms. Allocated memory is still 307.2 MB. Free memory was 257.8 MB in the beginning and 245.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:51:37,981 INFO ]: TraceAbstraction took 63281.37 ms. Allocated memory was 307.2 MB in the beginning and 568.9 MB in the end (delta: 261.6 MB). Free memory was 245.8 MB in the beginning and 409.4 MB in the end (delta: -163.6 MB). Peak memory consumption was 98.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:51:37,983 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 307.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 76.08 ms. Allocated memory is still 307.2 MB. Free memory was 261.8 MB in the beginning and 259.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.07 ms. Allocated memory is still 307.2 MB. Free memory was 259.8 MB in the beginning and 257.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 362.44 ms. Allocated memory is still 307.2 MB. Free memory was 257.8 MB in the beginning and 245.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 63281.37 ms. Allocated memory was 307.2 MB in the beginning and 568.9 MB in the end (delta: 261.6 MB). Free memory was 245.8 MB in the beginning and 409.4 MB in the end (delta: -163.6 MB). Peak memory consumption was 98.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (45states) and interpolant automaton (currently 15 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. TIMEOUT Result, 63.2s OverallTime, 47 OverallIterations, 5 TraceHistogramMax, 34.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 582 SDtfs, 1407 SDslu, 3648 SDs, 0 SdLazy, 7172 SolverSat, 2609 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 20.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1632 GetRequests, 622 SyntacticMatches, 46 SemanticMatches, 963 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5925 ImplicationChecksByTransitivity, 35.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=41, 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, 46 MinimizatonAttempts, 1151 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 1477 NumberOfCodeBlocks, 1476 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 1389 ConstructedInterpolants, 5 QuantifiedInterpolants, 98067 SizeOfPredicates, 204 NumberOfNonLiveVariables, 10422 ConjunctsInSsa, 1595 ConjunctsInUnsatCore, 88 InterpolantComputations, 11 PerfectInterpolantSequences, 936/1572 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/loop__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-51-38-078.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-51-38-078.csv Completed graceful shutdown