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__strcspn.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:44:56,545 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:44:56,547 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:44:56,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:44:56,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:44:56,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:44:56,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:44:56,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:44:56,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:44:56,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:44:56,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:44:56,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:44:56,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:44:56,581 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:44:56,582 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:44:56,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:44:56,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:44:56,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:44:56,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:44:56,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:44:56,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:44:56,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:44:56,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:44:56,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:44:56,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:44:56,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:44:56,606 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:44:56,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:44:56,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:44:56,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:44:56,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:44:56,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:44:56,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:44:56,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:44:56,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:44:56,611 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:56,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:44:56,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:44:56,627 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:44:56,627 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:44:56,628 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:44:56,628 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:44:56,628 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:44:56,629 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:44:56,629 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:44:56,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:44:56,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:44:56,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:44:56,630 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:44:56,630 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:44:56,630 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:44:56,630 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:44:56,630 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:44:56,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:44:56,631 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:44:56,632 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:44:56,632 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:44:56,671 INFO ]: Repository-Root is: /tmp [2018-06-22 11:44:56,690 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:44:56,695 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:44:56,696 INFO ]: Initializing SmtParser... [2018-06-22 11:44:56,696 INFO ]: SmtParser initialized [2018-06-22 11:44:56,697 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__strcspn.array.smt2 [2018-06-22 11:44:56,699 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:56,789 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strcspn.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@4da6ca71 [2018-06-22 11:44:57,113 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strcspn.array.smt2 [2018-06-22 11:44:57,118 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:44:57,124 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:44:57,124 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:44:57,124 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:44:57,125 INFO ]: ChcToBoogie initialized [2018-06-22 11:44:57,127 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:44:57" (1/1) ... [2018-06-22 11:44:57,181 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:57 Unit [2018-06-22 11:44:57,181 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:44:57,182 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:44:57,182 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:44:57,182 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:44:57,204 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:57" (1/1) ... [2018-06-22 11:44:57,204 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:57" (1/1) ... [2018-06-22 11:44:57,215 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:57" (1/1) ... [2018-06-22 11:44:57,216 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:57" (1/1) ... [2018-06-22 11:44:57,222 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:57" (1/1) ... [2018-06-22 11:44:57,225 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:57" (1/1) ... [2018-06-22 11:44:57,226 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:57" (1/1) ... [2018-06-22 11:44:57,230 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:44:57,231 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:44:57,231 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:44:57,231 INFO ]: RCFGBuilder initialized [2018-06-22 11:44:57,231 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:57" (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:57,256 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:44:57,256 INFO ]: Found specification of procedure False [2018-06-22 11:44:57,257 INFO ]: Found implementation of procedure False [2018-06-22 11:44:57,257 INFO ]: Specification and implementation of procedure INV_MAIN_0 given in one single declaration [2018-06-22 11:44:57,257 INFO ]: Found specification of procedure INV_MAIN_0 [2018-06-22 11:44:57,257 INFO ]: Found implementation of procedure INV_MAIN_0 [2018-06-22 11:44:57,257 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 11:44:57,257 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 11:44:57,257 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 11:44:57,257 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:44:57,257 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:44:57,257 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:57,836 INFO ]: Using library mode [2018-06-22 11:44:57,837 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:44:57 BoogieIcfgContainer [2018-06-22 11:44:57,837 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:44:57,840 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:44:57,840 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:44:57,843 INFO ]: TraceAbstraction initialized [2018-06-22 11:44:57,843 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:44:57" (1/3) ... [2018-06-22 11:44:57,844 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f65e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:44:57, skipping insertion in model container [2018-06-22 11:44:57,844 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:57" (2/3) ... [2018-06-22 11:44:57,844 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f65e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:44:57, skipping insertion in model container [2018-06-22 11:44:57,844 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:44:57" (3/3) ... [2018-06-22 11:44:57,847 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:44:57,856 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:44:57,866 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:44:57,902 INFO ]: Using default assertion order modulation [2018-06-22 11:44:57,902 INFO ]: Interprodecural is true [2018-06-22 11:44:57,902 INFO ]: Hoare is false [2018-06-22 11:44:57,902 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:44:57,902 INFO ]: Backedges is TWOTRACK [2018-06-22 11:44:57,903 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:44:57,903 INFO ]: Difference is false [2018-06-22 11:44:57,903 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:44:57,903 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:44:57,917 INFO ]: Start isEmpty. Operand 35 states. [2018-06-22 11:44:57,935 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:57,935 INFO ]: Found error trace [2018-06-22 11:44:57,937 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:57,937 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:57,943 INFO ]: Analyzing trace with hash -1341492126, now seen corresponding path program 1 times [2018-06-22 11:44:57,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:57,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:57,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:57,980 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:57,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:58,025 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:58,131 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:58,132 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:58,132 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:58,134 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:58,144 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:58,145 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:58,146 INFO ]: Start difference. First operand 35 states. Second operand 4 states. [2018-06-22 11:44:58,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:58,571 INFO ]: Finished difference Result 35 states and 77 transitions. [2018-06-22 11:44:58,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:58,572 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:58,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:58,583 INFO ]: With dead ends: 35 [2018-06-22 11:44:58,583 INFO ]: Without dead ends: 35 [2018-06-22 11:44:58,585 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:58,598 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:44:58,634 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:44:58,635 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:44:58,637 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 75 transitions. [2018-06-22 11:44:58,638 INFO ]: Start accepts. Automaton has 33 states and 75 transitions. Word has length 9 [2018-06-22 11:44:58,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:58,639 INFO ]: Abstraction has 33 states and 75 transitions. [2018-06-22 11:44:58,639 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:58,639 INFO ]: Start isEmpty. Operand 33 states and 75 transitions. [2018-06-22 11:44:58,643 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:58,644 INFO ]: Found error trace [2018-06-22 11:44:58,644 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:58,644 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:58,644 INFO ]: Analyzing trace with hash 1550890385, now seen corresponding path program 1 times [2018-06-22 11:44:58,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:58,644 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:58,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:58,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:58,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:58,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:58,760 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:58,760 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:58,760 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:58,761 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:58,761 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:58,761 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:58,762 INFO ]: Start difference. First operand 33 states and 75 transitions. Second operand 4 states. [2018-06-22 11:44:59,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:59,040 INFO ]: Finished difference Result 35 states and 76 transitions. [2018-06-22 11:44:59,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:59,054 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:59,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:59,056 INFO ]: With dead ends: 35 [2018-06-22 11:44:59,056 INFO ]: Without dead ends: 35 [2018-06-22 11:44:59,057 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:59,057 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:44:59,066 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:44:59,067 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:44:59,068 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 74 transitions. [2018-06-22 11:44:59,068 INFO ]: Start accepts. Automaton has 33 states and 74 transitions. Word has length 9 [2018-06-22 11:44:59,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:59,068 INFO ]: Abstraction has 33 states and 74 transitions. [2018-06-22 11:44:59,068 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:59,068 INFO ]: Start isEmpty. Operand 33 states and 74 transitions. [2018-06-22 11:44:59,071 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:59,071 INFO ]: Found error trace [2018-06-22 11:44:59,071 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:59,071 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:59,072 INFO ]: Analyzing trace with hash 148305600, now seen corresponding path program 1 times [2018-06-22 11:44:59,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:59,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:59,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:59,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:59,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:59,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:59,226 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:59,226 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:59,226 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:59,227 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:59,227 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:59,227 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:59,227 INFO ]: Start difference. First operand 33 states and 74 transitions. Second operand 4 states. [2018-06-22 11:44:59,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:59,565 INFO ]: Finished difference Result 35 states and 75 transitions. [2018-06-22 11:44:59,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:59,566 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:59,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:59,567 INFO ]: With dead ends: 35 [2018-06-22 11:44:59,567 INFO ]: Without dead ends: 35 [2018-06-22 11:44:59,567 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:59,568 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:44:59,576 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:44:59,577 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:44:59,578 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 73 transitions. [2018-06-22 11:44:59,578 INFO ]: Start accepts. Automaton has 33 states and 73 transitions. Word has length 9 [2018-06-22 11:44:59,578 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:59,578 INFO ]: Abstraction has 33 states and 73 transitions. [2018-06-22 11:44:59,578 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:59,578 INFO ]: Start isEmpty. Operand 33 states and 73 transitions. [2018-06-22 11:44:59,581 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:59,581 INFO ]: Found error trace [2018-06-22 11:44:59,581 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:59,581 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:59,581 INFO ]: Analyzing trace with hash 557691901, now seen corresponding path program 1 times [2018-06-22 11:44:59,581 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:59,581 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:59,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:59,582 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:59,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:59,586 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:59,845 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:59,845 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:59,845 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:59,845 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:59,845 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:59,845 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:59,845 INFO ]: Start difference. First operand 33 states and 73 transitions. Second operand 4 states. [2018-06-22 11:45:00,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:00,102 INFO ]: Finished difference Result 35 states and 74 transitions. [2018-06-22 11:45:00,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:00,104 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:00,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:00,105 INFO ]: With dead ends: 35 [2018-06-22 11:45:00,105 INFO ]: Without dead ends: 35 [2018-06-22 11:45:00,105 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:00,105 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:45:00,115 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:45:00,115 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:45:00,116 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 72 transitions. [2018-06-22 11:45:00,116 INFO ]: Start accepts. Automaton has 33 states and 72 transitions. Word has length 9 [2018-06-22 11:45:00,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:00,116 INFO ]: Abstraction has 33 states and 72 transitions. [2018-06-22 11:45:00,116 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:00,116 INFO ]: Start isEmpty. Operand 33 states and 72 transitions. [2018-06-22 11:45:00,118 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:00,118 INFO ]: Found error trace [2018-06-22 11:45:00,118 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:00,119 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:00,119 INFO ]: Analyzing trace with hash -844892884, now seen corresponding path program 1 times [2018-06-22 11:45:00,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:00,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:00,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:00,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,123 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:00,170 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:45:00,170 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:00,170 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:00,170 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:00,170 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:00,170 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:00,171 INFO ]: Start difference. First operand 33 states and 72 transitions. Second operand 4 states. [2018-06-22 11:45:00,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:00,260 INFO ]: Finished difference Result 35 states and 73 transitions. [2018-06-22 11:45:00,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:00,261 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:00,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:00,262 INFO ]: With dead ends: 35 [2018-06-22 11:45:00,262 INFO ]: Without dead ends: 35 [2018-06-22 11:45:00,263 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:00,263 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:45:00,269 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:45:00,269 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:45:00,270 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 71 transitions. [2018-06-22 11:45:00,270 INFO ]: Start accepts. Automaton has 33 states and 71 transitions. Word has length 9 [2018-06-22 11:45:00,270 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:00,270 INFO ]: Abstraction has 33 states and 71 transitions. [2018-06-22 11:45:00,270 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:00,270 INFO ]: Start isEmpty. Operand 33 states and 71 transitions. [2018-06-22 11:45:00,272 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:00,272 INFO ]: Found error trace [2018-06-22 11:45:00,272 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:00,272 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:00,273 INFO ]: Analyzing trace with hash 2047489627, now seen corresponding path program 1 times [2018-06-22 11:45:00,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:00,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:00,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:00,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:00,415 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:45:00,415 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:00,415 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:00,415 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:00,415 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:00,416 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:00,416 INFO ]: Start difference. First operand 33 states and 71 transitions. Second operand 4 states. [2018-06-22 11:45:00,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:00,571 INFO ]: Finished difference Result 35 states and 72 transitions. [2018-06-22 11:45:00,574 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:00,574 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:00,574 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:00,575 INFO ]: With dead ends: 35 [2018-06-22 11:45:00,575 INFO ]: Without dead ends: 35 [2018-06-22 11:45:00,575 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:45:00,575 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:45:00,584 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:45:00,584 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:45:00,585 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 70 transitions. [2018-06-22 11:45:00,585 INFO ]: Start accepts. Automaton has 33 states and 70 transitions. Word has length 9 [2018-06-22 11:45:00,585 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:00,585 INFO ]: Abstraction has 33 states and 70 transitions. [2018-06-22 11:45:00,585 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:00,585 INFO ]: Start isEmpty. Operand 33 states and 70 transitions. [2018-06-22 11:45:00,587 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:00,587 INFO ]: Found error trace [2018-06-22 11:45:00,587 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:00,587 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:00,587 INFO ]: Analyzing trace with hash -1750878427, now seen corresponding path program 1 times [2018-06-22 11:45:00,587 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:00,587 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:00,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:00,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,591 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:00,626 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:45:00,627 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:00,627 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:00,627 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:00,627 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:00,627 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:00,627 INFO ]: Start difference. First operand 33 states and 70 transitions. Second operand 4 states. [2018-06-22 11:45:00,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:00,732 INFO ]: Finished difference Result 37 states and 83 transitions. [2018-06-22 11:45:00,734 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:00,734 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:00,734 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:00,735 INFO ]: With dead ends: 37 [2018-06-22 11:45:00,735 INFO ]: Without dead ends: 37 [2018-06-22 11:45:00,735 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:00,735 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:45:00,741 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 11:45:00,741 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:45:00,742 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 81 transitions. [2018-06-22 11:45:00,742 INFO ]: Start accepts. Automaton has 35 states and 81 transitions. Word has length 9 [2018-06-22 11:45:00,743 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:00,743 INFO ]: Abstraction has 35 states and 81 transitions. [2018-06-22 11:45:00,743 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:00,743 INFO ]: Start isEmpty. Operand 35 states and 81 transitions. [2018-06-22 11:45:00,744 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:00,744 INFO ]: Found error trace [2018-06-22 11:45:00,744 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:00,744 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:00,745 INFO ]: Analyzing trace with hash 1980917370, now seen corresponding path program 1 times [2018-06-22 11:45:00,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:00,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:00,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,745 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:00,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:00,815 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:00,815 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:00,815 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:00,815 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:00,815 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:00,815 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:00,815 INFO ]: Start difference. First operand 35 states and 81 transitions. Second operand 4 states. [2018-06-22 11:45:00,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:00,968 INFO ]: Finished difference Result 46 states and 112 transitions. [2018-06-22 11:45:00,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:00,968 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:45:00,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:00,970 INFO ]: With dead ends: 46 [2018-06-22 11:45:00,970 INFO ]: Without dead ends: 46 [2018-06-22 11:45:00,970 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:00,970 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:45:00,980 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-06-22 11:45:00,980 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:45:00,981 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 110 transitions. [2018-06-22 11:45:00,981 INFO ]: Start accepts. Automaton has 44 states and 110 transitions. Word has length 13 [2018-06-22 11:45:00,982 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:00,982 INFO ]: Abstraction has 44 states and 110 transitions. [2018-06-22 11:45:00,982 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:00,982 INFO ]: Start isEmpty. Operand 44 states and 110 transitions. [2018-06-22 11:45:00,983 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:00,983 INFO ]: Found error trace [2018-06-22 11:45:00,983 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:00,983 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:00,983 INFO ]: Analyzing trace with hash -2058695895, now seen corresponding path program 1 times [2018-06-22 11:45:00,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:00,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:00,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:00,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,990 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:01,017 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:01,017 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:01,017 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:01,017 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:01,017 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:01,017 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:01,017 INFO ]: Start difference. First operand 44 states and 110 transitions. Second operand 4 states. [2018-06-22 11:45:01,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:01,196 INFO ]: Finished difference Result 46 states and 110 transitions. [2018-06-22 11:45:01,197 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:01,197 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:45:01,197 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:01,198 INFO ]: With dead ends: 46 [2018-06-22 11:45:01,198 INFO ]: Without dead ends: 46 [2018-06-22 11:45:01,199 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:01,199 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:45:01,208 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-06-22 11:45:01,208 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:45:01,214 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 108 transitions. [2018-06-22 11:45:01,215 INFO ]: Start accepts. Automaton has 44 states and 108 transitions. Word has length 13 [2018-06-22 11:45:01,215 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:01,215 INFO ]: Abstraction has 44 states and 108 transitions. [2018-06-22 11:45:01,215 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:01,215 INFO ]: Start isEmpty. Operand 44 states and 108 transitions. [2018-06-22 11:45:01,216 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:01,216 INFO ]: Found error trace [2018-06-22 11:45:01,216 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:01,216 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:01,216 INFO ]: Analyzing trace with hash -967512171, now seen corresponding path program 1 times [2018-06-22 11:45:01,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:01,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:01,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:01,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:01,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:01,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:01,247 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:01,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:01,247 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:01,247 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:01,248 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:01,248 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:01,248 INFO ]: Start difference. First operand 44 states and 108 transitions. Second operand 4 states. [2018-06-22 11:45:01,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:01,361 INFO ]: Finished difference Result 46 states and 108 transitions. [2018-06-22 11:45:01,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:01,361 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:45:01,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:01,362 INFO ]: With dead ends: 46 [2018-06-22 11:45:01,362 INFO ]: Without dead ends: 46 [2018-06-22 11:45:01,363 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:01,363 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:45:01,370 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-06-22 11:45:01,370 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:45:01,371 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 106 transitions. [2018-06-22 11:45:01,371 INFO ]: Start accepts. Automaton has 44 states and 106 transitions. Word has length 13 [2018-06-22 11:45:01,371 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:01,371 INFO ]: Abstraction has 44 states and 106 transitions. [2018-06-22 11:45:01,371 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:01,371 INFO ]: Start isEmpty. Operand 44 states and 106 transitions. [2018-06-22 11:45:01,372 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:01,372 INFO ]: Found error trace [2018-06-22 11:45:01,372 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:01,372 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:01,373 INFO ]: Analyzing trace with hash -712158140, now seen corresponding path program 1 times [2018-06-22 11:45:01,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:01,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:01,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:01,373 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:01,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:01,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:01,425 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:45:01,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:01,425 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:45:01,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:01,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:01,450 INFO ]: Computing forward predicates... [2018-06-22 11:45:01,475 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:45:01,495 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:01,495 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:01,495 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:01,495 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:01,495 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:01,495 INFO ]: Start difference. First operand 44 states and 106 transitions. Second operand 6 states. [2018-06-22 11:45:01,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:01,978 INFO ]: Finished difference Result 57 states and 138 transitions. [2018-06-22 11:45:01,978 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:01,978 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:01,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:01,980 INFO ]: With dead ends: 57 [2018-06-22 11:45:01,980 INFO ]: Without dead ends: 57 [2018-06-22 11:45:01,981 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:01,981 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:45:01,992 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-22 11:45:01,992 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:45:01,993 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 136 transitions. [2018-06-22 11:45:01,993 INFO ]: Start accepts. Automaton has 55 states and 136 transitions. Word has length 13 [2018-06-22 11:45:01,993 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:01,993 INFO ]: Abstraction has 55 states and 136 transitions. [2018-06-22 11:45:01,993 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:01,993 INFO ]: Start isEmpty. Operand 55 states and 136 transitions. [2018-06-22 11:45:01,995 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:01,995 INFO ]: Found error trace [2018-06-22 11:45:01,995 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:01,995 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:01,995 INFO ]: Analyzing trace with hash -1803341864, now seen corresponding path program 1 times [2018-06-22 11:45:01,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:01,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:01,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:01,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:01,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:02,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:02,081 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:45:02,081 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:02,081 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:45:02,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:02,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:02,110 INFO ]: Computing forward predicates... [2018-06-22 11:45:02,134 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:45:02,154 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:02,154 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:02,154 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:02,154 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:02,154 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:02,155 INFO ]: Start difference. First operand 55 states and 136 transitions. Second operand 6 states. [2018-06-22 11:45:02,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:02,461 INFO ]: Finished difference Result 57 states and 132 transitions. [2018-06-22 11:45:02,461 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:02,461 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:02,461 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:02,462 INFO ]: With dead ends: 57 [2018-06-22 11:45:02,462 INFO ]: Without dead ends: 57 [2018-06-22 11:45:02,462 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:02,462 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:45:02,476 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-22 11:45:02,476 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:45:02,477 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 130 transitions. [2018-06-22 11:45:02,477 INFO ]: Start accepts. Automaton has 55 states and 130 transitions. Word has length 13 [2018-06-22 11:45:02,477 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:02,477 INFO ]: Abstraction has 55 states and 130 transitions. [2018-06-22 11:45:02,477 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:02,477 INFO ]: Start isEmpty. Operand 55 states and 130 transitions. [2018-06-22 11:45:02,479 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:02,479 INFO ]: Found error trace [2018-06-22 11:45:02,479 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:02,479 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:02,479 INFO ]: Analyzing trace with hash -456804109, now seen corresponding path program 1 times [2018-06-22 11:45:02,479 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:02,479 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:02,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:02,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:02,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:02,486 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:02,513 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:02,513 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:02,513 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:02,513 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:02,513 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:02,513 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:02,514 INFO ]: Start difference. First operand 55 states and 130 transitions. Second operand 4 states. [2018-06-22 11:45:02,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:02,723 INFO ]: Finished difference Result 57 states and 129 transitions. [2018-06-22 11:45:02,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:02,723 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:45:02,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:02,724 INFO ]: With dead ends: 57 [2018-06-22 11:45:02,724 INFO ]: Without dead ends: 57 [2018-06-22 11:45:02,725 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:02,725 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:45:02,737 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-06-22 11:45:02,737 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:45:02,741 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 127 transitions. [2018-06-22 11:45:02,741 INFO ]: Start accepts. Automaton has 55 states and 127 transitions. Word has length 13 [2018-06-22 11:45:02,741 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:02,741 INFO ]: Abstraction has 55 states and 127 transitions. [2018-06-22 11:45:02,741 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:02,741 INFO ]: Start isEmpty. Operand 55 states and 127 transitions. [2018-06-22 11:45:02,742 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:02,742 INFO ]: Found error trace [2018-06-22 11:45:02,742 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:02,742 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:02,742 INFO ]: Analyzing trace with hash 459110791, now seen corresponding path program 1 times [2018-06-22 11:45:02,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:02,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:02,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:02,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:02,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:02,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:03,077 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:45:03,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:03,077 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:45:03,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:03,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:03,117 INFO ]: Computing forward predicates... [2018-06-22 11:45:03,137 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:45:03,162 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:45:03,162 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:45:03,163 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:03,163 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:03,163 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:03,163 INFO ]: Start difference. First operand 55 states and 127 transitions. Second operand 8 states. [2018-06-22 11:45:03,579 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:03,579 INFO ]: Finished difference Result 61 states and 134 transitions. [2018-06-22 11:45:03,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:45:03,579 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:45:03,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:03,580 INFO ]: With dead ends: 61 [2018-06-22 11:45:03,580 INFO ]: Without dead ends: 61 [2018-06-22 11:45:03,580 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:03,580 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:45:03,586 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-06-22 11:45:03,586 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:45:03,587 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 125 transitions. [2018-06-22 11:45:03,587 INFO ]: Start accepts. Automaton has 55 states and 125 transitions. Word has length 13 [2018-06-22 11:45:03,588 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:03,588 INFO ]: Abstraction has 55 states and 125 transitions. [2018-06-22 11:45:03,588 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:03,588 INFO ]: Start isEmpty. Operand 55 states and 125 transitions. [2018-06-22 11:45:03,589 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:03,589 INFO ]: Found error trace [2018-06-22 11:45:03,589 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:03,589 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:03,589 INFO ]: Analyzing trace with hash -1978610688, now seen corresponding path program 1 times [2018-06-22 11:45:03,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:03,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:03,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:03,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:03,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:03,595 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:03,638 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:03,638 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:03,638 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:03,638 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:03,638 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:03,638 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:03,638 INFO ]: Start difference. First operand 55 states and 125 transitions. Second operand 4 states. [2018-06-22 11:45:03,695 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:03,696 INFO ]: Finished difference Result 61 states and 130 transitions. [2018-06-22 11:45:03,696 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:03,696 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:45:03,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:03,697 INFO ]: With dead ends: 61 [2018-06-22 11:45:03,697 INFO ]: Without dead ends: 61 [2018-06-22 11:45:03,697 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:03,697 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:45:03,704 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-06-22 11:45:03,704 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:45:03,705 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 128 transitions. [2018-06-22 11:45:03,705 INFO ]: Start accepts. Automaton has 59 states and 128 transitions. Word has length 13 [2018-06-22 11:45:03,705 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:03,705 INFO ]: Abstraction has 59 states and 128 transitions. [2018-06-22 11:45:03,705 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:03,705 INFO ]: Start isEmpty. Operand 59 states and 128 transitions. [2018-06-22 11:45:03,706 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:03,706 INFO ]: Found error trace [2018-06-22 11:45:03,706 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:03,706 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:03,706 INFO ]: Analyzing trace with hash 1305639416, now seen corresponding path program 1 times [2018-06-22 11:45:03,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:03,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:03,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:03,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:03,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:03,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:03,949 WARN ]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 11:45: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:45:03,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:03,968 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:45:03,968 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:03,969 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:03,969 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:03,969 INFO ]: Start difference. First operand 59 states and 128 transitions. Second operand 6 states. [2018-06-22 11:45:04,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:04,089 INFO ]: Finished difference Result 73 states and 181 transitions. [2018-06-22 11:45:04,090 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:04,090 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:04,090 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:04,091 INFO ]: With dead ends: 73 [2018-06-22 11:45:04,091 INFO ]: Without dead ends: 73 [2018-06-22 11:45:04,091 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:04,091 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 11:45:04,100 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-06-22 11:45:04,100 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:45:04,101 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 168 transitions. [2018-06-22 11:45:04,101 INFO ]: Start accepts. Automaton has 69 states and 168 transitions. Word has length 13 [2018-06-22 11:45:04,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:04,101 INFO ]: Abstraction has 69 states and 168 transitions. [2018-06-22 11:45:04,101 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:04,101 INFO ]: Start isEmpty. Operand 69 states and 168 transitions. [2018-06-22 11:45:04,102 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:04,102 INFO ]: Found error trace [2018-06-22 11:45:04,102 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:04,103 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:04,103 INFO ]: Analyzing trace with hash 214455692, now seen corresponding path program 1 times [2018-06-22 11:45:04,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:04,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:04,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:04,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:04,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:04,111 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:04,179 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:45:04,179 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:04,179 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:45:04,179 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:04,179 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:04,179 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:04,179 INFO ]: Start difference. First operand 69 states and 168 transitions. Second operand 6 states. [2018-06-22 11:45:04,397 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:04,397 INFO ]: Finished difference Result 79 states and 204 transitions. [2018-06-22 11:45:04,397 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:45:04,397 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:04,397 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:04,398 INFO ]: With dead ends: 79 [2018-06-22 11:45:04,398 INFO ]: Without dead ends: 79 [2018-06-22 11:45:04,398 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:04,398 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:45:04,405 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-06-22 11:45:04,405 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:45:04,406 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 191 transitions. [2018-06-22 11:45:04,406 INFO ]: Start accepts. Automaton has 75 states and 191 transitions. Word has length 13 [2018-06-22 11:45:04,406 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:04,406 INFO ]: Abstraction has 75 states and 191 transitions. [2018-06-22 11:45:04,406 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:04,406 INFO ]: Start isEmpty. Operand 75 states and 191 transitions. [2018-06-22 11:45:04,408 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:04,408 INFO ]: Found error trace [2018-06-22 11:45:04,408 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:04,408 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:04,408 INFO ]: Analyzing trace with hash 536765916, now seen corresponding path program 1 times [2018-06-22 11:45:04,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:04,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:04,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:04,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:04,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:04,415 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:04,483 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:45:04,483 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:04,483 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:45:04,483 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:04,483 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:04,483 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:04,483 INFO ]: Start difference. First operand 75 states and 191 transitions. Second operand 6 states. [2018-06-22 11:45:04,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:04,694 INFO ]: Finished difference Result 79 states and 202 transitions. [2018-06-22 11:45:04,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:04,694 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:04,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:04,695 INFO ]: With dead ends: 79 [2018-06-22 11:45:04,695 INFO ]: Without dead ends: 79 [2018-06-22 11:45:04,695 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:04,696 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:45:04,703 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-06-22 11:45:04,704 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:45:04,705 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 189 transitions. [2018-06-22 11:45:04,705 INFO ]: Start accepts. Automaton has 75 states and 189 transitions. Word has length 13 [2018-06-22 11:45:04,705 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:04,705 INFO ]: Abstraction has 75 states and 189 transitions. [2018-06-22 11:45:04,705 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:04,705 INFO ]: Start isEmpty. Operand 75 states and 189 transitions. [2018-06-22 11:45:04,707 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:04,707 INFO ]: Found error trace [2018-06-22 11:45:04,707 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:04,707 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:04,707 INFO ]: Analyzing trace with hash -1365783772, now seen corresponding path program 1 times [2018-06-22 11:45:04,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:04,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:04,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:04,708 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:04,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:04,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:04,833 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:04,833 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:04,833 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:04,833 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:04,833 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:04,833 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:04,834 INFO ]: Start difference. First operand 75 states and 189 transitions. Second operand 4 states. [2018-06-22 11:45:04,977 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:04,977 INFO ]: Finished difference Result 67 states and 151 transitions. [2018-06-22 11:45:04,977 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:04,978 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:45:04,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:04,978 INFO ]: With dead ends: 67 [2018-06-22 11:45:04,978 INFO ]: Without dead ends: 49 [2018-06-22 11:45:04,979 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:45:04,979 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:45:04,983 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-22 11:45:04,983 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:45:04,984 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 112 transitions. [2018-06-22 11:45:04,984 INFO ]: Start accepts. Automaton has 49 states and 112 transitions. Word has length 17 [2018-06-22 11:45:04,984 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:04,984 INFO ]: Abstraction has 49 states and 112 transitions. [2018-06-22 11:45:04,984 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:04,984 INFO ]: Start isEmpty. Operand 49 states and 112 transitions. [2018-06-22 11:45:04,986 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:04,986 INFO ]: Found error trace [2018-06-22 11:45:04,986 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:04,986 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:04,986 INFO ]: Analyzing trace with hash 761941745, now seen corresponding path program 1 times [2018-06-22 11:45:04,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:04,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:04,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:04,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:04,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:04,992 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:05,047 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:05,047 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:05,047 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:05,047 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:05,047 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:05,047 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:05,047 INFO ]: Start difference. First operand 49 states and 112 transitions. Second operand 4 states. [2018-06-22 11:45:05,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:05,095 INFO ]: Finished difference Result 45 states and 95 transitions. [2018-06-22 11:45:05,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:05,095 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:45:05,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:05,096 INFO ]: With dead ends: 45 [2018-06-22 11:45:05,096 INFO ]: Without dead ends: 38 [2018-06-22 11:45:05,096 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:05,097 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:45:05,100 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 11:45:05,100 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:45:05,101 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 85 transitions. [2018-06-22 11:45:05,101 INFO ]: Start accepts. Automaton has 38 states and 85 transitions. Word has length 17 [2018-06-22 11:45:05,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:05,101 INFO ]: Abstraction has 38 states and 85 transitions. [2018-06-22 11:45:05,101 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:05,101 INFO ]: Start isEmpty. Operand 38 states and 85 transitions. [2018-06-22 11:45:05,102 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:05,102 INFO ]: Found error trace [2018-06-22 11:45:05,102 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:05,102 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:05,102 INFO ]: Analyzing trace with hash -190302453, now seen corresponding path program 1 times [2018-06-22 11:45:05,102 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:05,102 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:05,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:05,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:05,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:05,112 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:05,244 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:45:05,244 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:05,244 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:45:05,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:05,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:05,270 INFO ]: Computing forward predicates... [2018-06-22 11:45:05,431 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:45:05,463 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:05,463 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:45:05,463 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:45:05,463 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:45:05,463 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:05,463 INFO ]: Start difference. First operand 38 states and 85 transitions. Second operand 11 states. [2018-06-22 11:45:05,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:05,972 INFO ]: Finished difference Result 50 states and 123 transitions. [2018-06-22 11:45:05,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:05,972 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:45:05,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:05,973 INFO ]: With dead ends: 50 [2018-06-22 11:45:05,973 INFO ]: Without dead ends: 50 [2018-06-22 11:45:05,973 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:05,973 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:45:05,977 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-06-22 11:45:05,977 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:45:05,978 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2018-06-22 11:45:05,978 INFO ]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 17 [2018-06-22 11:45:05,978 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:05,978 INFO ]: Abstraction has 42 states and 98 transitions. [2018-06-22 11:45:05,978 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:45:05,978 INFO ]: Start isEmpty. Operand 42 states and 98 transitions. [2018-06-22 11:45:05,979 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:05,979 INFO ]: Found error trace [2018-06-22 11:45:05,979 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:05,979 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:05,979 INFO ]: Analyzing trace with hash 1047324006, now seen corresponding path program 1 times [2018-06-22 11:45:05,980 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:05,980 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:05,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:05,980 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:05,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:05,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:06,149 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:45:06,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:06,149 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:45:06,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:06,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:06,187 INFO ]: Computing forward predicates... [2018-06-22 11:45:06,250 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:45:06,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:06,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:45:06,283 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:45:06,283 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:45:06,283 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:06,283 INFO ]: Start difference. First operand 42 states and 98 transitions. Second operand 11 states. [2018-06-22 11:45:06,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:06,855 INFO ]: Finished difference Result 52 states and 129 transitions. [2018-06-22 11:45:06,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:06,856 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:45:06,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:06,857 INFO ]: With dead ends: 52 [2018-06-22 11:45:06,857 INFO ]: Without dead ends: 52 [2018-06-22 11:45:06,857 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:06,857 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:45:06,861 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-06-22 11:45:06,861 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:45:06,862 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 104 transitions. [2018-06-22 11:45:06,862 INFO ]: Start accepts. Automaton has 44 states and 104 transitions. Word has length 17 [2018-06-22 11:45:06,862 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:06,862 INFO ]: Abstraction has 44 states and 104 transitions. [2018-06-22 11:45:06,862 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:45:06,862 INFO ]: Start isEmpty. Operand 44 states and 104 transitions. [2018-06-22 11:45:06,863 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:06,863 INFO ]: Found error trace [2018-06-22 11:45:06,863 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:06,863 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:06,863 INFO ]: Analyzing trace with hash 308642599, now seen corresponding path program 1 times [2018-06-22 11:45:06,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:06,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:06,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:06,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:06,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:06,872 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:07,315 WARN ]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 11:45:07,532 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 11:45:07,818 WARN ]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-22 11:45:07,839 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:45:07,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:07,839 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:45:07,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:07,860 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:07,876 INFO ]: Computing forward predicates... [2018-06-22 11:45:07,948 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:45:07,968 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:07,968 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:45:07,968 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:45:07,968 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:45:07,968 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:07,968 INFO ]: Start difference. First operand 44 states and 104 transitions. Second operand 11 states. [2018-06-22 11:45:08,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:08,202 INFO ]: Finished difference Result 52 states and 128 transitions. [2018-06-22 11:45:08,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:08,202 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:45:08,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:08,202 INFO ]: With dead ends: 52 [2018-06-22 11:45:08,202 INFO ]: Without dead ends: 52 [2018-06-22 11:45:08,203 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:08,203 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:45:08,207 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-06-22 11:45:08,207 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:45:08,208 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 103 transitions. [2018-06-22 11:45:08,208 INFO ]: Start accepts. Automaton has 44 states and 103 transitions. Word has length 17 [2018-06-22 11:45:08,208 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:08,208 INFO ]: Abstraction has 44 states and 103 transitions. [2018-06-22 11:45:08,208 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:45:08,208 INFO ]: Start isEmpty. Operand 44 states and 103 transitions. [2018-06-22 11:45:08,209 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:08,209 INFO ]: Found error trace [2018-06-22 11:45:08,209 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:08,209 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:08,209 INFO ]: Analyzing trace with hash 288226775, now seen corresponding path program 1 times [2018-06-22 11:45:08,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:08,209 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:08,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:08,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:08,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:08,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:08,277 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:45:08,277 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:08,277 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:45:08,277 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:08,278 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:08,278 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:08,278 INFO ]: Start difference. First operand 44 states and 103 transitions. Second operand 7 states. [2018-06-22 11:45:08,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:08,491 INFO ]: Finished difference Result 44 states and 99 transitions. [2018-06-22 11:45:08,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:08,495 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:08,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:08,496 INFO ]: With dead ends: 44 [2018-06-22 11:45:08,496 INFO ]: Without dead ends: 42 [2018-06-22 11:45:08,496 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:08,496 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:45:08,499 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:45:08,499 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:45:08,500 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 95 transitions. [2018-06-22 11:45:08,500 INFO ]: Start accepts. Automaton has 42 states and 95 transitions. Word has length 17 [2018-06-22 11:45:08,500 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:08,500 INFO ]: Abstraction has 42 states and 95 transitions. [2018-06-22 11:45:08,500 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:08,500 INFO ]: Start isEmpty. Operand 42 states and 95 transitions. [2018-06-22 11:45:08,501 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:08,501 INFO ]: Found error trace [2018-06-22 11:45:08,501 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:08,501 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:08,501 INFO ]: Analyzing trace with hash -2010016831, now seen corresponding path program 1 times [2018-06-22 11:45:08,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:08,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:08,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:08,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:08,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:08,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:08,619 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:45:08,619 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:08,619 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:45:08,625 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:08,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:08,649 INFO ]: Computing forward predicates... [2018-06-22 11:45:08,774 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:45:08,794 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:08,794 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:45:08,794 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:45:08,794 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:45:08,794 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:08,794 INFO ]: Start difference. First operand 42 states and 95 transitions. Second operand 11 states. [2018-06-22 11:45:09,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:09,133 INFO ]: Finished difference Result 58 states and 146 transitions. [2018-06-22 11:45:09,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:09,133 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:45:09,134 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:09,134 INFO ]: With dead ends: 58 [2018-06-22 11:45:09,134 INFO ]: Without dead ends: 58 [2018-06-22 11:45:09,134 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:09,134 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:45:09,140 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-06-22 11:45:09,140 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:45:09,141 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 108 transitions. [2018-06-22 11:45:09,141 INFO ]: Start accepts. Automaton has 46 states and 108 transitions. Word has length 17 [2018-06-22 11:45:09,141 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:09,141 INFO ]: Abstraction has 46 states and 108 transitions. [2018-06-22 11:45:09,141 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:45:09,141 INFO ]: Start isEmpty. Operand 46 states and 108 transitions. [2018-06-22 11:45:09,142 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:09,142 INFO ]: Found error trace [2018-06-22 11:45:09,142 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:09,142 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:09,142 INFO ]: Analyzing trace with hash -1511071779, now seen corresponding path program 1 times [2018-06-22 11:45:09,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:09,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:09,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:09,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:09,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:09,151 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:09,582 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 11:45:09,936 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:45:09,936 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:09,936 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) [2018-06-22 11:45:09,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:09,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:09,967 INFO ]: Computing forward predicates... [2018-06-22 11:45:10,049 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:45:10,068 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:10,068 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:45:10,068 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:45:10,069 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:45:10,069 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:45:10,069 INFO ]: Start difference. First operand 46 states and 108 transitions. Second operand 12 states. [2018-06-22 11:45:10,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:10,277 INFO ]: Finished difference Result 58 states and 142 transitions. [2018-06-22 11:45:10,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:10,277 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:45:10,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:10,278 INFO ]: With dead ends: 58 [2018-06-22 11:45:10,278 INFO ]: Without dead ends: 58 [2018-06-22 11:45:10,278 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:10,278 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:45:10,283 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-06-22 11:45:10,283 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:45:10,283 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 106 transitions. [2018-06-22 11:45:10,284 INFO ]: Start accepts. Automaton has 46 states and 106 transitions. Word has length 17 [2018-06-22 11:45:10,284 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:10,284 INFO ]: Abstraction has 46 states and 106 transitions. [2018-06-22 11:45:10,284 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:45:10,284 INFO ]: Start isEmpty. Operand 46 states and 106 transitions. [2018-06-22 11:45:10,285 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:10,285 INFO ]: Found error trace [2018-06-22 11:45:10,285 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:10,285 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:10,285 INFO ]: Analyzing trace with hash -1099250170, now seen corresponding path program 1 times [2018-06-22 11:45:10,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:10,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:10,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:10,286 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:10,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:10,303 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:10,415 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:45:10,415 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:10,415 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:45:10,416 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:10,416 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:10,416 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:10,416 INFO ]: Start difference. First operand 46 states and 106 transitions. Second operand 7 states. [2018-06-22 11:45:10,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:10,534 INFO ]: Finished difference Result 48 states and 112 transitions. [2018-06-22 11:45:10,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:10,535 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:10,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:10,535 INFO ]: With dead ends: 48 [2018-06-22 11:45:10,535 INFO ]: Without dead ends: 47 [2018-06-22 11:45:10,535 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:10,535 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:45:10,541 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-22 11:45:10,541 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:45:10,541 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 102 transitions. [2018-06-22 11:45:10,541 INFO ]: Start accepts. Automaton has 45 states and 102 transitions. Word has length 17 [2018-06-22 11:45:10,542 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:10,542 INFO ]: Abstraction has 45 states and 102 transitions. [2018-06-22 11:45:10,542 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:10,542 INFO ]: Start isEmpty. Operand 45 states and 102 transitions. [2018-06-22 11:45:10,543 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:10,543 INFO ]: Found error trace [2018-06-22 11:45:10,543 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:10,543 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:10,543 INFO ]: Analyzing trace with hash 1808240181, now seen corresponding path program 1 times [2018-06-22 11:45:10,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:10,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:10,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:10,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:10,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:10,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:10,674 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:45:10,674 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:10,674 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:45:10,674 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:10,674 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:10,674 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:10,674 INFO ]: Start difference. First operand 45 states and 102 transitions. Second operand 7 states. [2018-06-22 11:45:10,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:10,947 INFO ]: Finished difference Result 47 states and 108 transitions. [2018-06-22 11:45:10,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:10,947 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:10,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:10,948 INFO ]: With dead ends: 47 [2018-06-22 11:45:10,948 INFO ]: Without dead ends: 46 [2018-06-22 11:45:10,948 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:10,948 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:45:10,952 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-06-22 11:45:10,952 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:45:10,952 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 98 transitions. [2018-06-22 11:45:10,952 INFO ]: Start accepts. Automaton has 44 states and 98 transitions. Word has length 17 [2018-06-22 11:45:10,952 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:10,952 INFO ]: Abstraction has 44 states and 98 transitions. [2018-06-22 11:45:10,952 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:10,952 INFO ]: Start isEmpty. Operand 44 states and 98 transitions. [2018-06-22 11:45:10,953 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:10,953 INFO ]: Found error trace [2018-06-22 11:45:10,953 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:10,953 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:10,953 INFO ]: Analyzing trace with hash -636757855, now seen corresponding path program 1 times [2018-06-22 11:45:10,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:10,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:10,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:10,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:10,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:10,967 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:11,765 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:45:11,765 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:11,765 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:45:11,766 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:11,766 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:11,766 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:11,766 INFO ]: Start difference. First operand 44 states and 98 transitions. Second operand 7 states. [2018-06-22 11:45:13,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:13,066 INFO ]: Finished difference Result 44 states and 96 transitions. [2018-06-22 11:45:13,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:13,068 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:13,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:13,068 INFO ]: With dead ends: 44 [2018-06-22 11:45:13,068 INFO ]: Without dead ends: 43 [2018-06-22 11:45:13,068 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:13,068 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:45:13,071 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-22 11:45:13,072 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:45:13,075 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 94 transitions. [2018-06-22 11:45:13,075 INFO ]: Start accepts. Automaton has 43 states and 94 transitions. Word has length 17 [2018-06-22 11:45:13,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:13,075 INFO ]: Abstraction has 43 states and 94 transitions. [2018-06-22 11:45:13,075 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:13,075 INFO ]: Start isEmpty. Operand 43 states and 94 transitions. [2018-06-22 11:45:13,076 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:13,076 INFO ]: Found error trace [2018-06-22 11:45:13,076 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:13,076 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:13,076 INFO ]: Analyzing trace with hash 1345747866, now seen corresponding path program 1 times [2018-06-22 11:45:13,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:13,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:13,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:13,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:13,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:13,086 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:13,321 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:45:13,321 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:13,321 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:45:13,321 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:45:13,321 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:45:13,321 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:13,321 INFO ]: Start difference. First operand 43 states and 94 transitions. Second operand 5 states. [2018-06-22 11:45:14,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:14,036 INFO ]: Finished difference Result 43 states and 92 transitions. [2018-06-22 11:45:14,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:14,036 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:45:14,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:14,036 INFO ]: With dead ends: 43 [2018-06-22 11:45:14,036 INFO ]: Without dead ends: 42 [2018-06-22 11:45:14,037 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:14,037 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:45:14,038 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:45:14,038 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:45:14,039 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 90 transitions. [2018-06-22 11:45:14,039 INFO ]: Start accepts. Automaton has 42 states and 90 transitions. Word has length 17 [2018-06-22 11:45:14,039 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:14,039 INFO ]: Abstraction has 42 states and 90 transitions. [2018-06-22 11:45:14,039 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:45:14,039 INFO ]: Start isEmpty. Operand 42 states and 90 transitions. [2018-06-22 11:45:14,039 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:14,039 INFO ]: Found error trace [2018-06-22 11:45:14,039 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:14,039 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:14,039 INFO ]: Analyzing trace with hash -2024234800, now seen corresponding path program 1 times [2018-06-22 11:45:14,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:14,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:14,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:14,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:14,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:14,045 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:14,227 WARN ]: Spent 132.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-06-22 11:45:14,261 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:45:14,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:14,261 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:45:14,267 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:14,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:14,287 INFO ]: Computing forward predicates... [2018-06-22 11:45:14,362 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:45:14,381 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:14,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:45:14,381 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:14,381 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:14,381 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:14,382 INFO ]: Start difference. First operand 42 states and 90 transitions. Second operand 10 states. [2018-06-22 11:45:14,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:14,555 INFO ]: Finished difference Result 48 states and 102 transitions. [2018-06-22 11:45:14,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:45:14,556 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:45:14,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:14,556 INFO ]: With dead ends: 48 [2018-06-22 11:45:14,556 INFO ]: Without dead ends: 47 [2018-06-22 11:45:14,557 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:14,557 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:45:14,558 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-06-22 11:45:14,558 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:45:14,559 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 86 transitions. [2018-06-22 11:45:14,559 INFO ]: Start accepts. Automaton has 41 states and 86 transitions. Word has length 17 [2018-06-22 11:45:14,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:14,559 INFO ]: Abstraction has 41 states and 86 transitions. [2018-06-22 11:45:14,559 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:14,559 INFO ]: Start isEmpty. Operand 41 states and 86 transitions. [2018-06-22 11:45:14,560 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:14,560 INFO ]: Found error trace [2018-06-22 11:45:14,560 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:14,560 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:14,560 INFO ]: Analyzing trace with hash 750719090, now seen corresponding path program 1 times [2018-06-22 11:45:14,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:14,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:14,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:14,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:14,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:14,568 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:14,687 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:45:14,687 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:14,687 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:45:14,687 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:14,687 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:14,687 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:14,687 INFO ]: Start difference. First operand 41 states and 86 transitions. Second operand 7 states. [2018-06-22 11:45:14,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:14,791 INFO ]: Finished difference Result 43 states and 92 transitions. [2018-06-22 11:45:14,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:14,791 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:14,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:14,792 INFO ]: With dead ends: 43 [2018-06-22 11:45:14,792 INFO ]: Without dead ends: 42 [2018-06-22 11:45:14,792 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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:45:14,792 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:45:14,795 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 11:45:14,795 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:45:14,796 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2018-06-22 11:45:14,796 INFO ]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 17 [2018-06-22 11:45:14,796 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:14,796 INFO ]: Abstraction has 40 states and 82 transitions. [2018-06-22 11:45:14,796 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:14,796 INFO ]: Start isEmpty. Operand 40 states and 82 transitions. [2018-06-22 11:45:14,796 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:14,796 INFO ]: Found error trace [2018-06-22 11:45:14,796 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:14,796 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:14,797 INFO ]: Analyzing trace with hash 1546269058, now seen corresponding path program 1 times [2018-06-22 11:45:14,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:14,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:14,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:14,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:14,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:14,803 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:15,053 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 11:45:15,215 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:45:15,215 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:15,215 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:45:15,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:15,232 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:15,234 INFO ]: Computing forward predicates... [2018-06-22 11:45:15,297 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:45:15,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:15,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:45:15,317 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:15,317 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:15,317 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:15,317 INFO ]: Start difference. First operand 40 states and 82 transitions. Second operand 10 states. [2018-06-22 11:45:15,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:15,438 INFO ]: Finished difference Result 50 states and 113 transitions. [2018-06-22 11:45:15,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:15,438 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:45:15,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:15,439 INFO ]: With dead ends: 50 [2018-06-22 11:45:15,439 INFO ]: Without dead ends: 50 [2018-06-22 11:45:15,439 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:15,439 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:45:15,442 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-06-22 11:45:15,442 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:45:15,443 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 88 transitions. [2018-06-22 11:45:15,443 INFO ]: Start accepts. Automaton has 42 states and 88 transitions. Word has length 17 [2018-06-22 11:45:15,443 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:15,443 INFO ]: Abstraction has 42 states and 88 transitions. [2018-06-22 11:45:15,443 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:15,443 INFO ]: Start isEmpty. Operand 42 states and 88 transitions. [2018-06-22 11:45:15,444 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:45:15,444 INFO ]: Found error trace [2018-06-22 11:45:15,444 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:15,444 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:15,444 INFO ]: Analyzing trace with hash -1616659883, now seen corresponding path program 1 times [2018-06-22 11:45:15,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:15,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:15,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:15,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:15,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:15,452 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:15,780 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:45:15,780 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:15,780 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:15,780 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:15,781 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:15,781 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:15,781 INFO ]: Start difference. First operand 42 states and 88 transitions. Second operand 4 states. [2018-06-22 11:45:15,962 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:15,962 INFO ]: Finished difference Result 68 states and 138 transitions. [2018-06-22 11:45:15,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:15,962 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:45:15,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:15,963 INFO ]: With dead ends: 68 [2018-06-22 11:45:15,963 INFO ]: Without dead ends: 68 [2018-06-22 11:45:15,963 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:15,963 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 11:45:15,968 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 58. [2018-06-22 11:45:15,968 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:45:15,969 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 121 transitions. [2018-06-22 11:45:15,969 INFO ]: Start accepts. Automaton has 58 states and 121 transitions. Word has length 21 [2018-06-22 11:45:15,969 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:15,969 INFO ]: Abstraction has 58 states and 121 transitions. [2018-06-22 11:45:15,969 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:15,969 INFO ]: Start isEmpty. Operand 58 states and 121 transitions. [2018-06-22 11:45:15,970 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:45:15,970 INFO ]: Found error trace [2018-06-22 11:45:15,970 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:15,970 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:15,970 INFO ]: Analyzing trace with hash 109909451, now seen corresponding path program 1 times [2018-06-22 11:45:15,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:15,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:15,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:15,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:15,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:15,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:16,090 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:45:16,090 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:16,090 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:16,091 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:16,091 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:16,091 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:16,091 INFO ]: Start difference. First operand 58 states and 121 transitions. Second operand 4 states. [2018-06-22 11:45:16,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:16,530 INFO ]: Finished difference Result 88 states and 168 transitions. [2018-06-22 11:45:16,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:16,531 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:45:16,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:16,531 INFO ]: With dead ends: 88 [2018-06-22 11:45:16,532 INFO ]: Without dead ends: 79 [2018-06-22 11:45:16,532 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:45:16,532 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:45:16,537 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 71. [2018-06-22 11:45:16,537 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:45:16,538 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 137 transitions. [2018-06-22 11:45:16,538 INFO ]: Start accepts. Automaton has 71 states and 137 transitions. Word has length 21 [2018-06-22 11:45:16,538 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:16,538 INFO ]: Abstraction has 71 states and 137 transitions. [2018-06-22 11:45:16,538 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:16,538 INFO ]: Start isEmpty. Operand 71 states and 137 transitions. [2018-06-22 11:45:16,539 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:45:16,539 INFO ]: Found error trace [2018-06-22 11:45:16,539 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:16,539 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:16,539 INFO ]: Analyzing trace with hash -89003600, now seen corresponding path program 1 times [2018-06-22 11:45:16,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:16,539 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:16,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:16,539 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:16,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:16,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:16,686 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:45:16,686 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:16,686 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:45:16,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:16,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:16,710 INFO ]: Computing forward predicates... [2018-06-22 11:45:16,785 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:45:16,803 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:16,803 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 11:45:16,804 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:45:16,804 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:45:16,804 INFO ]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:16,804 INFO ]: Start difference. First operand 71 states and 137 transitions. Second operand 14 states. [2018-06-22 11:45:17,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:17,164 INFO ]: Finished difference Result 107 states and 200 transitions. [2018-06-22 11:45:17,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:45:17,164 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:45:17,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:17,165 INFO ]: With dead ends: 107 [2018-06-22 11:45:17,165 INFO ]: Without dead ends: 107 [2018-06-22 11:45:17,165 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:45:17,165 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:45:17,172 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-06-22 11:45:17,172 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:45:17,173 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 143 transitions. [2018-06-22 11:45:17,173 INFO ]: Start accepts. Automaton has 75 states and 143 transitions. Word has length 21 [2018-06-22 11:45:17,173 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:17,173 INFO ]: Abstraction has 75 states and 143 transitions. [2018-06-22 11:45:17,173 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:45:17,173 INFO ]: Start isEmpty. Operand 75 states and 143 transitions. [2018-06-22 11:45:17,174 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:45:17,174 INFO ]: Found error trace [2018-06-22 11:45:17,174 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:17,174 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:17,174 INFO ]: Analyzing trace with hash 238414017, now seen corresponding path program 1 times [2018-06-22 11:45:17,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:17,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:17,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:17,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:17,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:17,181 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:17,281 INFO ]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:17,281 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:17,281 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) [2018-06-22 11:45:17,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:17,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:17,327 INFO ]: Computing forward predicates... [2018-06-22 11:45:17,475 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:17,494 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:17,494 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2018-06-22 11:45:17,494 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:45:17,494 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:45:17,494 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:17,494 INFO ]: Start difference. First operand 75 states and 143 transitions. Second operand 11 states. [2018-06-22 11:45:17,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:17,767 INFO ]: Finished difference Result 117 states and 219 transitions. [2018-06-22 11:45:17,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:45:17,767 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:45:17,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:17,768 INFO ]: With dead ends: 117 [2018-06-22 11:45:17,768 INFO ]: Without dead ends: 116 [2018-06-22 11:45:17,769 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:45:17,769 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-22 11:45:17,778 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 58. [2018-06-22 11:45:17,778 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:45:17,779 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 102 transitions. [2018-06-22 11:45:17,779 INFO ]: Start accepts. Automaton has 58 states and 102 transitions. Word has length 21 [2018-06-22 11:45:17,779 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:17,779 INFO ]: Abstraction has 58 states and 102 transitions. [2018-06-22 11:45:17,779 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:45:17,779 INFO ]: Start isEmpty. Operand 58 states and 102 transitions. [2018-06-22 11:45:17,780 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:45:17,780 INFO ]: Found error trace [2018-06-22 11:45:17,780 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:17,780 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:17,780 INFO ]: Analyzing trace with hash 16543180, now seen corresponding path program 1 times [2018-06-22 11:45:17,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:17,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:17,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:17,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:17,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:17,794 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:17,973 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:45:17,973 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:18,012 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:45:18,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:18,032 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:18,035 INFO ]: Computing forward predicates... [2018-06-22 11:45:18,239 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:45:18,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:18,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 11:45:18,258 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:45:18,258 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:45:18,259 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:18,259 INFO ]: Start difference. First operand 58 states and 102 transitions. Second operand 14 states. [2018-06-22 11:45:18,711 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:18,711 INFO ]: Finished difference Result 88 states and 151 transitions. [2018-06-22 11:45:18,711 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:45:18,711 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:45:18,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:18,712 INFO ]: With dead ends: 88 [2018-06-22 11:45:18,712 INFO ]: Without dead ends: 88 [2018-06-22 11:45:18,712 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:45:18,713 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:45:18,717 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 62. [2018-06-22 11:45:18,717 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:45:18,718 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 112 transitions. [2018-06-22 11:45:18,718 INFO ]: Start accepts. Automaton has 62 states and 112 transitions. Word has length 21 [2018-06-22 11:45:18,718 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:18,718 INFO ]: Abstraction has 62 states and 112 transitions. [2018-06-22 11:45:18,718 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:45:18,718 INFO ]: Start isEmpty. Operand 62 states and 112 transitions. [2018-06-22 11:45:18,719 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:45:18,719 INFO ]: Found error trace [2018-06-22 11:45:18,719 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:18,719 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:18,719 INFO ]: Analyzing trace with hash 1984479627, now seen corresponding path program 2 times [2018-06-22 11:45:18,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:18,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:18,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:18,720 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:18,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:18,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:19,057 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:45:19,057 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:19,057 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:45:19,062 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:19,078 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:19,078 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:19,080 INFO ]: Computing forward predicates... [2018-06-22 11:45:19,195 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:45:19,224 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:19,224 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-06-22 11:45:19,224 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:45:19,224 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:45:19,224 INFO ]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:45:19,224 INFO ]: Start difference. First operand 62 states and 112 transitions. Second operand 15 states. [2018-06-22 11:45:19,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:19,569 INFO ]: Finished difference Result 88 states and 152 transitions. [2018-06-22 11:45:19,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:45:19,571 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 11:45:19,571 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:19,571 INFO ]: With dead ends: 88 [2018-06-22 11:45:19,571 INFO ]: Without dead ends: 88 [2018-06-22 11:45:19,571 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:45:19,572 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:45:19,574 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 66. [2018-06-22 11:45:19,575 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:45:19,575 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 120 transitions. [2018-06-22 11:45:19,575 INFO ]: Start accepts. Automaton has 66 states and 120 transitions. Word has length 21 [2018-06-22 11:45:19,575 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:19,575 INFO ]: Abstraction has 66 states and 120 transitions. [2018-06-22 11:45:19,575 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:45:19,575 INFO ]: Start isEmpty. Operand 66 states and 120 transitions. [2018-06-22 11:45:19,575 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:45:19,575 INFO ]: Found error trace [2018-06-22 11:45:19,575 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:19,575 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:19,576 INFO ]: Analyzing trace with hash 2090026407, now seen corresponding path program 1 times [2018-06-22 11:45:19,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:19,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:19,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:19,576 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:19,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:19,582 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:19,732 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:45:19,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:19,732 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:19,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:19,764 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:19,767 INFO ]: Computing forward predicates... [2018-06-22 11:45:19,827 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:45:19,845 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:19,845 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 11:45:19,845 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:45:19,845 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:45:19,845 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:19,846 INFO ]: Start difference. First operand 66 states and 120 transitions. Second operand 13 states. [2018-06-22 11:45:20,105 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:20,105 INFO ]: Finished difference Result 98 states and 169 transitions. [2018-06-22 11:45:20,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:45:20,105 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:45:20,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:20,106 INFO ]: With dead ends: 98 [2018-06-22 11:45:20,106 INFO ]: Without dead ends: 98 [2018-06-22 11:45:20,106 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:45:20,106 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:45:20,110 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 62. [2018-06-22 11:45:20,110 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:45:20,111 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 112 transitions. [2018-06-22 11:45:20,111 INFO ]: Start accepts. Automaton has 62 states and 112 transitions. Word has length 21 [2018-06-22 11:45:20,111 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:20,111 INFO ]: Abstraction has 62 states and 112 transitions. [2018-06-22 11:45:20,111 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:45:20,111 INFO ]: Start isEmpty. Operand 62 states and 112 transitions. [2018-06-22 11:45:20,111 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:45:20,111 INFO ]: Found error trace [2018-06-22 11:45:20,111 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:20,112 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:20,112 INFO ]: Analyzing trace with hash 257910293, now seen corresponding path program 2 times [2018-06-22 11:45:20,112 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:20,112 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:20,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:20,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:20,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:20,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:20,197 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:45:20,197 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:20,197 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:20,197 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:20,197 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:20,197 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:20,197 INFO ]: Start difference. First operand 62 states and 112 transitions. Second operand 4 states. [2018-06-22 11:45:20,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:20,238 INFO ]: Finished difference Result 64 states and 113 transitions. [2018-06-22 11:45:20,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:20,239 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:45:20,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:20,239 INFO ]: With dead ends: 64 [2018-06-22 11:45:20,239 INFO ]: Without dead ends: 61 [2018-06-22 11:45:20,239 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:20,239 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:45:20,242 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-06-22 11:45:20,242 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:45:20,243 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 104 transitions. [2018-06-22 11:45:20,243 INFO ]: Start accepts. Automaton has 61 states and 104 transitions. Word has length 21 [2018-06-22 11:45:20,243 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:20,243 INFO ]: Abstraction has 61 states and 104 transitions. [2018-06-22 11:45:20,243 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:20,243 INFO ]: Start isEmpty. Operand 61 states and 104 transitions. [2018-06-22 11:45:20,244 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:45:20,244 INFO ]: Found error trace [2018-06-22 11:45:20,244 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:20,244 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:20,244 INFO ]: Analyzing trace with hash 205339932, now seen corresponding path program 1 times [2018-06-22 11:45:20,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:20,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:20,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:20,244 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:20,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:20,251 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:20,361 INFO ]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:45:20,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:20,361 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:45:20,367 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:20,383 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:20,386 INFO ]: Computing forward predicates... [2018-06-22 11:45:20,564 INFO ]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:45:20,582 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:20,582 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-06-22 11:45:20,582 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:45:20,583 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:45:20,583 INFO ]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:45:20,583 INFO ]: Start difference. First operand 61 states and 104 transitions. Second operand 19 states. [2018-06-22 11:45:21,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:21,030 INFO ]: Finished difference Result 99 states and 165 transitions. [2018-06-22 11:45:21,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:45:21,030 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 11:45:21,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:21,030 INFO ]: With dead ends: 99 [2018-06-22 11:45:21,030 INFO ]: Without dead ends: 99 [2018-06-22 11:45:21,031 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:45:21,031 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 11:45:21,035 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 91. [2018-06-22 11:45:21,036 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 11:45:21,036 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 156 transitions. [2018-06-22 11:45:21,036 INFO ]: Start accepts. Automaton has 91 states and 156 transitions. Word has length 25 [2018-06-22 11:45:21,037 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:21,037 INFO ]: Abstraction has 91 states and 156 transitions. [2018-06-22 11:45:21,037 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:45:21,037 INFO ]: Start isEmpty. Operand 91 states and 156 transitions. [2018-06-22 11:45:21,037 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:45:21,037 INFO ]: Found error trace [2018-06-22 11:45:21,037 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:21,037 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:21,038 INFO ]: Analyzing trace with hash -738606501, now seen corresponding path program 1 times [2018-06-22 11:45:21,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:21,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:21,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:21,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:21,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:21,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:21,184 INFO ]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:45:21,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:21,184 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:21,189 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:21,206 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:21,208 INFO ]: Computing forward predicates... [2018-06-22 11:45:21,321 INFO ]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:45:21,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:21,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-06-22 11:45:21,341 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:45:21,341 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:45:21,341 INFO ]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:45:21,341 INFO ]: Start difference. First operand 91 states and 156 transitions. Second operand 19 states. [2018-06-22 11:45:21,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:21,772 INFO ]: Finished difference Result 103 states and 171 transitions. [2018-06-22 11:45:21,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:45:21,772 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 11:45:21,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:21,773 INFO ]: With dead ends: 103 [2018-06-22 11:45:21,773 INFO ]: Without dead ends: 103 [2018-06-22 11:45:21,773 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:45:21,774 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 11:45:21,780 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 91. [2018-06-22 11:45:21,781 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 11:45:21,781 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 158 transitions. [2018-06-22 11:45:21,781 INFO ]: Start accepts. Automaton has 91 states and 158 transitions. Word has length 25 [2018-06-22 11:45:21,782 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:21,782 INFO ]: Abstraction has 91 states and 158 transitions. [2018-06-22 11:45:21,782 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:45:21,782 INFO ]: Start isEmpty. Operand 91 states and 158 transitions. [2018-06-22 11:45:21,782 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:45:21,782 INFO ]: Found error trace [2018-06-22 11:45:21,782 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:21,782 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:21,782 INFO ]: Analyzing trace with hash 1065705206, now seen corresponding path program 1 times [2018-06-22 11:45:21,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:21,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:21,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:21,783 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:21,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:21,790 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:22,063 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:45:22,109 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:45:22,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:22,109 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:45:22,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:22,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:22,137 INFO ]: Computing forward predicates... [2018-06-22 11:45:22,179 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:45:22,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:22,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 11:45:22,198 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:45:22,198 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:45:22,198 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:22,198 INFO ]: Start difference. First operand 91 states and 158 transitions. Second operand 9 states. [2018-06-22 11:45:22,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:22,288 INFO ]: Finished difference Result 95 states and 160 transitions. [2018-06-22 11:45:22,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:45:22,288 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:45:22,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:22,289 INFO ]: With dead ends: 95 [2018-06-22 11:45:22,289 INFO ]: Without dead ends: 95 [2018-06-22 11:45:22,289 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:22,289 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 11:45:22,294 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 87. [2018-06-22 11:45:22,294 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:45:22,295 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 147 transitions. [2018-06-22 11:45:22,295 INFO ]: Start accepts. Automaton has 87 states and 147 transitions. Word has length 25 [2018-06-22 11:45:22,295 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:22,295 INFO ]: Abstraction has 87 states and 147 transitions. [2018-06-22 11:45:22,295 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:45:22,295 INFO ]: Start isEmpty. Operand 87 states and 147 transitions. [2018-06-22 11:45:22,296 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:45:22,296 INFO ]: Found error trace [2018-06-22 11:45:22,296 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:22,296 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:22,296 INFO ]: Analyzing trace with hash 889264914, now seen corresponding path program 1 times [2018-06-22 11:45:22,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:22,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:22,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:22,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:22,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:22,305 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:22,919 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:45:22,919 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:22,919 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:45:22,927 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:22,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:22,947 INFO ]: Computing forward predicates... [2018-06-22 11:45:23,027 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:45:23,047 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:23,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-22 11:45:23,058 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:45:23,058 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:45:23,058 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:23,058 INFO ]: Start difference. First operand 87 states and 147 transitions. Second operand 14 states. [2018-06-22 11:45:23,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:23,207 INFO ]: Finished difference Result 91 states and 150 transitions. [2018-06-22 11:45:23,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:23,207 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:45:23,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:23,208 INFO ]: With dead ends: 91 [2018-06-22 11:45:23,208 INFO ]: Without dead ends: 91 [2018-06-22 11:45:23,208 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:45:23,208 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:45:23,213 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 71. [2018-06-22 11:45:23,213 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:45:23,213 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 121 transitions. [2018-06-22 11:45:23,214 INFO ]: Start accepts. Automaton has 71 states and 121 transitions. Word has length 25 [2018-06-22 11:45:23,214 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:23,214 INFO ]: Abstraction has 71 states and 121 transitions. [2018-06-22 11:45:23,214 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:45:23,214 INFO ]: Start isEmpty. Operand 71 states and 121 transitions. [2018-06-22 11:45:23,214 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:45:23,214 INFO ]: Found error trace [2018-06-22 11:45:23,214 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:23,214 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:23,215 INFO ]: Analyzing trace with hash 388823169, now seen corresponding path program 1 times [2018-06-22 11:45:23,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:23,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:23,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:23,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:23,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:23,224 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:23,420 INFO ]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:45:23,420 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:23,420 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:45:23,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:23,452 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:23,455 INFO ]: Computing forward predicates... [2018-06-22 11:45:23,637 INFO ]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:45:23,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:23,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-06-22 11:45:23,657 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:45:23,657 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:45:23,657 INFO ]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:45:23,657 INFO ]: Start difference. First operand 71 states and 121 transitions. Second operand 21 states. [2018-06-22 11:45:24,415 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:24,415 INFO ]: Finished difference Result 103 states and 159 transitions. [2018-06-22 11:45:24,415 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:45:24,415 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:45:24,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:24,416 INFO ]: With dead ends: 103 [2018-06-22 11:45:24,416 INFO ]: Without dead ends: 99 [2018-06-22 11:45:24,416 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:45:24,416 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 11:45:24,420 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 77. [2018-06-22 11:45:24,420 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:45:24,420 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2018-06-22 11:45:24,420 INFO ]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 29 [2018-06-22 11:45:24,420 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:24,420 INFO ]: Abstraction has 77 states and 121 transitions. [2018-06-22 11:45:24,420 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:45:24,420 INFO ]: Start isEmpty. Operand 77 states and 121 transitions. [2018-06-22 11:45:24,421 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:45:24,421 INFO ]: Found error trace [2018-06-22 11:45:24,421 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:24,421 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:24,421 INFO ]: Analyzing trace with hash -1826656612, now seen corresponding path program 1 times [2018-06-22 11:45:24,421 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:24,421 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:24,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:24,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:24,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:24,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:24,596 INFO ]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:45:24,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:24,596 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:45:24,601 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:24,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:24,623 INFO ]: Computing forward predicates... [2018-06-22 11:45:24,712 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:45:24,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:24,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-22 11:45:24,731 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:45:24,731 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:45:24,731 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:45:24,731 INFO ]: Start difference. First operand 77 states and 121 transitions. Second operand 17 states. [2018-06-22 11:45:26,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:26,038 INFO ]: Finished difference Result 288 states and 443 transitions. [2018-06-22 11:45:26,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 11:45:26,038 INFO ]: Start accepts. Automaton has 17 states. Word has length 29 [2018-06-22 11:45:26,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:26,039 INFO ]: With dead ends: 288 [2018-06-22 11:45:26,039 INFO ]: Without dead ends: 222 [2018-06-22 11:45:26,040 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=404, Invalid=2566, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:45:26,040 INFO ]: Start minimizeSevpa. Operand 222 states. [2018-06-22 11:45:26,067 INFO ]: Finished minimizeSevpa. Reduced states from 222 to 108. [2018-06-22 11:45:26,067 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:45:26,067 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 183 transitions. [2018-06-22 11:45:26,068 INFO ]: Start accepts. Automaton has 108 states and 183 transitions. Word has length 29 [2018-06-22 11:45:26,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:26,068 INFO ]: Abstraction has 108 states and 183 transitions. [2018-06-22 11:45:26,068 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:45:26,068 INFO ]: Start isEmpty. Operand 108 states and 183 transitions. [2018-06-22 11:45:26,069 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:45:26,069 INFO ]: Found error trace [2018-06-22 11:45:26,069 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:26,070 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:26,070 INFO ]: Analyzing trace with hash 1293216037, now seen corresponding path program 1 times [2018-06-22 11:45:26,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:26,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:26,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:26,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:26,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:26,078 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:26,283 INFO ]: Checked inductivity of 22 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:45:26,283 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:26,283 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:45:26,291 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:26,310 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:26,312 INFO ]: Computing forward predicates... [2018-06-22 11:45:26,506 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:45:26,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:26,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2018-06-22 11:45:26,538 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:45:26,538 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:45:26,538 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:45:26,538 INFO ]: Start difference. First operand 108 states and 183 transitions. Second operand 20 states. [2018-06-22 11:45:27,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:27,032 INFO ]: Finished difference Result 196 states and 326 transitions. [2018-06-22 11:45:27,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:45:27,032 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:45:27,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:27,033 INFO ]: With dead ends: 196 [2018-06-22 11:45:27,033 INFO ]: Without dead ends: 196 [2018-06-22 11:45:27,033 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:45:27,034 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-22 11:45:27,046 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 108. [2018-06-22 11:45:27,046 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:45:27,047 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 185 transitions. [2018-06-22 11:45:27,047 INFO ]: Start accepts. Automaton has 108 states and 185 transitions. Word has length 29 [2018-06-22 11:45:27,047 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:27,047 INFO ]: Abstraction has 108 states and 185 transitions. [2018-06-22 11:45:27,047 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:45:27,047 INFO ]: Start isEmpty. Operand 108 states and 185 transitions. [2018-06-22 11:45:27,049 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:45:27,049 INFO ]: Found error trace [2018-06-22 11:45:27,049 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:27,049 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:27,049 INFO ]: Analyzing trace with hash 1181080897, now seen corresponding path program 2 times [2018-06-22 11:45:27,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:27,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:27,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:27,050 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:27,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:27,057 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:27,340 INFO ]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:45:27,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:27,340 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:45:27,347 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:27,386 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:27,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:27,388 INFO ]: Computing forward predicates... [2018-06-22 11:45:27,667 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:45:27,684 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:27,685 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2018-06-22 11:45:27,685 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:45:27,685 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:45:27,685 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:45:27,685 INFO ]: Start difference. First operand 108 states and 185 transitions. Second operand 20 states. [2018-06-22 11:45:28,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:28,273 INFO ]: Finished difference Result 226 states and 374 transitions. [2018-06-22 11:45:28,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:45:28,273 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:45:28,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:28,274 INFO ]: With dead ends: 226 [2018-06-22 11:45:28,274 INFO ]: Without dead ends: 226 [2018-06-22 11:45:28,275 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=1162, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:45:28,275 INFO ]: Start minimizeSevpa. Operand 226 states. [2018-06-22 11:45:28,285 INFO ]: Finished minimizeSevpa. Reduced states from 226 to 108. [2018-06-22 11:45:28,285 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:45:28,286 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 184 transitions. [2018-06-22 11:45:28,286 INFO ]: Start accepts. Automaton has 108 states and 184 transitions. Word has length 29 [2018-06-22 11:45:28,286 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:28,286 INFO ]: Abstraction has 108 states and 184 transitions. [2018-06-22 11:45:28,286 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:45:28,286 INFO ]: Start isEmpty. Operand 108 states and 184 transitions. [2018-06-22 11:45:28,287 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:45:28,287 INFO ]: Found error trace [2018-06-22 11:45:28,287 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:28,287 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:28,287 INFO ]: Analyzing trace with hash 587404143, now seen corresponding path program 1 times [2018-06-22 11:45:28,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:28,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:28,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:28,288 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:28,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:28,295 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:28,401 INFO ]: Checked inductivity of 23 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:45:28,401 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:28,401 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:45:28,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:28,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:28,428 INFO ]: Computing forward predicates... [2018-06-22 11:45:28,603 INFO ]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:45:28,622 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:28,622 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-06-22 11:45:28,622 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:45:28,622 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:45:28,622 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:45:28,622 INFO ]: Start difference. First operand 108 states and 184 transitions. Second operand 18 states. [2018-06-22 11:45:29,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:29,080 INFO ]: Finished difference Result 176 states and 289 transitions. [2018-06-22 11:45:29,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:45:29,080 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:45:29,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:29,081 INFO ]: With dead ends: 176 [2018-06-22 11:45:29,081 INFO ]: Without dead ends: 120 [2018-06-22 11:45:29,081 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:45:29,081 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 11:45:29,088 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 88. [2018-06-22 11:45:29,088 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 11:45:29,088 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 146 transitions. [2018-06-22 11:45:29,089 INFO ]: Start accepts. Automaton has 88 states and 146 transitions. Word has length 29 [2018-06-22 11:45:29,089 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:29,089 INFO ]: Abstraction has 88 states and 146 transitions. [2018-06-22 11:45:29,089 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:45:29,089 INFO ]: Start isEmpty. Operand 88 states and 146 transitions. [2018-06-22 11:45:29,089 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:45:29,089 INFO ]: Found error trace [2018-06-22 11:45:29,089 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:29,089 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:29,089 INFO ]: Analyzing trace with hash -63523820, now seen corresponding path program 2 times [2018-06-22 11:45:29,090 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:29,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:29,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:29,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:29,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:29,100 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:29,239 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:45:29,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:29,239 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:45:29,245 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:29,285 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:29,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:29,288 INFO ]: Computing forward predicates... [2018-06-22 11:45:29,472 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:45:29,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:29,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-22 11:45:29,492 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:45:29,492 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:45:29,492 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:29,492 INFO ]: Start difference. First operand 88 states and 146 transitions. Second operand 14 states. [2018-06-22 11:45:30,318 WARN ]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 11:45:30,673 WARN ]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 11:45:30,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:30,747 INFO ]: Finished difference Result 114 states and 182 transitions. [2018-06-22 11:45:30,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:45:30,748 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 11:45:30,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:30,748 INFO ]: With dead ends: 114 [2018-06-22 11:45:30,748 INFO ]: Without dead ends: 85 [2018-06-22 11:45:30,749 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:45:30,749 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:45:30,753 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 63. [2018-06-22 11:45:30,753 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:45:30,754 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 101 transitions. [2018-06-22 11:45:30,754 INFO ]: Start accepts. Automaton has 63 states and 101 transitions. Word has length 33 [2018-06-22 11:45:30,754 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:30,754 INFO ]: Abstraction has 63 states and 101 transitions. [2018-06-22 11:45:30,754 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:45:30,754 INFO ]: Start isEmpty. Operand 63 states and 101 transitions. [2018-06-22 11:45:30,755 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:45:30,755 INFO ]: Found error trace [2018-06-22 11:45:30,755 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:30,755 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:30,755 INFO ]: Analyzing trace with hash -1358406454, now seen corresponding path program 3 times [2018-06-22 11:45:30,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:30,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:30,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:30,756 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:30,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:30,765 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:31,035 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:45:31,119 INFO ]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:45:31,119 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:31,119 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:45:31,125 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:45:31,170 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 11:45:31,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:31,173 INFO ]: Computing forward predicates... [2018-06-22 11:45:31,442 INFO ]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:45:31,461 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:45:31,461 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2018-06-22 11:45:31,461 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:45:31,461 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:45:31,462 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:31,462 INFO ]: Start difference. First operand 63 states and 101 transitions. Second operand 13 states. [2018-06-22 11:45:31,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:31,772 INFO ]: Finished difference Result 77 states and 117 transitions. [2018-06-22 11:45:31,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:45:31,772 INFO ]: Start accepts. Automaton has 13 states. Word has length 33 [2018-06-22 11:45:31,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:31,772 INFO ]: With dead ends: 77 [2018-06-22 11:45:31,772 INFO ]: Without dead ends: 75 [2018-06-22 11:45:31,772 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:45:31,773 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:45:31,775 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 63. [2018-06-22 11:45:31,775 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:45:31,775 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2018-06-22 11:45:31,775 INFO ]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 33 [2018-06-22 11:45:31,775 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:31,775 INFO ]: Abstraction has 63 states and 99 transitions. [2018-06-22 11:45:31,776 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:45:31,776 INFO ]: Start isEmpty. Operand 63 states and 99 transitions. [2018-06-22 11:45:31,776 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:45:31,776 INFO ]: Found error trace [2018-06-22 11:45:31,776 INFO ]: trace histogram [7, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:31,776 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:31,776 INFO ]: Analyzing trace with hash 148975033, now seen corresponding path program 1 times [2018-06-22 11:45:31,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:31,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:31,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:31,777 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:31,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:31,788 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:32,013 INFO ]: Checked inductivity of 71 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:45:32,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:32,013 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:32,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:32,047 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:32,050 INFO ]: Computing forward predicates... [2018-06-22 11:45:32,693 INFO ]: Checked inductivity of 71 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:45:32,712 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:32,712 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 22 [2018-06-22 11:45:32,712 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:45:32,712 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:45:32,712 INFO ]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:45:32,713 INFO ]: Start difference. First operand 63 states and 99 transitions. Second operand 22 states. [2018-06-22 11:45:33,799 WARN ]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 11:45:33,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:33,890 INFO ]: Finished difference Result 171 states and 257 transitions. [2018-06-22 11:45:33,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:45:33,890 INFO ]: Start accepts. Automaton has 22 states. Word has length 41 [2018-06-22 11:45:33,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:33,891 INFO ]: With dead ends: 171 [2018-06-22 11:45:33,891 INFO ]: Without dead ends: 155 [2018-06-22 11:45:33,891 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:45:33,891 INFO ]: Start minimizeSevpa. Operand 155 states. [2018-06-22 11:45:33,897 INFO ]: Finished minimizeSevpa. Reduced states from 155 to 83. [2018-06-22 11:45:33,897 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:45:33,897 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2018-06-22 11:45:33,897 INFO ]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 41 [2018-06-22 11:45:33,897 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:33,898 INFO ]: Abstraction has 83 states and 129 transitions. [2018-06-22 11:45:33,898 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:45:33,898 INFO ]: Start isEmpty. Operand 83 states and 129 transitions. [2018-06-22 11:45:33,898 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:45:33,898 INFO ]: Found error trace [2018-06-22 11:45:33,898 INFO ]: trace histogram [7, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:33,898 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:33,898 INFO ]: Analyzing trace with hash 712370598, now seen corresponding path program 2 times [2018-06-22 11:45:33,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:33,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:33,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:33,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:33,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:33,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:34,043 INFO ]: Checked inductivity of 77 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:45:34,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:34,044 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:34,049 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:34,083 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:34,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:34,086 INFO ]: Computing forward predicates... [2018-06-22 11:45:34,155 INFO ]: Checked inductivity of 77 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 11:45:34,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:34,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-06-22 11:45:34,174 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:45:34,174 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:45:34,174 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:34,174 INFO ]: Start difference. First operand 83 states and 129 transitions. Second operand 13 states. [2018-06-22 11:45:34,335 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:34,335 INFO ]: Finished difference Result 123 states and 184 transitions. [2018-06-22 11:45:34,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:45:34,336 INFO ]: Start accepts. Automaton has 13 states. Word has length 41 [2018-06-22 11:45:34,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:34,336 INFO ]: With dead ends: 123 [2018-06-22 11:45:34,336 INFO ]: Without dead ends: 123 [2018-06-22 11:45:34,336 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:45:34,336 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-22 11:45:34,339 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 81. [2018-06-22 11:45:34,339 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 11:45:34,339 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2018-06-22 11:45:34,339 INFO ]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 41 [2018-06-22 11:45:34,340 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:34,340 INFO ]: Abstraction has 81 states and 122 transitions. [2018-06-22 11:45:34,340 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:45:34,340 INFO ]: Start isEmpty. Operand 81 states and 122 transitions. [2018-06-22 11:45:34,340 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:45:34,340 INFO ]: Found error trace [2018-06-22 11:45:34,340 INFO ]: trace histogram [7, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:34,340 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:34,340 INFO ]: Analyzing trace with hash -10171408, now seen corresponding path program 2 times [2018-06-22 11:45:34,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:34,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:34,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:34,341 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:34,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:34,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:34,679 INFO ]: Checked inductivity of 71 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:45:34,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:34,679 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:34,685 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:34,714 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:34,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:34,718 INFO ]: Computing forward predicates... [2018-06-22 11:45:34,830 INFO ]: Checked inductivity of 71 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:45:34,848 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:34,848 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 19 [2018-06-22 11:45:34,849 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:45:34,849 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:45:34,849 INFO ]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:45:34,849 INFO ]: Start difference. First operand 81 states and 122 transitions. Second operand 19 states. [2018-06-22 11:45:35,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:35,328 INFO ]: Finished difference Result 117 states and 172 transitions. [2018-06-22 11:45:35,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:45:35,328 INFO ]: Start accepts. Automaton has 19 states. Word has length 41 [2018-06-22 11:45:35,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:35,329 INFO ]: With dead ends: 117 [2018-06-22 11:45:35,329 INFO ]: Without dead ends: 117 [2018-06-22 11:45:35,329 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:45:35,329 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:45:35,333 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 83. [2018-06-22 11:45:35,333 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:45:35,333 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2018-06-22 11:45:35,333 INFO ]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 41 [2018-06-22 11:45:35,333 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:35,333 INFO ]: Abstraction has 83 states and 125 transitions. [2018-06-22 11:45:35,333 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:45:35,333 INFO ]: Start isEmpty. Operand 83 states and 125 transitions. [2018-06-22 11:45:35,334 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:45:35,334 INFO ]: Found error trace [2018-06-22 11:45:35,334 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:35,334 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:35,334 INFO ]: Analyzing trace with hash -713144630, now seen corresponding path program 2 times [2018-06-22 11:45:35,334 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:35,334 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:35,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:35,335 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:35,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:35,353 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:35,880 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-22 11:45:35,979 INFO ]: Checked inductivity of 52 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:45:35,979 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:35,979 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:35,984 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:36,010 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:36,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:36,013 INFO ]: Computing forward predicates... [2018-06-22 11:45:36,142 INFO ]: Checked inductivity of 52 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:45:36,161 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:36,161 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 17 [2018-06-22 11:45:36,161 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:45:36,161 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:45:36,161 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:45:36,162 INFO ]: Start difference. First operand 83 states and 125 transitions. Second operand 17 states. [2018-06-22 11:45:36,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:36,968 INFO ]: Finished difference Result 109 states and 159 transitions. [2018-06-22 11:45:36,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:45:36,968 INFO ]: Start accepts. Automaton has 17 states. Word has length 37 [2018-06-22 11:45:36,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:36,969 INFO ]: With dead ends: 109 [2018-06-22 11:45:36,969 INFO ]: Without dead ends: 108 [2018-06-22 11:45:36,969 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:45:36,969 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:45:36,973 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 62. [2018-06-22 11:45:36,973 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:45:36,974 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2018-06-22 11:45:36,974 INFO ]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 37 [2018-06-22 11:45:36,974 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:36,974 INFO ]: Abstraction has 62 states and 92 transitions. [2018-06-22 11:45:36,974 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:45:36,974 INFO ]: Start isEmpty. Operand 62 states and 92 transitions. [2018-06-22 11:45:36,974 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:45:36,974 INFO ]: Found error trace [2018-06-22 11:45:36,974 INFO ]: trace histogram [8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:36,974 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:36,974 INFO ]: Analyzing trace with hash -1788401003, now seen corresponding path program 3 times [2018-06-22 11:45:36,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:36,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:36,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:36,975 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:36,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:36,993 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:37,732 INFO ]: Checked inductivity of 95 backedges. 14 proven. 48 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 11:45:37,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:37,732 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:37,739 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:45:37,764 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:45:37,764 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:37,767 INFO ]: Computing forward predicates... [2018-06-22 11:45:38,049 INFO ]: Checked inductivity of 95 backedges. 38 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 11:45:38,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:38,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 23 [2018-06-22 11:45:38,069 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:45:38,069 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:45:38,069 INFO ]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:45:38,070 INFO ]: Start difference. First operand 62 states and 92 transitions. Second operand 23 states. [2018-06-22 11:45:38,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:38,785 INFO ]: Finished difference Result 168 states and 232 transitions. [2018-06-22 11:45:38,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:45:38,785 INFO ]: Start accepts. Automaton has 23 states. Word has length 45 [2018-06-22 11:45:38,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:38,786 INFO ]: With dead ends: 168 [2018-06-22 11:45:38,786 INFO ]: Without dead ends: 150 [2018-06-22 11:45:38,786 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=178, Invalid=1382, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:45:38,786 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 11:45:38,790 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 92. [2018-06-22 11:45:38,790 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 11:45:38,791 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions. [2018-06-22 11:45:38,791 INFO ]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 45 [2018-06-22 11:45:38,791 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:38,791 INFO ]: Abstraction has 92 states and 139 transitions. [2018-06-22 11:45:38,791 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:45:38,791 INFO ]: Start isEmpty. Operand 92 states and 139 transitions. [2018-06-22 11:45:38,791 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:45:38,791 INFO ]: Found error trace [2018-06-22 11:45:38,791 INFO ]: trace histogram [8, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:38,792 INFO ]: === Iteration 58 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:38,792 INFO ]: Analyzing trace with hash -374758059, now seen corresponding path program 3 times [2018-06-22 11:45:38,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:38,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:38,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:38,792 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:38,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:38,806 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:39,634 INFO ]: Checked inductivity of 98 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 11:45:39,634 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:39,634 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:39,640 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:45:39,680 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:45:39,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:39,685 INFO ]: Computing forward predicates... [2018-06-22 11:45:39,857 INFO ]: Checked inductivity of 98 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 11:45:39,875 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:39,875 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 22 [2018-06-22 11:45:39,875 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:45:39,876 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:45:39,876 INFO ]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:45:39,876 INFO ]: Start difference. First operand 92 states and 139 transitions. Second operand 22 states. [2018-06-22 11:45:40,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:40,317 INFO ]: Finished difference Result 148 states and 215 transitions. [2018-06-22 11:45:40,317 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:45:40,317 INFO ]: Start accepts. Automaton has 22 states. Word has length 45 [2018-06-22 11:45:40,317 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:40,318 INFO ]: With dead ends: 148 [2018-06-22 11:45:40,318 INFO ]: Without dead ends: 135 [2018-06-22 11:45:40,318 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:45:40,318 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 11:45:40,323 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 83. [2018-06-22 11:45:40,323 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:45:40,324 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2018-06-22 11:45:40,324 INFO ]: Start accepts. Automaton has 83 states and 124 transitions. Word has length 45 [2018-06-22 11:45:40,324 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:40,324 INFO ]: Abstraction has 83 states and 124 transitions. [2018-06-22 11:45:40,324 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:45:40,324 INFO ]: Start isEmpty. Operand 83 states and 124 transitions. [2018-06-22 11:45:40,324 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:45:40,324 INFO ]: Found error trace [2018-06-22 11:45:40,324 INFO ]: trace histogram [8, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:40,324 INFO ]: === Iteration 59 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:40,324 INFO ]: Analyzing trace with hash 726513200, now seen corresponding path program 4 times [2018-06-22 11:45:40,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:40,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:40,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:40,325 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:40,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:40,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:40,646 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:45:41,050 INFO ]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:45:41,050 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:41,050 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:41,055 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:45:41,089 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:45:41,089 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:41,092 INFO ]: Computing forward predicates... [2018-06-22 11:45:41,186 INFO ]: Checked inductivity of 98 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 11:45:41,205 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:41,205 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 14 [2018-06-22 11:45:41,205 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:45:41,205 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:45:41,205 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:41,205 INFO ]: Start difference. First operand 83 states and 124 transitions. Second operand 14 states. [2018-06-22 11:45:41,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:41,458 INFO ]: Finished difference Result 117 states and 172 transitions. [2018-06-22 11:45:41,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:45:41,458 INFO ]: Start accepts. Automaton has 14 states. Word has length 45 [2018-06-22 11:45:41,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:41,458 INFO ]: With dead ends: 117 [2018-06-22 11:45:41,458 INFO ]: Without dead ends: 0 [2018-06-22 11:45:41,458 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:45:41,459 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:45:41,459 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:45:41,459 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:45:41,459 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:45:41,459 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-06-22 11:45:41,459 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:41,459 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:45:41,459 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:45:41,459 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:45:41,459 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:45:41,463 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:45:41 BoogieIcfgContainer [2018-06-22 11:45:41,463 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:45:41,463 INFO ]: Toolchain (without parser) took 44344.83 ms. Allocated memory was 306.2 MB in the beginning and 728.8 MB in the end (delta: 422.6 MB). Free memory was 254.6 MB in the beginning and 275.4 MB in the end (delta: -20.8 MB). Peak memory consumption was 401.8 MB. Max. memory is 3.6 GB. [2018-06-22 11:45:41,464 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:45:41,464 INFO ]: ChcToBoogie took 56.81 ms. Allocated memory is still 306.2 MB. Free memory was 254.6 MB in the beginning and 252.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:45:41,465 INFO ]: Boogie Preprocessor took 48.54 ms. Allocated memory is still 306.2 MB. Free memory was 252.5 MB in the beginning and 250.5 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:45:41,465 INFO ]: RCFGBuilder took 605.96 ms. Allocated memory is still 306.2 MB. Free memory was 250.5 MB in the beginning and 234.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:45:41,465 INFO ]: TraceAbstraction took 43622.54 ms. Allocated memory was 306.2 MB in the beginning and 728.8 MB in the end (delta: 422.6 MB). Free memory was 234.5 MB in the beginning and 275.4 MB in the end (delta: -40.9 MB). Peak memory consumption was 381.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:45:41,469 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.81 ms. Allocated memory is still 306.2 MB. Free memory was 254.6 MB in the beginning and 252.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.54 ms. Allocated memory is still 306.2 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 605.96 ms. Allocated memory is still 306.2 MB. Free memory was 250.5 MB in the beginning and 234.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 43622.54 ms. Allocated memory was 306.2 MB in the beginning and 728.8 MB in the end (delta: 422.6 MB). Free memory was 234.5 MB in the beginning and 275.4 MB in the end (delta: -40.9 MB). Peak memory consumption was 381.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. SAFE Result, 43.5s OverallTime, 59 OverallIterations, 8 TraceHistogramMax, 21.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2406 SDtfs, 383 SDslu, 9467 SDs, 0 SdLazy, 11784 SolverSat, 924 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1620 GetRequests, 785 SyntacticMatches, 87 SemanticMatches, 748 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 59 MinimizatonAttempts, 1066 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 2104 NumberOfCodeBlocks, 2080 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 2012 ConstructedInterpolants, 29 QuantifiedInterpolants, 367280 SizeOfPredicates, 284 NumberOfNonLiveVariables, 5771 ConjunctsInSsa, 1794 ConjunctsInUnsatCore, 92 InterpolantComputations, 28 PerfectInterpolantSequences, 975/1802 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__strcspn.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-45-41-476.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strcspn.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-45-41-476.csv Received shutdown request...