java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/libc__memrchr_1.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:44:02,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:44:02,683 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:44:02,695 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:44:02,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:44:02,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:44:02,700 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:44:02,702 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:44:02,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:44:02,705 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:44:02,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:44:02,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:44:02,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:44:02,711 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:44:02,712 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:44:02,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:44:02,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:44:02,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:44:02,717 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:44:02,718 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:44:02,719 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:44:02,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:44:02,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:44:02,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:44:02,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:44:02,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:44:02,724 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:44:02,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:44:02,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:44:02,726 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:44:02,726 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:44:02,727 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:44:02,727 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:44:02,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:44:02,729 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:44:02,729 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:44:02,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:44:02,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:44:02,742 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:44:02,743 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:44:02,744 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:44:02,744 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:44:02,744 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:44:02,744 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:44:02,745 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:44:02,745 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:44:02,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:44:02,745 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:44:02,746 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:44:02,746 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:44:02,746 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:44:02,746 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:44:02,746 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:44:02,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:44:02,747 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:44:02,748 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:44:02,748 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:44:02,789 INFO ]: Repository-Root is: /tmp [2018-06-22 11:44:02,808 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:44:02,812 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:44:02,814 INFO ]: Initializing SmtParser... [2018-06-22 11:44:02,814 INFO ]: SmtParser initialized [2018-06-22 11:44:02,815 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__memrchr_1.array.smt2 [2018-06-22 11:44:02,816 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:44:02,913 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__memrchr_1.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@5ffc6462 [2018-06-22 11:44:03,200 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__memrchr_1.array.smt2 [2018-06-22 11:44:03,211 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:44:03,219 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:44:03,220 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:44:03,220 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:44:03,220 INFO ]: ChcToBoogie initialized [2018-06-22 11:44:03,223 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:44:03" (1/1) ... [2018-06-22 11:44:03,274 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:03 Unit [2018-06-22 11:44:03,274 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:44:03,278 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:44:03,278 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:44:03,278 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:44:03,300 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:03" (1/1) ... [2018-06-22 11:44:03,300 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:03" (1/1) ... [2018-06-22 11:44:03,311 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:03" (1/1) ... [2018-06-22 11:44:03,311 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:03" (1/1) ... [2018-06-22 11:44:03,320 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:03" (1/1) ... [2018-06-22 11:44:03,322 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:03" (1/1) ... [2018-06-22 11:44:03,324 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:03" (1/1) ... [2018-06-22 11:44:03,325 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:44:03,326 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:44:03,326 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:44:03,326 INFO ]: RCFGBuilder initialized [2018-06-22 11:44:03,327 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:03" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:44:03,343 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:44:03,343 INFO ]: Found specification of procedure False [2018-06-22 11:44:03,343 INFO ]: Found implementation of procedure False [2018-06-22 11:44:03,343 INFO ]: Specification and implementation of procedure INV_MAIN_0 given in one single declaration [2018-06-22 11:44:03,343 INFO ]: Found specification of procedure INV_MAIN_0 [2018-06-22 11:44:03,343 INFO ]: Found implementation of procedure INV_MAIN_0 [2018-06-22 11:44:03,344 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:44:03,344 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:44:03,344 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:44:03,745 INFO ]: Using library mode [2018-06-22 11:44:03,745 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:44:03 BoogieIcfgContainer [2018-06-22 11:44:03,745 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:44:03,747 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:44:03,747 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:44:03,750 INFO ]: TraceAbstraction initialized [2018-06-22 11:44:03,751 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:44:03" (1/3) ... [2018-06-22 11:44:03,758 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f99efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:44:03, skipping insertion in model container [2018-06-22 11:44:03,758 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:03" (2/3) ... [2018-06-22 11:44:03,758 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f99efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:44:03, skipping insertion in model container [2018-06-22 11:44:03,758 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:44:03" (3/3) ... [2018-06-22 11:44:03,760 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:44:03,769 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:44:03,778 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:44:03,843 INFO ]: Using default assertion order modulation [2018-06-22 11:44:03,844 INFO ]: Interprodecural is true [2018-06-22 11:44:03,844 INFO ]: Hoare is false [2018-06-22 11:44:03,844 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:44:03,844 INFO ]: Backedges is TWOTRACK [2018-06-22 11:44:03,844 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:44:03,844 INFO ]: Difference is false [2018-06-22 11:44:03,844 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:44:03,844 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:44:03,864 INFO ]: Start isEmpty. Operand 18 states. [2018-06-22 11:44:03,876 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:44:03,876 INFO ]: Found error trace [2018-06-22 11:44:03,877 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:44:03,877 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:03,883 INFO ]: Analyzing trace with hash 103565625, now seen corresponding path program 1 times [2018-06-22 11:44:03,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:03,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:03,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:03,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:03,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:03,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:03,968 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:03,969 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:03,970 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:44:03,971 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:44:03,981 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:44:03,981 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:44:03,983 INFO ]: Start difference. First operand 18 states. Second operand 2 states. [2018-06-22 11:44:04,006 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:04,007 INFO ]: Finished difference Result 16 states and 27 transitions. [2018-06-22 11:44:04,007 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:44:04,010 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:44:04,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:04,023 INFO ]: With dead ends: 16 [2018-06-22 11:44:04,023 INFO ]: Without dead ends: 16 [2018-06-22 11:44:04,025 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:44:04,038 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 11:44:04,058 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 11:44:04,059 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 11:44:04,060 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-22 11:44:04,061 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 5 [2018-06-22 11:44:04,062 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:04,062 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-22 11:44:04,062 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:44:04,062 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-22 11:44:04,064 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:04,064 INFO ]: Found error trace [2018-06-22 11:44:04,064 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:04,064 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:04,064 INFO ]: Analyzing trace with hash 2083725191, now seen corresponding path program 1 times [2018-06-22 11:44:04,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:04,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:04,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:04,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:04,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:04,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:04,256 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:04,257 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:04,257 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:04,258 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:04,258 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:04,258 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:04,259 INFO ]: Start difference. First operand 16 states and 27 transitions. Second operand 4 states. [2018-06-22 11:44:04,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:04,672 INFO ]: Finished difference Result 20 states and 36 transitions. [2018-06-22 11:44:04,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:04,672 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:04,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:04,673 INFO ]: With dead ends: 20 [2018-06-22 11:44:04,673 INFO ]: Without dead ends: 20 [2018-06-22 11:44:04,674 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:04,675 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:44:04,684 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:44:04,684 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:44:04,685 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2018-06-22 11:44:04,685 INFO ]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 9 [2018-06-22 11:44:04,685 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:04,686 INFO ]: Abstraction has 18 states and 34 transitions. [2018-06-22 11:44:04,686 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:04,686 INFO ]: Start isEmpty. Operand 18 states and 34 transitions. [2018-06-22 11:44:04,687 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:04,687 INFO ]: Found error trace [2018-06-22 11:44:04,687 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:04,687 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:04,687 INFO ]: Analyzing trace with hash 1242252866, now seen corresponding path program 1 times [2018-06-22 11:44:04,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:04,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:04,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:04,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:04,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:04,705 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:04,858 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:04,858 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:04,858 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:04,858 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:04,858 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:04,858 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:04,858 INFO ]: Start difference. First operand 18 states and 34 transitions. Second operand 4 states. [2018-06-22 11:44:05,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:05,059 INFO ]: Finished difference Result 20 states and 35 transitions. [2018-06-22 11:44:05,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:05,062 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:05,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:05,063 INFO ]: With dead ends: 20 [2018-06-22 11:44:05,063 INFO ]: Without dead ends: 20 [2018-06-22 11:44:05,063 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:05,063 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:44:05,070 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:44:05,070 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:44:05,071 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-06-22 11:44:05,071 INFO ]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 9 [2018-06-22 11:44:05,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:05,071 INFO ]: Abstraction has 18 states and 33 transitions. [2018-06-22 11:44:05,071 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:05,071 INFO ]: Start isEmpty. Operand 18 states and 33 transitions. [2018-06-22 11:44:05,072 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:05,072 INFO ]: Found error trace [2018-06-22 11:44:05,072 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:05,072 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:05,075 INFO ]: Analyzing trace with hash -1153530403, now seen corresponding path program 1 times [2018-06-22 11:44:05,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:05,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:05,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:05,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:05,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:05,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:05,248 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:05,248 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:05,248 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:05,249 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:05,249 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:05,249 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:05,249 INFO ]: Start difference. First operand 18 states and 33 transitions. Second operand 4 states. [2018-06-22 11:44:05,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:05,448 INFO ]: Finished difference Result 18 states and 31 transitions. [2018-06-22 11:44:05,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:05,449 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:05,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:05,450 INFO ]: With dead ends: 18 [2018-06-22 11:44:05,450 INFO ]: Without dead ends: 17 [2018-06-22 11:44:05,450 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:05,451 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 11:44:05,460 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 11:44:05,460 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:44:05,460 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-06-22 11:44:05,461 INFO ]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 9 [2018-06-22 11:44:05,461 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:05,461 INFO ]: Abstraction has 17 states and 29 transitions. [2018-06-22 11:44:05,461 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:05,461 INFO ]: Start isEmpty. Operand 17 states and 29 transitions. [2018-06-22 11:44:05,462 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:05,462 INFO ]: Found error trace [2018-06-22 11:44:05,462 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:05,462 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:05,462 INFO ]: Analyzing trace with hash 184541164, now seen corresponding path program 1 times [2018-06-22 11:44:05,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:05,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:05,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:05,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:05,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:05,485 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:05,664 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-06-22 11:44:05,673 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:05,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:05,673 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:05,673 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:05,673 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:05,673 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:05,673 INFO ]: Start difference. First operand 17 states and 29 transitions. Second operand 4 states. [2018-06-22 11:44:05,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:05,807 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-22 11:44:05,808 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:05,808 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:05,808 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:05,808 INFO ]: With dead ends: 19 [2018-06-22 11:44:05,809 INFO ]: Without dead ends: 19 [2018-06-22 11:44:05,809 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:05,809 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:44:05,815 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:44:05,815 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:44:05,816 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-22 11:44:05,816 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 9 [2018-06-22 11:44:05,816 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:05,816 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-22 11:44:05,816 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:05,816 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-22 11:44:05,819 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:05,819 INFO ]: Found error trace [2018-06-22 11:44:05,819 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:05,820 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:05,820 INFO ]: Analyzing trace with hash -413475563, now seen corresponding path program 1 times [2018-06-22 11:44:05,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:05,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:05,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:05,821 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:05,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:05,847 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:06,089 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:06,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:06,090 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:06,098 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:06,129 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:06,137 INFO ]: Computing forward predicates... [2018-06-22 11:44:06,653 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:06,684 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:06,684 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:44:06,685 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:44:06,685 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:44:06,685 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:06,685 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 8 states. [2018-06-22 11:44:07,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:07,180 INFO ]: Finished difference Result 23 states and 43 transitions. [2018-06-22 11:44:07,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:07,180 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:44:07,180 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:07,181 INFO ]: With dead ends: 23 [2018-06-22 11:44:07,181 INFO ]: Without dead ends: 23 [2018-06-22 11:44:07,181 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:44:07,181 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:44:07,188 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-22 11:44:07,188 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:44:07,189 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2018-06-22 11:44:07,189 INFO ]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 13 [2018-06-22 11:44:07,189 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:07,189 INFO ]: Abstraction has 19 states and 34 transitions. [2018-06-22 11:44:07,189 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:44:07,189 INFO ]: Start isEmpty. Operand 19 states and 34 transitions. [2018-06-22 11:44:07,190 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:07,190 INFO ]: Found error trace [2018-06-22 11:44:07,190 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:07,190 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:07,190 INFO ]: Analyzing trace with hash -1707114160, now seen corresponding path program 1 times [2018-06-22 11:44:07,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:07,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:07,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:07,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:07,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:07,221 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:07,325 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:07,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:07,325 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:07,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:07,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:07,364 INFO ]: Computing forward predicates... [2018-06-22 11:44:07,490 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:07,510 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:07,510 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:07,510 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:07,510 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:07,510 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:07,511 INFO ]: Start difference. First operand 19 states and 34 transitions. Second operand 6 states. [2018-06-22 11:44:07,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:07,636 INFO ]: Finished difference Result 23 states and 42 transitions. [2018-06-22 11:44:07,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:07,637 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:07,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:07,638 INFO ]: With dead ends: 23 [2018-06-22 11:44:07,638 INFO ]: Without dead ends: 23 [2018-06-22 11:44:07,638 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:07,638 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:44:07,643 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-22 11:44:07,643 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:44:07,644 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2018-06-22 11:44:07,644 INFO ]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 13 [2018-06-22 11:44:07,645 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:07,645 INFO ]: Abstraction has 19 states and 33 transitions. [2018-06-22 11:44:07,645 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:07,645 INFO ]: Start isEmpty. Operand 19 states and 33 transitions. [2018-06-22 11:44:07,646 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:07,646 INFO ]: Found error trace [2018-06-22 11:44:07,646 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:07,646 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:07,646 INFO ]: Analyzing trace with hash -1760013318, now seen corresponding path program 1 times [2018-06-22 11:44:07,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:07,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:07,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:07,647 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:07,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:07,657 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:07,822 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:07,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:07,822 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:07,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:07,857 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:07,859 INFO ]: Computing forward predicates... [2018-06-22 11:44:07,954 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:07,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:07,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:44:07,980 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:44:07,980 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:44:07,980 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:07,980 INFO ]: Start difference. First operand 19 states and 33 transitions. Second operand 8 states. [2018-06-22 11:44:08,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:08,188 INFO ]: Finished difference Result 25 states and 45 transitions. [2018-06-22 11:44:08,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:08,188 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:44:08,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:08,189 INFO ]: With dead ends: 25 [2018-06-22 11:44:08,189 INFO ]: Without dead ends: 25 [2018-06-22 11:44:08,190 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:08,190 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:44:08,194 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-06-22 11:44:08,194 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:44:08,195 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-22 11:44:08,195 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 13 [2018-06-22 11:44:08,195 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:08,195 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-22 11:44:08,195 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:44:08,195 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-22 11:44:08,196 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:08,196 INFO ]: Found error trace [2018-06-22 11:44:08,196 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:08,196 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:08,196 INFO ]: Analyzing trace with hash -658726416, now seen corresponding path program 1 times [2018-06-22 11:44:08,196 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:08,196 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:08,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:08,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:08,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:08,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:08,265 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:08,265 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:08,265 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:08,266 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:08,266 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:08,266 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:08,266 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 5 states. [2018-06-22 11:44:08,377 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:08,378 INFO ]: Finished difference Result 25 states and 47 transitions. [2018-06-22 11:44:08,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:08,380 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:08,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:08,380 INFO ]: With dead ends: 25 [2018-06-22 11:44:08,380 INFO ]: Without dead ends: 25 [2018-06-22 11:44:08,381 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:08,381 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:44:08,386 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 11:44:08,386 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:44:08,387 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. [2018-06-22 11:44:08,387 INFO ]: Start accepts. Automaton has 21 states and 38 transitions. Word has length 13 [2018-06-22 11:44:08,387 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:08,387 INFO ]: Abstraction has 21 states and 38 transitions. [2018-06-22 11:44:08,387 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:08,387 INFO ]: Start isEmpty. Operand 21 states and 38 transitions. [2018-06-22 11:44:08,388 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:08,388 INFO ]: Found error trace [2018-06-22 11:44:08,388 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:08,388 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:08,389 INFO ]: Analyzing trace with hash -1952365013, now seen corresponding path program 1 times [2018-06-22 11:44:08,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:08,389 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:08,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:08,389 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:08,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:08,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:08,456 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:08,456 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:08,456 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:08,456 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:08,456 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:08,456 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:08,456 INFO ]: Start difference. First operand 21 states and 38 transitions. Second operand 5 states. [2018-06-22 11:44:08,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:08,636 INFO ]: Finished difference Result 25 states and 46 transitions. [2018-06-22 11:44:08,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:08,637 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:08,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:08,637 INFO ]: With dead ends: 25 [2018-06-22 11:44:08,637 INFO ]: Without dead ends: 25 [2018-06-22 11:44:08,638 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:08,638 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:44:08,642 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 11:44:08,642 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:44:08,642 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 37 transitions. [2018-06-22 11:44:08,642 INFO ]: Start accepts. Automaton has 21 states and 37 transitions. Word has length 13 [2018-06-22 11:44:08,643 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:08,643 INFO ]: Abstraction has 21 states and 37 transitions. [2018-06-22 11:44:08,643 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:08,643 INFO ]: Start isEmpty. Operand 21 states and 37 transitions. [2018-06-22 11:44:08,644 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:08,644 INFO ]: Found error trace [2018-06-22 11:44:08,644 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:08,644 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:08,644 INFO ]: Analyzing trace with hash -2005264171, now seen corresponding path program 1 times [2018-06-22 11:44:08,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:08,644 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:08,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:08,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:08,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:08,655 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:08,715 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:08,715 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:08,715 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:08,715 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:08,715 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:08,715 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:08,715 INFO ]: Start difference. First operand 21 states and 37 transitions. Second operand 5 states. [2018-06-22 11:44:08,843 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:08,844 INFO ]: Finished difference Result 25 states and 45 transitions. [2018-06-22 11:44:08,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:08,844 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:08,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:08,845 INFO ]: With dead ends: 25 [2018-06-22 11:44:08,845 INFO ]: Without dead ends: 25 [2018-06-22 11:44:08,845 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:08,845 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:44:08,849 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 11:44:08,849 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:44:08,850 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-06-22 11:44:08,850 INFO ]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 13 [2018-06-22 11:44:08,851 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:08,851 INFO ]: Abstraction has 21 states and 36 transitions. [2018-06-22 11:44:08,851 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:08,851 INFO ]: Start isEmpty. Operand 21 states and 36 transitions. [2018-06-22 11:44:08,851 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:08,851 INFO ]: Found error trace [2018-06-22 11:44:08,851 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:08,852 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:08,852 INFO ]: Analyzing trace with hash -903977269, now seen corresponding path program 1 times [2018-06-22 11:44:08,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:08,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:08,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:08,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:08,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:08,859 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:08,942 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:08,942 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:08,942 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:08,948 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:08,960 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:08,962 INFO ]: Computing forward predicates... [2018-06-22 11:44:09,086 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:09,106 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:09,106 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:09,106 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:09,106 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:09,106 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:09,106 INFO ]: Start difference. First operand 21 states and 36 transitions. Second operand 6 states. [2018-06-22 11:44:09,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:09,424 INFO ]: Finished difference Result 27 states and 51 transitions. [2018-06-22 11:44:09,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:09,426 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:09,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:09,427 INFO ]: With dead ends: 27 [2018-06-22 11:44:09,427 INFO ]: Without dead ends: 27 [2018-06-22 11:44:09,427 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:09,427 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:44:09,432 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:44:09,432 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:44:09,432 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2018-06-22 11:44:09,432 INFO ]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 13 [2018-06-22 11:44:09,433 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:09,433 INFO ]: Abstraction has 23 states and 42 transitions. [2018-06-22 11:44:09,433 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:09,433 INFO ]: Start isEmpty. Operand 23 states and 42 transitions. [2018-06-22 11:44:09,434 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:09,434 INFO ]: Found error trace [2018-06-22 11:44:09,434 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:09,434 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:09,434 INFO ]: Analyzing trace with hash 2044452272, now seen corresponding path program 1 times [2018-06-22 11:44:09,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:09,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:09,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:09,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:09,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:09,442 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:09,523 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:09,523 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:09,523 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:09,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:09,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:09,542 INFO ]: Computing forward predicates... [2018-06-22 11:44:09,564 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:09,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:09,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:09,583 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:09,584 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:09,584 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:09,584 INFO ]: Start difference. First operand 23 states and 42 transitions. Second operand 6 states. [2018-06-22 11:44:09,701 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:09,701 INFO ]: Finished difference Result 27 states and 50 transitions. [2018-06-22 11:44:09,701 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:09,701 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:09,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:09,702 INFO ]: With dead ends: 27 [2018-06-22 11:44:09,702 INFO ]: Without dead ends: 27 [2018-06-22 11:44:09,702 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:09,702 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:44:09,706 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:44:09,706 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:44:09,707 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 41 transitions. [2018-06-22 11:44:09,707 INFO ]: Start accepts. Automaton has 23 states and 41 transitions. Word has length 13 [2018-06-22 11:44:09,707 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:09,707 INFO ]: Abstraction has 23 states and 41 transitions. [2018-06-22 11:44:09,707 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:09,707 INFO ]: Start isEmpty. Operand 23 states and 41 transitions. [2018-06-22 11:44:09,708 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:09,708 INFO ]: Found error trace [2018-06-22 11:44:09,708 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:09,708 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:09,708 INFO ]: Analyzing trace with hash 2097351430, now seen corresponding path program 1 times [2018-06-22 11:44:09,708 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:09,708 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:09,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:09,714 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:09,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:09,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:09,775 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:09,775 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:09,775 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:09,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:09,790 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:09,791 INFO ]: Computing forward predicates... [2018-06-22 11:44:09,817 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:09,836 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:09,836 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:09,836 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:09,836 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:09,836 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:09,837 INFO ]: Start difference. First operand 23 states and 41 transitions. Second operand 6 states. [2018-06-22 11:44:09,949 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:09,949 INFO ]: Finished difference Result 27 states and 49 transitions. [2018-06-22 11:44:09,949 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:09,949 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:09,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:09,950 INFO ]: With dead ends: 27 [2018-06-22 11:44:09,950 INFO ]: Without dead ends: 27 [2018-06-22 11:44:09,950 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:09,950 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:44:09,955 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:44:09,955 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:44:09,956 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2018-06-22 11:44:09,956 INFO ]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 13 [2018-06-22 11:44:09,956 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:09,956 INFO ]: Abstraction has 23 states and 40 transitions. [2018-06-22 11:44:09,956 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:09,956 INFO ]: Start isEmpty. Operand 23 states and 40 transitions. [2018-06-22 11:44:09,957 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:09,957 INFO ]: Found error trace [2018-06-22 11:44:09,957 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:09,957 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:09,957 INFO ]: Analyzing trace with hash -357678594, now seen corresponding path program 1 times [2018-06-22 11:44:09,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:09,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:09,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:09,959 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:09,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:09,973 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:10,377 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:10,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:10,378 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:10,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:10,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:10,409 INFO ]: Computing forward predicates... [2018-06-22 11:44:10,579 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:10,598 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:10,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:44:10,598 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:44:10,598 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:44:10,598 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:44:10,598 INFO ]: Start difference. First operand 23 states and 40 transitions. Second operand 14 states. [2018-06-22 11:44:10,913 WARN ]: Spent 206.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-06-22 11:44:12,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:12,116 INFO ]: Finished difference Result 85 states and 192 transitions. [2018-06-22 11:44:12,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:44:12,117 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:44:12,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:12,118 INFO ]: With dead ends: 85 [2018-06-22 11:44:12,118 INFO ]: Without dead ends: 73 [2018-06-22 11:44:12,118 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:44:12,119 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 11:44:12,133 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 49. [2018-06-22 11:44:12,133 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:44:12,134 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 100 transitions. [2018-06-22 11:44:12,134 INFO ]: Start accepts. Automaton has 49 states and 100 transitions. Word has length 17 [2018-06-22 11:44:12,134 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:12,134 INFO ]: Abstraction has 49 states and 100 transitions. [2018-06-22 11:44:12,134 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:44:12,134 INFO ]: Start isEmpty. Operand 49 states and 100 transitions. [2018-06-22 11:44:12,135 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:12,135 INFO ]: Found error trace [2018-06-22 11:44:12,135 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:12,135 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:12,135 INFO ]: Analyzing trace with hash 1323913748, now seen corresponding path program 1 times [2018-06-22 11:44:12,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:12,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:12,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:12,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:12,136 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:12,147 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:12,267 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:12,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:12,316 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:12,323 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:12,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:12,336 INFO ]: Computing forward predicates... [2018-06-22 11:44:12,376 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:12,396 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:12,396 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:44:12,396 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:12,396 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:12,396 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:12,396 INFO ]: Start difference. First operand 49 states and 100 transitions. Second operand 7 states. [2018-06-22 11:44:12,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:12,578 INFO ]: Finished difference Result 83 states and 187 transitions. [2018-06-22 11:44:12,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:12,580 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:44:12,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:12,581 INFO ]: With dead ends: 83 [2018-06-22 11:44:12,581 INFO ]: Without dead ends: 83 [2018-06-22 11:44:12,581 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:44:12,581 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 11:44:12,594 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 55. [2018-06-22 11:44:12,594 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:44:12,596 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 120 transitions. [2018-06-22 11:44:12,596 INFO ]: Start accepts. Automaton has 55 states and 120 transitions. Word has length 17 [2018-06-22 11:44:12,596 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:12,596 INFO ]: Abstraction has 55 states and 120 transitions. [2018-06-22 11:44:12,596 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:12,596 INFO ]: Start isEmpty. Operand 55 states and 120 transitions. [2018-06-22 11:44:12,597 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:12,597 INFO ]: Found error trace [2018-06-22 11:44:12,597 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:12,597 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:12,598 INFO ]: Analyzing trace with hash 879947865, now seen corresponding path program 1 times [2018-06-22 11:44:12,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:12,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:12,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:12,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:12,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:12,605 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:13,291 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:13,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:13,291 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:13,296 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:13,311 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:13,312 INFO ]: Computing forward predicates... [2018-06-22 11:44:13,351 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:13,370 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:13,370 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:44:13,370 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:44:13,370 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:44:13,370 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:13,370 INFO ]: Start difference. First operand 55 states and 120 transitions. Second operand 8 states. [2018-06-22 11:44:13,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:13,617 INFO ]: Finished difference Result 115 states and 271 transitions. [2018-06-22 11:44:13,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:44:13,617 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:44:13,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:13,618 INFO ]: With dead ends: 115 [2018-06-22 11:44:13,618 INFO ]: Without dead ends: 111 [2018-06-22 11:44:13,618 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:44:13,619 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 11:44:13,637 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 73. [2018-06-22 11:44:13,637 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:44:13,639 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 171 transitions. [2018-06-22 11:44:13,639 INFO ]: Start accepts. Automaton has 73 states and 171 transitions. Word has length 17 [2018-06-22 11:44:13,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:13,639 INFO ]: Abstraction has 73 states and 171 transitions. [2018-06-22 11:44:13,639 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:44:13,639 INFO ]: Start isEmpty. Operand 73 states and 171 transitions. [2018-06-22 11:44:13,640 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:13,640 INFO ]: Found error trace [2018-06-22 11:44:13,641 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:13,641 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:13,641 INFO ]: Analyzing trace with hash 417455550, now seen corresponding path program 1 times [2018-06-22 11:44:13,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:13,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:13,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:13,641 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:13,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:13,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:13,731 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:13,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:13,732 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:13,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:13,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:13,752 INFO ]: Computing forward predicates... [2018-06-22 11:44:13,812 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:13,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:13,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:44:13,833 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:44:13,833 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:44:13,833 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:44:13,833 INFO ]: Start difference. First operand 73 states and 171 transitions. Second operand 11 states. [2018-06-22 11:44:14,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:14,120 INFO ]: Finished difference Result 111 states and 252 transitions. [2018-06-22 11:44:14,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:44:14,120 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:44:14,120 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:14,122 INFO ]: With dead ends: 111 [2018-06-22 11:44:14,122 INFO ]: Without dead ends: 111 [2018-06-22 11:44:14,122 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:44:14,122 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 11:44:14,146 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 73. [2018-06-22 11:44:14,146 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:44:14,147 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 164 transitions. [2018-06-22 11:44:14,147 INFO ]: Start accepts. Automaton has 73 states and 164 transitions. Word has length 17 [2018-06-22 11:44:14,147 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:14,147 INFO ]: Abstraction has 73 states and 164 transitions. [2018-06-22 11:44:14,147 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:44:14,147 INFO ]: Start isEmpty. Operand 73 states and 164 transitions. [2018-06-22 11:44:14,154 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:14,154 INFO ]: Found error trace [2018-06-22 11:44:14,154 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:14,154 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:14,154 INFO ]: Analyzing trace with hash -1058173506, now seen corresponding path program 2 times [2018-06-22 11:44:14,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:14,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:14,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:14,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:14,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:14,169 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:14,353 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:14,353 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:14,353 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:14,359 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:14,397 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:14,397 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:14,400 INFO ]: Computing forward predicates... [2018-06-22 11:44:14,779 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:14,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:14,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 11:44:14,804 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:44:14,804 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:44:14,804 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:44:14,804 INFO ]: Start difference. First operand 73 states and 164 transitions. Second operand 11 states. [2018-06-22 11:44:15,478 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:15,478 INFO ]: Finished difference Result 117 states and 273 transitions. [2018-06-22 11:44:15,478 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:15,478 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:44:15,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:15,480 INFO ]: With dead ends: 117 [2018-06-22 11:44:15,480 INFO ]: Without dead ends: 115 [2018-06-22 11:44:15,481 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:44:15,481 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-22 11:44:15,500 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 77. [2018-06-22 11:44:15,500 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:44:15,503 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 175 transitions. [2018-06-22 11:44:15,503 INFO ]: Start accepts. Automaton has 77 states and 175 transitions. Word has length 17 [2018-06-22 11:44:15,503 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:15,503 INFO ]: Abstraction has 77 states and 175 transitions. [2018-06-22 11:44:15,503 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:44:15,503 INFO ]: Start isEmpty. Operand 77 states and 175 transitions. [2018-06-22 11:44:15,505 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:15,505 INFO ]: Found error trace [2018-06-22 11:44:15,505 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:15,505 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:15,505 INFO ]: Analyzing trace with hash 1417079412, now seen corresponding path program 1 times [2018-06-22 11:44:15,505 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:15,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:15,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:15,511 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:15,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:15,519 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:15,668 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:15,668 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:15,668 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:15,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:15,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:15,705 INFO ]: Computing forward predicates... [2018-06-22 11:44:15,957 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:15,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:15,986 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:44:15,986 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:44:15,986 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:44:15,986 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:15,987 INFO ]: Start difference. First operand 77 states and 175 transitions. Second operand 8 states. [2018-06-22 11:44:16,187 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:16,187 INFO ]: Finished difference Result 117 states and 273 transitions. [2018-06-22 11:44:16,187 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:16,187 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:44:16,187 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:16,188 INFO ]: With dead ends: 117 [2018-06-22 11:44:16,188 INFO ]: Without dead ends: 115 [2018-06-22 11:44:16,189 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:44:16,189 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-22 11:44:16,200 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 79. [2018-06-22 11:44:16,200 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:44:16,201 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 181 transitions. [2018-06-22 11:44:16,201 INFO ]: Start accepts. Automaton has 79 states and 181 transitions. Word has length 17 [2018-06-22 11:44:16,201 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:16,201 INFO ]: Abstraction has 79 states and 181 transitions. [2018-06-22 11:44:16,201 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:44:16,201 INFO ]: Start isEmpty. Operand 79 states and 181 transitions. [2018-06-22 11:44:16,203 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:16,203 INFO ]: Found error trace [2018-06-22 11:44:16,203 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:16,203 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:16,203 INFO ]: Analyzing trace with hash -614207623, now seen corresponding path program 1 times [2018-06-22 11:44:16,203 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:16,203 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:16,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:16,204 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:16,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:16,211 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:16,314 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:16,315 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:16,315 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:16,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:16,331 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:16,333 INFO ]: Computing forward predicates... [2018-06-22 11:44:16,366 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:16,385 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:16,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:44:16,386 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:44:16,386 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:44:16,386 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:16,386 INFO ]: Start difference. First operand 79 states and 181 transitions. Second operand 8 states. [2018-06-22 11:44:16,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:16,515 INFO ]: Finished difference Result 117 states and 273 transitions. [2018-06-22 11:44:16,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:16,515 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:44:16,515 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:16,517 INFO ]: With dead ends: 117 [2018-06-22 11:44:16,517 INFO ]: Without dead ends: 117 [2018-06-22 11:44:16,517 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:16,517 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:44:16,530 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 79. [2018-06-22 11:44:16,531 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:44:16,531 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 179 transitions. [2018-06-22 11:44:16,532 INFO ]: Start accepts. Automaton has 79 states and 179 transitions. Word has length 17 [2018-06-22 11:44:16,532 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:16,532 INFO ]: Abstraction has 79 states and 179 transitions. [2018-06-22 11:44:16,532 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:44:16,532 INFO ]: Start isEmpty. Operand 79 states and 179 transitions. [2018-06-22 11:44:16,535 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:16,535 INFO ]: Found error trace [2018-06-22 11:44:16,535 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:16,535 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:16,535 INFO ]: Analyzing trace with hash 1861045295, now seen corresponding path program 1 times [2018-06-22 11:44:16,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:16,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:16,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:16,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:16,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:16,546 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:16,681 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:16,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:16,681 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:16,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:16,708 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:16,710 INFO ]: Computing forward predicates... [2018-06-22 11:44:16,741 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:16,761 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:16,761 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:44:16,761 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:44:16,761 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:44:16,761 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:16,761 INFO ]: Start difference. First operand 79 states and 179 transitions. Second operand 8 states. [2018-06-22 11:44:17,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:17,015 INFO ]: Finished difference Result 115 states and 267 transitions. [2018-06-22 11:44:17,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:17,018 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:44:17,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:17,019 INFO ]: With dead ends: 115 [2018-06-22 11:44:17,019 INFO ]: Without dead ends: 115 [2018-06-22 11:44:17,019 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:17,019 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-22 11:44:17,028 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 79. [2018-06-22 11:44:17,028 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:44:17,029 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 178 transitions. [2018-06-22 11:44:17,029 INFO ]: Start accepts. Automaton has 79 states and 178 transitions. Word has length 17 [2018-06-22 11:44:17,030 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:17,030 INFO ]: Abstraction has 79 states and 178 transitions. [2018-06-22 11:44:17,030 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:44:17,030 INFO ]: Start isEmpty. Operand 79 states and 178 transitions. [2018-06-22 11:44:17,031 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:17,031 INFO ]: Found error trace [2018-06-22 11:44:17,031 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:17,031 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:17,031 INFO ]: Analyzing trace with hash 954587097, now seen corresponding path program 1 times [2018-06-22 11:44:17,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:17,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:17,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:17,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:17,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:17,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:17,537 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:44:17,684 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:17,684 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:17,684 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) [2018-06-22 11:44:17,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:17,720 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:17,722 INFO ]: Computing forward predicates... [2018-06-22 11:44:17,832 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:17,851 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:17,851 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:44:17,851 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:44:17,851 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:44:17,851 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:17,851 INFO ]: Start difference. First operand 79 states and 178 transitions. Second operand 8 states. [2018-06-22 11:44:17,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:17,990 INFO ]: Finished difference Result 115 states and 266 transitions. [2018-06-22 11:44:17,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:17,990 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:44:17,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:17,991 INFO ]: With dead ends: 115 [2018-06-22 11:44:17,991 INFO ]: Without dead ends: 115 [2018-06-22 11:44:17,992 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:17,992 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-22 11:44:18,001 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 77. [2018-06-22 11:44:18,001 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:44:18,002 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 172 transitions. [2018-06-22 11:44:18,002 INFO ]: Start accepts. Automaton has 77 states and 172 transitions. Word has length 17 [2018-06-22 11:44:18,002 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:18,002 INFO ]: Abstraction has 77 states and 172 transitions. [2018-06-22 11:44:18,002 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:44:18,002 INFO ]: Start isEmpty. Operand 77 states and 172 transitions. [2018-06-22 11:44:18,003 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:18,003 INFO ]: Found error trace [2018-06-22 11:44:18,003 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:18,003 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:18,003 INFO ]: Analyzing trace with hash -521041959, now seen corresponding path program 2 times [2018-06-22 11:44:18,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:18,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:18,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:18,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:18,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:18,011 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:18,183 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:18,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:18,183 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:18,190 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:18,201 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:18,201 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:18,202 INFO ]: Computing forward predicates... [2018-06-22 11:44:18,268 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:18,288 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:18,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 11:44:18,289 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:44:18,289 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:44:18,289 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:44:18,289 INFO ]: Start difference. First operand 77 states and 172 transitions. Second operand 13 states. [2018-06-22 11:44:19,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:19,364 INFO ]: Finished difference Result 187 states and 437 transitions. [2018-06-22 11:44:19,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:44:19,365 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:44:19,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:19,367 INFO ]: With dead ends: 187 [2018-06-22 11:44:19,367 INFO ]: Without dead ends: 169 [2018-06-22 11:44:19,368 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:44:19,368 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-22 11:44:19,386 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 93. [2018-06-22 11:44:19,386 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-22 11:44:19,387 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 214 transitions. [2018-06-22 11:44:19,387 INFO ]: Start accepts. Automaton has 93 states and 214 transitions. Word has length 17 [2018-06-22 11:44:19,387 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:19,387 INFO ]: Abstraction has 93 states and 214 transitions. [2018-06-22 11:44:19,387 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:44:19,387 INFO ]: Start isEmpty. Operand 93 states and 214 transitions. [2018-06-22 11:44:19,389 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:19,389 INFO ]: Found error trace [2018-06-22 11:44:19,389 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:19,389 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:19,389 INFO ]: Analyzing trace with hash -77076076, now seen corresponding path program 2 times [2018-06-22 11:44:19,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:19,389 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:19,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:19,389 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:19,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:19,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:19,647 WARN ]: Spent 199.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 11:44:20,117 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-22 11:44:20,341 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:20,341 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:20,341 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) [2018-06-22 11:44:20,356 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:20,399 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:20,399 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:20,401 INFO ]: Computing forward predicates... [2018-06-22 11:44:20,532 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:20,560 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:20,560 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:44:20,560 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:20,560 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:20,560 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:20,561 INFO ]: Start difference. First operand 93 states and 214 transitions. Second operand 7 states. [2018-06-22 11:44:20,691 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:20,691 INFO ]: Finished difference Result 153 states and 365 transitions. [2018-06-22 11:44:20,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:20,691 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:44:20,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:20,693 INFO ]: With dead ends: 153 [2018-06-22 11:44:20,693 INFO ]: Without dead ends: 153 [2018-06-22 11:44:20,693 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:44:20,693 INFO ]: Start minimizeSevpa. Operand 153 states. [2018-06-22 11:44:20,706 INFO ]: Finished minimizeSevpa. Reduced states from 153 to 99. [2018-06-22 11:44:20,706 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 11:44:20,707 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 229 transitions. [2018-06-22 11:44:20,708 INFO ]: Start accepts. Automaton has 99 states and 229 transitions. Word has length 17 [2018-06-22 11:44:20,708 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:20,708 INFO ]: Abstraction has 99 states and 229 transitions. [2018-06-22 11:44:20,708 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:20,708 INFO ]: Start isEmpty. Operand 99 states and 229 transitions. [2018-06-22 11:44:20,710 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:20,710 INFO ]: Found error trace [2018-06-22 11:44:20,710 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:20,710 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:20,710 INFO ]: Analyzing trace with hash -983534274, now seen corresponding path program 2 times [2018-06-22 11:44:20,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:20,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:20,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:20,710 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:20,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:20,720 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:20,847 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:44:20,847 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:20,847 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:20,852 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:20,863 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:20,863 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:20,865 INFO ]: Computing forward predicates... [2018-06-22 11:44:20,945 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:20,965 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:20,965 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-22 11:44:20,965 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:44:20,965 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:44:20,965 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:44:20,965 INFO ]: Start difference. First operand 99 states and 229 transitions. Second operand 11 states. [2018-06-22 11:44:21,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:21,361 INFO ]: Finished difference Result 141 states and 318 transitions. [2018-06-22 11:44:21,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:44:21,361 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:44:21,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:21,363 INFO ]: With dead ends: 141 [2018-06-22 11:44:21,363 INFO ]: Without dead ends: 133 [2018-06-22 11:44:21,363 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:44:21,364 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-22 11:44:21,373 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 87. [2018-06-22 11:44:21,373 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:44:21,374 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 197 transitions. [2018-06-22 11:44:21,374 INFO ]: Start accepts. Automaton has 87 states and 197 transitions. Word has length 17 [2018-06-22 11:44:21,374 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:21,374 INFO ]: Abstraction has 87 states and 197 transitions. [2018-06-22 11:44:21,374 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:44:21,374 INFO ]: Start isEmpty. Operand 87 states and 197 transitions. [2018-06-22 11:44:21,375 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:44:21,375 INFO ]: Found error trace [2018-06-22 11:44:21,375 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:21,375 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:21,376 INFO ]: Analyzing trace with hash 86287289, now seen corresponding path program 2 times [2018-06-22 11:44:21,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:21,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:21,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:21,376 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:21,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:21,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:21,541 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 11:44:21,592 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:21,592 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:21,592 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:21,593 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:21,593 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:21,593 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:21,593 INFO ]: Start difference. First operand 87 states and 197 transitions. Second operand 4 states. [2018-06-22 11:44:21,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:21,677 INFO ]: Finished difference Result 131 states and 271 transitions. [2018-06-22 11:44:21,680 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:44:21,680 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:44:21,680 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:21,682 INFO ]: With dead ends: 131 [2018-06-22 11:44:21,682 INFO ]: Without dead ends: 101 [2018-06-22 11:44:21,682 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:21,682 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 11:44:21,695 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 71. [2018-06-22 11:44:21,695 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:44:21,696 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 148 transitions. [2018-06-22 11:44:21,696 INFO ]: Start accepts. Automaton has 71 states and 148 transitions. Word has length 17 [2018-06-22 11:44:21,696 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:21,696 INFO ]: Abstraction has 71 states and 148 transitions. [2018-06-22 11:44:21,696 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:21,696 INFO ]: Start isEmpty. Operand 71 states and 148 transitions. [2018-06-22 11:44:21,697 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:44:21,697 INFO ]: Found error trace [2018-06-22 11:44:21,697 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:21,698 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:21,698 INFO ]: Analyzing trace with hash -192122137, now seen corresponding path program 3 times [2018-06-22 11:44:21,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:21,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:21,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:21,699 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:21,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:21,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:22,084 WARN ]: Spent 174.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-22 11:44:22,268 INFO ]: Checked inductivity of 19 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:44:22,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:22,269 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:22,275 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:44:22,287 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 11:44:22,287 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:22,289 INFO ]: Computing forward predicates... [2018-06-22 11:44:22,350 INFO ]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:44:22,369 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:44:22,369 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2018-06-22 11:44:22,370 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:44:22,370 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:44:22,370 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:44:22,370 INFO ]: Start difference. First operand 71 states and 148 transitions. Second operand 12 states. [2018-06-22 11:44:22,559 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:22,559 INFO ]: Finished difference Result 87 states and 169 transitions. [2018-06-22 11:44:22,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:22,559 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:44:22,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:22,560 INFO ]: With dead ends: 87 [2018-06-22 11:44:22,560 INFO ]: Without dead ends: 85 [2018-06-22 11:44:22,560 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:44:22,560 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:44:22,564 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 59. [2018-06-22 11:44:22,564 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:44:22,565 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 119 transitions. [2018-06-22 11:44:22,565 INFO ]: Start accepts. Automaton has 59 states and 119 transitions. Word has length 21 [2018-06-22 11:44:22,565 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:22,565 INFO ]: Abstraction has 59 states and 119 transitions. [2018-06-22 11:44:22,565 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:44:22,565 INFO ]: Start isEmpty. Operand 59 states and 119 transitions. [2018-06-22 11:44:22,566 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:44:22,566 INFO ]: Found error trace [2018-06-22 11:44:22,566 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:22,566 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:22,566 INFO ]: Analyzing trace with hash 2122875293, now seen corresponding path program 2 times [2018-06-22 11:44:22,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:22,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:22,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:22,567 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:22,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:22,574 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:22,751 INFO ]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:44:22,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:22,751 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:22,756 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:22,770 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:22,770 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:22,772 INFO ]: Computing forward predicates... [2018-06-22 11:44:22,919 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-06-22 11:44:22,919 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:44:22,927 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:44:22,927 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-06-22 11:44:22,939 INFO ]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:44:22,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:22,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-06-22 11:44:22,958 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:44:22,958 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:44:22,958 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:44:22,958 INFO ]: Start difference. First operand 59 states and 119 transitions. Second operand 13 states. [2018-06-22 11:44:23,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:23,751 INFO ]: Finished difference Result 188 states and 360 transitions. [2018-06-22 11:44:23,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:44:23,751 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:44:23,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:23,752 INFO ]: With dead ends: 188 [2018-06-22 11:44:23,752 INFO ]: Without dead ends: 170 [2018-06-22 11:44:23,753 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:44:23,753 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-22 11:44:23,764 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 88. [2018-06-22 11:44:23,764 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 11:44:23,765 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 175 transitions. [2018-06-22 11:44:23,765 INFO ]: Start accepts. Automaton has 88 states and 175 transitions. Word has length 21 [2018-06-22 11:44:23,765 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:23,765 INFO ]: Abstraction has 88 states and 175 transitions. [2018-06-22 11:44:23,765 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:44:23,765 INFO ]: Start isEmpty. Operand 88 states and 175 transitions. [2018-06-22 11:44:23,766 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:44:23,766 INFO ]: Found error trace [2018-06-22 11:44:23,766 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:23,766 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:23,766 INFO ]: Analyzing trace with hash -479743619, now seen corresponding path program 1 times [2018-06-22 11:44:23,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:23,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:23,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:23,767 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:23,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:23,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:23,908 INFO ]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:44:23,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:23,908 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:23,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:23,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:23,934 INFO ]: Computing forward predicates... [2018-06-22 11:44:24,022 INFO ]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:44:24,054 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:24,054 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:44:24,055 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:44:24,055 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:44:24,055 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:44:24,055 INFO ]: Start difference. First operand 88 states and 175 transitions. Second operand 9 states. [2018-06-22 11:44:24,369 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:24,369 INFO ]: Finished difference Result 114 states and 219 transitions. [2018-06-22 11:44:24,369 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:44:24,369 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:44:24,369 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:24,370 INFO ]: With dead ends: 114 [2018-06-22 11:44:24,370 INFO ]: Without dead ends: 112 [2018-06-22 11:44:24,371 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:44:24,371 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:44:24,378 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 84. [2018-06-22 11:44:24,378 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:44:24,379 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 164 transitions. [2018-06-22 11:44:24,379 INFO ]: Start accepts. Automaton has 84 states and 164 transitions. Word has length 21 [2018-06-22 11:44:24,380 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:24,380 INFO ]: Abstraction has 84 states and 164 transitions. [2018-06-22 11:44:24,380 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:44:24,380 INFO ]: Start isEmpty. Operand 84 states and 164 transitions. [2018-06-22 11:44:24,380 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:44:24,380 INFO ]: Found error trace [2018-06-22 11:44:24,381 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:24,381 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:24,381 INFO ]: Analyzing trace with hash 181257841, now seen corresponding path program 1 times [2018-06-22 11:44:24,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:24,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:24,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:24,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:24,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:24,387 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:24,699 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-06-22 11:44:25,215 INFO ]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:44:25,216 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:25,216 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:25,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:25,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:25,260 INFO ]: Computing forward predicates... [2018-06-22 11:44:25,453 INFO ]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:44:25,472 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:25,472 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-06-22 11:44:25,472 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:44:25,472 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:44:25,472 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:44:25,472 INFO ]: Start difference. First operand 84 states and 164 transitions. Second operand 12 states. [2018-06-22 11:44:25,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:25,610 INFO ]: Finished difference Result 108 states and 208 transitions. [2018-06-22 11:44:25,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:44:25,610 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:44:25,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:25,611 INFO ]: With dead ends: 108 [2018-06-22 11:44:25,611 INFO ]: Without dead ends: 108 [2018-06-22 11:44:25,612 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:44:25,612 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:44:25,617 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 82. [2018-06-22 11:44:25,617 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:44:25,618 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 160 transitions. [2018-06-22 11:44:25,618 INFO ]: Start accepts. Automaton has 82 states and 160 transitions. Word has length 21 [2018-06-22 11:44:25,618 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:25,618 INFO ]: Abstraction has 82 states and 160 transitions. [2018-06-22 11:44:25,618 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:44:25,619 INFO ]: Start isEmpty. Operand 82 states and 160 transitions. [2018-06-22 11:44:25,619 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:44:25,619 INFO ]: Found error trace [2018-06-22 11:44:25,619 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:25,619 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:25,620 INFO ]: Analyzing trace with hash 1047912664, now seen corresponding path program 2 times [2018-06-22 11:44:25,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:25,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:25,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:25,620 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:25,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:25,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:25,942 WARN ]: Spent 266.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-06-22 11:44:25,988 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:44:25,988 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:25,988 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:25,994 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:26,008 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:26,008 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:26,010 INFO ]: Computing forward predicates... [2018-06-22 11:44:26,071 INFO ]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:44:26,089 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:26,090 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 11 [2018-06-22 11:44:26,090 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:44:26,090 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:44:26,090 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:44:26,090 INFO ]: Start difference. First operand 82 states and 160 transitions. Second operand 11 states. [2018-06-22 11:44:26,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:26,737 INFO ]: Finished difference Result 105 states and 172 transitions. [2018-06-22 11:44:26,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:44:26,738 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:44:26,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:26,739 INFO ]: With dead ends: 105 [2018-06-22 11:44:26,739 INFO ]: Without dead ends: 71 [2018-06-22 11:44:26,739 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:44:26,739 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:44:26,744 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-06-22 11:44:26,744 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:44:26,745 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2018-06-22 11:44:26,745 INFO ]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 21 [2018-06-22 11:44:26,745 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:26,745 INFO ]: Abstraction has 55 states and 91 transitions. [2018-06-22 11:44:26,745 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:44:26,745 INFO ]: Start isEmpty. Operand 55 states and 91 transitions. [2018-06-22 11:44:26,746 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:44:26,746 INFO ]: Found error trace [2018-06-22 11:44:26,746 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:26,746 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:26,746 INFO ]: Analyzing trace with hash -1025570563, now seen corresponding path program 2 times [2018-06-22 11:44:26,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:26,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:26,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:26,748 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:26,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:26,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:26,936 WARN ]: Spent 132.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 11:44:26,970 INFO ]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:44:26,970 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:26,970 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:26,977 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:44:26,993 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:44:26,993 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:26,995 INFO ]: Computing forward predicates... [2018-06-22 11:44:27,025 INFO ]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:44:27,046 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:27,046 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:44:27,046 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:44:27,046 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:44:27,046 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:44:27,046 INFO ]: Start difference. First operand 55 states and 91 transitions. Second operand 9 states. [2018-06-22 11:44:27,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:27,291 INFO ]: Finished difference Result 75 states and 125 transitions. [2018-06-22 11:44:27,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:44:27,291 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:44:27,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:27,292 INFO ]: With dead ends: 75 [2018-06-22 11:44:27,292 INFO ]: Without dead ends: 73 [2018-06-22 11:44:27,292 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:44:27,292 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 11:44:27,296 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 55. [2018-06-22 11:44:27,296 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:44:27,297 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 90 transitions. [2018-06-22 11:44:27,297 INFO ]: Start accepts. Automaton has 55 states and 90 transitions. Word has length 21 [2018-06-22 11:44:27,297 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:27,297 INFO ]: Abstraction has 55 states and 90 transitions. [2018-06-22 11:44:27,297 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:44:27,297 INFO ]: Start isEmpty. Operand 55 states and 90 transitions. [2018-06-22 11:44:27,298 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:44:27,298 INFO ]: Found error trace [2018-06-22 11:44:27,298 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:27,298 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:27,298 INFO ]: Analyzing trace with hash -1847729392, now seen corresponding path program 1 times [2018-06-22 11:44:27,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:27,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:27,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:27,298 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:27,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:27,311 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:27,408 INFO ]: Checked inductivity of 31 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:44:27,409 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:27,409 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:27,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:27,435 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:27,437 INFO ]: Computing forward predicates... [2018-06-22 11:44:27,571 INFO ]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:44:27,589 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:27,589 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-22 11:44:27,589 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:44:27,590 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:44:27,590 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:44:27,590 INFO ]: Start difference. First operand 55 states and 90 transitions. Second operand 20 states. [2018-06-22 11:44:29,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:29,304 INFO ]: Finished difference Result 186 states and 327 transitions. [2018-06-22 11:44:29,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 11:44:29,304 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:44:29,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:29,305 INFO ]: With dead ends: 186 [2018-06-22 11:44:29,305 INFO ]: Without dead ends: 167 [2018-06-22 11:44:29,306 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=426, Invalid=2766, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:44:29,306 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 11:44:29,321 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 129. [2018-06-22 11:44:29,321 INFO ]: Start removeUnreachable. Operand 129 states. [2018-06-22 11:44:29,322 INFO ]: Finished removeUnreachable. Reduced from 129 states to 129 states and 235 transitions. [2018-06-22 11:44:29,322 INFO ]: Start accepts. Automaton has 129 states and 235 transitions. Word has length 25 [2018-06-22 11:44:29,322 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:29,322 INFO ]: Abstraction has 129 states and 235 transitions. [2018-06-22 11:44:29,322 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:44:29,322 INFO ]: Start isEmpty. Operand 129 states and 235 transitions. [2018-06-22 11:44:29,324 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:44:29,324 INFO ]: Found error trace [2018-06-22 11:44:29,324 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:29,324 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:29,324 INFO ]: Analyzing trace with hash -2020143413, now seen corresponding path program 3 times [2018-06-22 11:44:29,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:29,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:29,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:29,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:29,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:29,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:29,506 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-06-22 11:44:29,513 INFO ]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:44:29,513 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:29,513 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:29,513 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:29,513 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:29,513 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:29,513 INFO ]: Start difference. First operand 129 states and 235 transitions. Second operand 4 states. [2018-06-22 11:44:29,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:29,605 INFO ]: Finished difference Result 105 states and 147 transitions. [2018-06-22 11:44:29,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:44:29,605 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:44:29,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:29,606 INFO ]: With dead ends: 105 [2018-06-22 11:44:29,606 INFO ]: Without dead ends: 62 [2018-06-22 11:44:29,606 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:29,606 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:44:29,609 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 57. [2018-06-22 11:44:29,609 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:44:29,610 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2018-06-22 11:44:29,610 INFO ]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 25 [2018-06-22 11:44:29,610 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:29,610 INFO ]: Abstraction has 57 states and 80 transitions. [2018-06-22 11:44:29,610 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:29,610 INFO ]: Start isEmpty. Operand 57 states and 80 transitions. [2018-06-22 11:44:29,611 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:44:29,611 INFO ]: Found error trace [2018-06-22 11:44:29,611 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:29,611 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:29,611 INFO ]: Analyzing trace with hash 1082621899, now seen corresponding path program 4 times [2018-06-22 11:44:29,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:29,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:29,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:29,612 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:44:29,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:29,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:29,691 INFO ]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:44:29,691 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:29,691 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:29,696 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:44:29,713 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:44:29,713 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:29,716 INFO ]: Computing forward predicates... [2018-06-22 11:44:29,794 INFO ]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:44:29,813 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:29,813 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11] total 13 [2018-06-22 11:44:29,813 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:44:29,813 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:44:29,813 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:44:29,814 INFO ]: Start difference. First operand 57 states and 80 transitions. Second operand 13 states. [2018-06-22 11:44:30,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:30,687 INFO ]: Finished difference Result 49 states and 65 transitions. [2018-06-22 11:44:30,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:44:30,687 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 11:44:30,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:30,687 INFO ]: With dead ends: 49 [2018-06-22 11:44:30,687 INFO ]: Without dead ends: 0 [2018-06-22 11:44:30,688 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:44:30,688 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:44:30,688 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:44:30,688 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:44:30,688 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:44:30,688 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-06-22 11:44:30,688 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:30,688 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:44:30,688 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:44:30,688 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:44:30,688 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:44:30,693 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:44:30 BoogieIcfgContainer [2018-06-22 11:44:30,693 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:44:30,693 INFO ]: Toolchain (without parser) took 27481.87 ms. Allocated memory was 307.8 MB in the beginning and 640.2 MB in the end (delta: 332.4 MB). Free memory was 260.2 MB in the beginning and 617.7 MB in the end (delta: -357.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:44:30,694 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 307.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:44:30,694 INFO ]: ChcToBoogie took 54.95 ms. Allocated memory is still 307.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:30,694 INFO ]: Boogie Preprocessor took 47.01 ms. Allocated memory is still 307.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:30,694 INFO ]: RCFGBuilder took 419.58 ms. Allocated memory is still 307.8 MB. Free memory was 256.2 MB in the beginning and 244.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:44:30,695 INFO ]: TraceAbstraction took 26945.43 ms. Allocated memory was 307.8 MB in the beginning and 640.2 MB in the end (delta: 332.4 MB). Free memory was 244.2 MB in the beginning and 617.7 MB in the end (delta: -373.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:44:30,697 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 307.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 54.95 ms. Allocated memory is still 307.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.01 ms. Allocated memory is still 307.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 419.58 ms. Allocated memory is still 307.8 MB. Free memory was 256.2 MB in the beginning and 244.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 26945.43 ms. Allocated memory was 307.8 MB in the beginning and 640.2 MB in the end (delta: 332.4 MB). Free memory was 244.2 MB in the beginning and 617.7 MB in the end (delta: -373.5 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. SAFE Result, 26.8s OverallTime, 36 OverallIterations, 5 TraceHistogramMax, 13.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 864 SDtfs, 295 SDslu, 2772 SDs, 0 SdLazy, 6872 SolverSat, 697 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 879 GetRequests, 417 SyntacticMatches, 55 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=34, 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.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 805 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 1038 NumberOfCodeBlocks, 1032 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 976 ConstructedInterpolants, 2 QuantifiedInterpolants, 95784 SizeOfPredicates, 239 NumberOfNonLiveVariables, 2726 ConjunctsInSsa, 952 ConjunctsInUnsatCore, 62 InterpolantComputations, 11 PerfectInterpolantSequences, 398/649 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__memrchr_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-44-30-706.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__memrchr_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-44-30-706.csv Received shutdown request...