java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:02:04,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:02:04,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:02:04,895 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:02:04,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:02:04,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:02:04,898 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:02:04,903 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:02:04,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:02:04,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:02:04,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:02:04,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:02:04,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:02:04,908 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:02:04,911 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:02:04,912 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:02:04,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:02:04,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:02:04,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:02:04,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:02:04,921 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:02:04,922 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:02:04,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:02:04,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:02:04,925 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:02:04,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:02:04,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:02:04,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:02:04,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:02:04,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:02:04,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:02:04,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:02:04,930 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:02:04,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:02:04,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:02:04,932 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:02:04,933 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:02:04,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:02:04,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:02:04,948 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:02:04,948 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:02:04,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:02:04,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:02:04,949 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:02:04,949 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:02:04,950 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:02:04,950 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:02:04,950 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:02:04,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:02:04,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:02:04,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:02:04,951 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:02:04,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:02:04,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:02:04,952 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:02:04,952 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:02:04,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:02:04,952 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:02:04,954 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:02:04,954 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:02:05,001 INFO ]: Repository-Root is: /tmp [2018-06-26 18:02:05,016 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:02:05,022 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:02:05,023 INFO ]: Initializing SmtParser... [2018-06-26 18:02:05,023 INFO ]: SmtParser initialized [2018-06-26 18:02:05,024 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 [2018-06-26 18:02:05,025 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-26 18:02:05,112 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 unknown [2018-06-26 18:02:05,343 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 [2018-06-26 18:02:05,347 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:02:05,352 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:02:05,352 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:02:05,353 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:02:05,353 INFO ]: ChcToBoogie initialized [2018-06-26 18:02:05,356 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:02:05" (1/1) ... [2018-06-26 18:02:05,427 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:02:05 Unit [2018-06-26 18:02:05,427 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:02:05,428 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:02:05,428 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:02:05,428 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:02:05,449 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:02:05" (1/1) ... [2018-06-26 18:02:05,449 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:02:05" (1/1) ... [2018-06-26 18:02:05,455 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:02:05" (1/1) ... [2018-06-26 18:02:05,455 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:02:05" (1/1) ... [2018-06-26 18:02:05,460 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:02:05" (1/1) ... [2018-06-26 18:02:05,463 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:02:05" (1/1) ... [2018-06-26 18:02:05,464 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:02:05" (1/1) ... [2018-06-26 18:02:05,466 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:02:05,467 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:02:05,467 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:02:05,467 INFO ]: RCFGBuilder initialized [2018-06-26 18:02:05,467 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:02:05" (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-26 18:02:05,493 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:02:05,493 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:02:05,493 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:02:05,493 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:02:05,493 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:02:05,493 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-26 18:02:05,913 INFO ]: Using library mode [2018-06-26 18:02:05,914 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:02:05 BoogieIcfgContainer [2018-06-26 18:02:05,914 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:02:05,914 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:02:05,914 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:02:05,915 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:02:05,915 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:02:05" (1/1) ... [2018-06-26 18:02:05,933 INFO ]: Initial Icfg 10 locations, 20 edges [2018-06-26 18:02:05,934 INFO ]: Using Remove infeasible edges [2018-06-26 18:02:05,936 INFO ]: Using Maximize final states [2018-06-26 18:02:05,936 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:02:05,936 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:02:05,938 INFO ]: Using Remove sink states [2018-06-26 18:02:05,940 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:02:05,940 INFO ]: Using Use SBE [2018-06-26 18:02:05,955 INFO ]: SBE split 0 edges [2018-06-26 18:02:05,960 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:02:05,963 INFO ]: 0 new accepting states [2018-06-26 18:02:05,985 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 18:02:05,987 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:02:05,991 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:02:05,991 INFO ]: 0 new accepting states [2018-06-26 18:02:05,991 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:02:05,991 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:02:05,992 INFO ]: Encoded RCFG 6 locations, 16 edges [2018-06-26 18:02:05,992 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:02:05 BasicIcfg [2018-06-26 18:02:05,992 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:02:05,993 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:02:05,993 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:02:05,996 INFO ]: TraceAbstraction initialized [2018-06-26 18:02:05,996 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:02:05" (1/4) ... [2018-06-26 18:02:05,998 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3a3d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:02:05, skipping insertion in model container [2018-06-26 18:02:05,998 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:02:05" (2/4) ... [2018-06-26 18:02:05,998 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3a3d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:02:05, skipping insertion in model container [2018-06-26 18:02:05,998 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:02:05" (3/4) ... [2018-06-26 18:02:05,999 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3a3d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:02:05, skipping insertion in model container [2018-06-26 18:02:05,999 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:02:05" (4/4) ... [2018-06-26 18:02:06,000 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:02:06,007 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:02:06,015 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:02:06,061 INFO ]: Using default assertion order modulation [2018-06-26 18:02:06,061 INFO ]: Interprodecural is true [2018-06-26 18:02:06,061 INFO ]: Hoare is false [2018-06-26 18:02:06,061 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:02:06,061 INFO ]: Backedges is TWOTRACK [2018-06-26 18:02:06,061 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:02:06,061 INFO ]: Difference is false [2018-06-26 18:02:06,062 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:02:06,062 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:02:06,074 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 18:02:06,083 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:02:06,083 INFO ]: Found error trace [2018-06-26 18:02:06,084 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:02:06,084 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:06,087 INFO ]: Analyzing trace with hash 44945612, now seen corresponding path program 1 times [2018-06-26 18:02:06,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:06,090 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:06,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:06,124 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:06,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:06,160 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:06,213 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:06,214 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:02:06,215 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:02:06,216 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:02:06,226 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:02:06,226 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:06,228 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 18:02:06,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:06,448 INFO ]: Finished difference Result 7 states and 27 transitions. [2018-06-26 18:02:06,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:02:06,449 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:02:06,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:06,457 INFO ]: With dead ends: 7 [2018-06-26 18:02:06,457 INFO ]: Without dead ends: 7 [2018-06-26 18:02:06,459 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:06,473 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:02:06,488 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:02:06,490 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:02:06,490 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-06-26 18:02:06,491 INFO ]: Start accepts. Automaton has 7 states and 27 transitions. Word has length 5 [2018-06-26 18:02:06,492 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:06,492 INFO ]: Abstraction has 7 states and 27 transitions. [2018-06-26 18:02:06,492 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:02:06,492 INFO ]: Start isEmpty. Operand 7 states and 27 transitions. [2018-06-26 18:02:06,493 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:02:06,493 INFO ]: Found error trace [2018-06-26 18:02:06,493 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:02:06,493 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:06,493 INFO ]: Analyzing trace with hash 1392750034, now seen corresponding path program 1 times [2018-06-26 18:02:06,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:06,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:06,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:06,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:06,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:06,509 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:06,585 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:06,585 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:02:06,585 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:02:06,587 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:02:06,587 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:02:06,587 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:06,587 INFO ]: Start difference. First operand 7 states and 27 transitions. Second operand 3 states. [2018-06-26 18:02:06,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:06,965 INFO ]: Finished difference Result 9 states and 41 transitions. [2018-06-26 18:02:06,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:02:06,966 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:02:06,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:06,967 INFO ]: With dead ends: 9 [2018-06-26 18:02:06,967 INFO ]: Without dead ends: 9 [2018-06-26 18:02:06,968 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:06,968 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 18:02:06,970 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 18:02:06,970 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:02:06,971 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2018-06-26 18:02:06,971 INFO ]: Start accepts. Automaton has 9 states and 41 transitions. Word has length 6 [2018-06-26 18:02:06,971 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:06,971 INFO ]: Abstraction has 9 states and 41 transitions. [2018-06-26 18:02:06,971 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:02:06,972 INFO ]: Start isEmpty. Operand 9 states and 41 transitions. [2018-06-26 18:02:06,972 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:02:06,972 INFO ]: Found error trace [2018-06-26 18:02:06,972 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:02:06,972 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:06,972 INFO ]: Analyzing trace with hash 1392779825, now seen corresponding path program 1 times [2018-06-26 18:02:06,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:06,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:06,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:06,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:06,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:06,996 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:07,028 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:07,028 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:02:07,028 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:02:07,028 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:02:07,029 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:02:07,029 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:07,029 INFO ]: Start difference. First operand 9 states and 41 transitions. Second operand 3 states. [2018-06-26 18:02:07,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:07,300 INFO ]: Finished difference Result 11 states and 61 transitions. [2018-06-26 18:02:07,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:02:07,300 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:02:07,301 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:07,301 INFO ]: With dead ends: 11 [2018-06-26 18:02:07,301 INFO ]: Without dead ends: 11 [2018-06-26 18:02:07,301 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:07,302 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:02:07,303 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 18:02:07,303 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:02:07,304 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2018-06-26 18:02:07,304 INFO ]: Start accepts. Automaton has 10 states and 51 transitions. Word has length 6 [2018-06-26 18:02:07,304 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:07,304 INFO ]: Abstraction has 10 states and 51 transitions. [2018-06-26 18:02:07,304 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:02:07,304 INFO ]: Start isEmpty. Operand 10 states and 51 transitions. [2018-06-26 18:02:07,304 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:02:07,304 INFO ]: Found error trace [2018-06-26 18:02:07,305 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:02:07,305 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:07,305 INFO ]: Analyzing trace with hash 1392839407, now seen corresponding path program 1 times [2018-06-26 18:02:07,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:07,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:07,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:07,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:07,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:07,324 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:07,468 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:07,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:07,468 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-26 18:02:07,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:07,498 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:07,503 INFO ]: Computing forward predicates... [2018-06-26 18:02:07,519 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:07,539 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:07,539 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:02:07,539 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:02:07,539 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:02:07,539 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:02:07,539 INFO ]: Start difference. First operand 10 states and 51 transitions. Second operand 4 states. [2018-06-26 18:02:07,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:07,971 INFO ]: Finished difference Result 14 states and 93 transitions. [2018-06-26 18:02:07,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:02:07,972 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:02:07,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:07,972 INFO ]: With dead ends: 14 [2018-06-26 18:02:07,972 INFO ]: Without dead ends: 14 [2018-06-26 18:02:07,973 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:02:07,973 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:02:07,975 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-26 18:02:07,975 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:02:07,976 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2018-06-26 18:02:07,976 INFO ]: Start accepts. Automaton has 13 states and 83 transitions. Word has length 6 [2018-06-26 18:02:07,976 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:07,976 INFO ]: Abstraction has 13 states and 83 transitions. [2018-06-26 18:02:07,976 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:02:07,976 INFO ]: Start isEmpty. Operand 13 states and 83 transitions. [2018-06-26 18:02:07,976 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:02:07,976 INFO ]: Found error trace [2018-06-26 18:02:07,976 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:02:07,976 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:07,976 INFO ]: Analyzing trace with hash 1392898989, now seen corresponding path program 1 times [2018-06-26 18:02:07,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:07,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:07,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:07,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:07,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:07,987 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:08,019 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:08,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:08,019 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-26 18:02:08,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:08,052 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:08,053 INFO ]: Computing forward predicates... [2018-06-26 18:02:08,145 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:08,164 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:08,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 18:02:08,164 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:02:08,164 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:02:08,164 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:02:08,164 INFO ]: Start difference. First operand 13 states and 83 transitions. Second operand 5 states. [2018-06-26 18:02:08,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:08,853 INFO ]: Finished difference Result 28 states and 195 transitions. [2018-06-26 18:02:08,853 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:02:08,853 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 18:02:08,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:08,856 INFO ]: With dead ends: 28 [2018-06-26 18:02:08,856 INFO ]: Without dead ends: 28 [2018-06-26 18:02:08,857 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:08,857 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 18:02:08,861 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 21. [2018-06-26 18:02:08,861 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 18:02:08,862 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 143 transitions. [2018-06-26 18:02:08,862 INFO ]: Start accepts. Automaton has 21 states and 143 transitions. Word has length 6 [2018-06-26 18:02:08,862 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:08,862 INFO ]: Abstraction has 21 states and 143 transitions. [2018-06-26 18:02:08,862 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:02:08,862 INFO ]: Start isEmpty. Operand 21 states and 143 transitions. [2018-06-26 18:02:08,863 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:08,863 INFO ]: Found error trace [2018-06-26 18:02:08,863 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:08,863 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:08,863 INFO ]: Analyzing trace with hash 225133320, now seen corresponding path program 1 times [2018-06-26 18:02:08,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:08,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:08,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:08,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:08,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:08,875 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:08,912 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:08,912 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:08,912 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-26 18:02:08,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:08,953 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:08,955 INFO ]: Computing forward predicates... [2018-06-26 18:02:09,015 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:09,047 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:09,047 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 18:02:09,048 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:02:09,048 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:02:09,048 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:02:09,048 INFO ]: Start difference. First operand 21 states and 143 transitions. Second operand 6 states. [2018-06-26 18:02:09,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:09,281 INFO ]: Finished difference Result 38 states and 243 transitions. [2018-06-26 18:02:09,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:02:09,282 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 18:02:09,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:09,283 INFO ]: With dead ends: 38 [2018-06-26 18:02:09,283 INFO ]: Without dead ends: 38 [2018-06-26 18:02:09,283 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:02:09,284 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 18:02:09,289 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-06-26 18:02:09,289 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 18:02:09,290 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 204 transitions. [2018-06-26 18:02:09,290 INFO ]: Start accepts. Automaton has 30 states and 204 transitions. Word has length 7 [2018-06-26 18:02:09,290 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:09,290 INFO ]: Abstraction has 30 states and 204 transitions. [2018-06-26 18:02:09,290 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:02:09,290 INFO ]: Start isEmpty. Operand 30 states and 204 transitions. [2018-06-26 18:02:09,291 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:09,291 INFO ]: Found error trace [2018-06-26 18:02:09,291 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:09,291 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:09,292 INFO ]: Analyzing trace with hash 226027050, now seen corresponding path program 1 times [2018-06-26 18:02:09,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:09,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:09,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:09,292 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:09,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:09,303 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:09,332 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:09,332 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:02:09,332 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:02:09,333 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:02:09,333 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:02:09,333 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:09,333 INFO ]: Start difference. First operand 30 states and 204 transitions. Second operand 3 states. [2018-06-26 18:02:09,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:09,376 INFO ]: Finished difference Result 22 states and 65 transitions. [2018-06-26 18:02:09,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:02:09,376 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 18:02:09,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:09,377 INFO ]: With dead ends: 22 [2018-06-26 18:02:09,377 INFO ]: Without dead ends: 11 [2018-06-26 18:02:09,377 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:09,377 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:02:09,378 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 18:02:09,379 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:02:09,379 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-26 18:02:09,379 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2018-06-26 18:02:09,379 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:09,379 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-26 18:02:09,379 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:02:09,379 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-26 18:02:09,379 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:09,379 INFO ]: Found error trace [2018-06-26 18:02:09,379 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:09,379 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:09,379 INFO ]: Analyzing trace with hash 226950571, now seen corresponding path program 1 times [2018-06-26 18:02:09,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:09,379 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:09,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:09,380 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:09,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:09,389 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:09,421 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:09,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:09,421 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-26 18:02:09,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:09,456 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:09,457 INFO ]: Computing forward predicates... [2018-06-26 18:02:09,586 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:09,605 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:02:09,605 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-26 18:02:09,693 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:02:09,693 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:02:09,693 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:02:09,693 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 5 states. [2018-06-26 18:02:09,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:09,738 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-26 18:02:09,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:02:09,738 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 18:02:09,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:09,739 INFO ]: With dead ends: 10 [2018-06-26 18:02:09,739 INFO ]: Without dead ends: 10 [2018-06-26 18:02:09,739 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 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-26 18:02:09,739 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 18:02:09,740 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-26 18:02:09,740 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:02:09,740 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-26 18:02:09,740 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-26 18:02:09,741 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:09,741 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-26 18:02:09,741 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:02:09,741 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-26 18:02:09,741 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:09,741 INFO ]: Found error trace [2018-06-26 18:02:09,741 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:09,741 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:09,741 INFO ]: Analyzing trace with hash 227010153, now seen corresponding path program 1 times [2018-06-26 18:02:09,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:09,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:09,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:09,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:09,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:09,753 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:09,848 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:09,848 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:09,848 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-26 18:02:09,857 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:09,871 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:09,872 INFO ]: Computing forward predicates... [2018-06-26 18:02:09,924 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:09,943 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:09,944 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 18:02:09,944 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:02:09,944 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:02:09,944 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:02:09,944 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 6 states. [2018-06-26 18:02:09,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:09,990 INFO ]: Finished difference Result 12 states and 21 transitions. [2018-06-26 18:02:09,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:02:09,990 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 18:02:09,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:09,990 INFO ]: With dead ends: 12 [2018-06-26 18:02:09,990 INFO ]: Without dead ends: 12 [2018-06-26 18:02:09,990 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:09,990 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:02:09,991 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-26 18:02:09,991 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:02:09,992 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-26 18:02:09,992 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 7 [2018-06-26 18:02:09,992 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:09,992 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-26 18:02:09,992 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:02:09,992 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-26 18:02:09,992 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:09,992 INFO ]: Found error trace [2018-06-26 18:02:09,992 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:09,992 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:09,993 INFO ]: Analyzing trace with hash 227099526, now seen corresponding path program 1 times [2018-06-26 18:02:09,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:09,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:09,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:09,993 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:09,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:10,008 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:10,043 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:10,043 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:10,043 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-26 18:02:10,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:10,079 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:10,080 INFO ]: Computing forward predicates... [2018-06-26 18:02:10,143 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:10,161 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:10,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 18:02:10,162 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:02:10,162 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:02:10,162 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:02:10,162 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 6 states. [2018-06-26 18:02:10,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:10,191 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-26 18:02:10,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:02:10,192 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 18:02:10,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:10,192 INFO ]: With dead ends: 12 [2018-06-26 18:02:10,192 INFO ]: Without dead ends: 10 [2018-06-26 18:02:10,192 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:02:10,192 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 18:02:10,194 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 18:02:10,194 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:02:10,194 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-06-26 18:02:10,194 INFO ]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 7 [2018-06-26 18:02:10,194 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:10,194 INFO ]: Abstraction has 10 states and 17 transitions. [2018-06-26 18:02:10,194 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:02:10,194 INFO ]: Start isEmpty. Operand 10 states and 17 transitions. [2018-06-26 18:02:10,195 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:02:10,195 INFO ]: Found error trace [2018-06-26 18:02:10,195 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:10,195 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:10,195 INFO ]: Analyzing trace with hash -1557682228, now seen corresponding path program 1 times [2018-06-26 18:02:10,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:10,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:10,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:10,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:10,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:10,205 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:10,261 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:10,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:10,261 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-26 18:02:10,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:10,284 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:10,285 INFO ]: Computing forward predicates... [2018-06-26 18:02:10,319 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:10,337 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:10,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 18:02:10,338 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:02:10,338 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:02:10,338 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:10,338 INFO ]: Start difference. First operand 10 states and 17 transitions. Second operand 7 states. [2018-06-26 18:02:10,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:10,445 INFO ]: Finished difference Result 14 states and 25 transitions. [2018-06-26 18:02:10,445 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:02:10,445 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 18:02:10,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:10,445 INFO ]: With dead ends: 14 [2018-06-26 18:02:10,445 INFO ]: Without dead ends: 11 [2018-06-26 18:02:10,445 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:10,445 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:02:10,446 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 18:02:10,446 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:02:10,447 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-26 18:02:10,447 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 8 [2018-06-26 18:02:10,447 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:10,447 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-26 18:02:10,447 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:02:10,447 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-26 18:02:10,447 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:02:10,447 INFO ]: Found error trace [2018-06-26 18:02:10,447 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:10,447 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:10,447 INFO ]: Analyzing trace with hash -1555805395, now seen corresponding path program 2 times [2018-06-26 18:02:10,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:10,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:10,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:10,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:10,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:10,456 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:10,490 INFO ]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:10,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:10,490 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:10,499 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:10,540 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:10,540 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:10,541 INFO ]: Computing forward predicates... [2018-06-26 18:02:10,577 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:10,596 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:02:10,596 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-26 18:02:10,596 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:02:10,596 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:02:10,596 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:02:10,597 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 6 states. [2018-06-26 18:02:10,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:10,630 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-26 18:02:10,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:02:10,630 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-26 18:02:10,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:10,630 INFO ]: With dead ends: 11 [2018-06-26 18:02:10,631 INFO ]: Without dead ends: 11 [2018-06-26 18:02:10,631 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:02:10,631 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:02:10,632 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 18:02:10,632 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:02:10,632 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-26 18:02:10,632 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 8 [2018-06-26 18:02:10,632 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:10,632 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-26 18:02:10,632 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:02:10,632 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-26 18:02:10,632 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:02:10,632 INFO ]: Found error trace [2018-06-26 18:02:10,632 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:10,633 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:10,633 INFO ]: Analyzing trace with hash -1555716022, now seen corresponding path program 2 times [2018-06-26 18:02:10,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:10,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:10,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:10,633 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:10,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:10,643 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:10,778 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:10,778 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:10,778 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-26 18:02:10,784 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:10,831 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:10,831 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:10,832 INFO ]: Computing forward predicates... [2018-06-26 18:02:10,882 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:10,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:10,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 18:02:10,908 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:02:10,908 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:02:10,909 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:10,909 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2018-06-26 18:02:11,017 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:11,017 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-26 18:02:11,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:02:11,017 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 18:02:11,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:11,017 INFO ]: With dead ends: 12 [2018-06-26 18:02:11,017 INFO ]: Without dead ends: 12 [2018-06-26 18:02:11,018 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:02:11,018 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:02:11,019 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-26 18:02:11,019 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:02:11,019 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-26 18:02:11,019 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-26 18:02:11,019 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:11,019 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-26 18:02:11,019 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:02:11,019 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-26 18:02:11,019 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:02:11,019 INFO ]: Found error trace [2018-06-26 18:02:11,019 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:11,020 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:11,021 INFO ]: Analyzing trace with hash -990389368, now seen corresponding path program 2 times [2018-06-26 18:02:11,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:11,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:11,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:11,021 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:11,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:11,036 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:11,337 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:11,337 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:11,337 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-26 18:02:11,343 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:11,360 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:11,360 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:11,362 INFO ]: Computing forward predicates... [2018-06-26 18:02:11,401 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:11,420 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:11,420 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 18:02:11,420 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:02:11,420 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:02:11,420 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:11,420 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-06-26 18:02:11,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:11,469 INFO ]: Finished difference Result 14 states and 22 transitions. [2018-06-26 18:02:11,469 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:02:11,469 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-26 18:02:11,469 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:11,470 INFO ]: With dead ends: 14 [2018-06-26 18:02:11,470 INFO ]: Without dead ends: 14 [2018-06-26 18:02:11,470 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:02:11,470 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:02:11,471 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-26 18:02:11,471 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:02:11,471 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-26 18:02:11,471 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 9 [2018-06-26 18:02:11,471 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:11,471 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-26 18:02:11,471 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:02:11,471 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-26 18:02:11,472 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:02:11,472 INFO ]: Found error trace [2018-06-26 18:02:11,472 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:11,472 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:11,472 INFO ]: Analyzing trace with hash -988423162, now seen corresponding path program 3 times [2018-06-26 18:02:11,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:11,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:11,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:11,472 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:11,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:11,481 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:11,608 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:11,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:11,609 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-26 18:02:11,615 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:02:11,652 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:02:11,652 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:11,653 INFO ]: Computing forward predicates... [2018-06-26 18:02:11,689 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:11,712 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:02:11,712 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-26 18:02:11,712 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:02:11,712 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:02:11,712 INFO ]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:11,712 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 7 states. [2018-06-26 18:02:11,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:11,758 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-26 18:02:11,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:02:11,758 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-26 18:02:11,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:11,758 INFO ]: With dead ends: 15 [2018-06-26 18:02:11,758 INFO ]: Without dead ends: 15 [2018-06-26 18:02:11,758 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:02:11,758 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:02:11,760 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-26 18:02:11,760 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:02:11,760 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-26 18:02:11,760 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 9 [2018-06-26 18:02:11,760 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:11,760 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-26 18:02:11,760 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:02:11,760 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-26 18:02:11,760 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:02:11,760 INFO ]: Found error trace [2018-06-26 18:02:11,760 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:11,760 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:11,760 INFO ]: Analyzing trace with hash -987618805, now seen corresponding path program 1 times [2018-06-26 18:02:11,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:11,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:11,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:11,761 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:11,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:11,770 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:11,819 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:11,819 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:11,819 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:11,827 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:11,853 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:11,855 INFO ]: Computing forward predicates... [2018-06-26 18:02:11,980 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:11,999 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:11,999 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-26 18:02:11,999 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:02:11,999 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:02:11,999 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:02:11,999 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 9 states. [2018-06-26 18:02:12,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:12,053 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-26 18:02:12,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:02:12,053 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-26 18:02:12,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:12,053 INFO ]: With dead ends: 15 [2018-06-26 18:02:12,053 INFO ]: Without dead ends: 12 [2018-06-26 18:02:12,054 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:02:12,054 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:02:12,054 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 18:02:12,055 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:02:12,055 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-26 18:02:12,055 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 9 [2018-06-26 18:02:12,055 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:12,055 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-26 18:02:12,055 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:02:12,055 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-26 18:02:12,055 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:02:12,055 INFO ]: Found error trace [2018-06-26 18:02:12,055 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:12,055 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:12,055 INFO ]: Analyzing trace with hash -637744110, now seen corresponding path program 3 times [2018-06-26 18:02:12,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:12,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:12,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:12,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:12,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:12,065 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:12,658 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:12,659 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:12,659 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:02:12,673 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:12,750 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:02:12,750 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:12,752 INFO ]: Computing forward predicates... [2018-06-26 18:02:13,328 WARN ]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-26 18:02:13,331 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:13,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:13,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-26 18:02:13,350 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:02:13,350 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:02:13,350 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:02:13,350 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 10 states. [2018-06-26 18:02:13,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:13,625 INFO ]: Finished difference Result 18 states and 27 transitions. [2018-06-26 18:02:13,626 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:02:13,626 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-26 18:02:13,626 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:13,626 INFO ]: With dead ends: 18 [2018-06-26 18:02:13,626 INFO ]: Without dead ends: 12 [2018-06-26 18:02:13,626 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:02:13,626 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:02:13,627 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 18:02:13,627 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:02:13,627 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-26 18:02:13,627 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 10 [2018-06-26 18:02:13,627 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:13,627 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-26 18:02:13,627 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:02:13,627 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-26 18:02:13,627 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:02:13,627 INFO ]: Found error trace [2018-06-26 18:02:13,627 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:13,627 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:13,627 INFO ]: Analyzing trace with hash -584179892, now seen corresponding path program 4 times [2018-06-26 18:02:13,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:13,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:13,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:13,628 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:13,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:13,637 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:13,892 INFO ]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:13,892 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:13,892 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-26 18:02:13,897 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:02:13,915 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:02:13,915 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:13,916 INFO ]: Computing forward predicates... [2018-06-26 18:02:14,337 INFO ]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:14,368 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:14,368 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-26 18:02:14,368 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:02:14,369 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:02:14,369 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:02:14,369 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 9 states. [2018-06-26 18:02:14,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:14,488 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-26 18:02:14,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:02:14,489 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 18:02:14,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:14,489 INFO ]: With dead ends: 14 [2018-06-26 18:02:14,489 INFO ]: Without dead ends: 14 [2018-06-26 18:02:14,489 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:02:14,489 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:02:14,490 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-26 18:02:14,490 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:02:14,490 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-26 18:02:14,490 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 10 [2018-06-26 18:02:14,491 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:14,491 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-26 18:02:14,491 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:02:14,491 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-26 18:02:14,491 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:02:14,491 INFO ]: Found error trace [2018-06-26 18:02:14,491 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:14,491 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:14,491 INFO ]: Analyzing trace with hash -581409329, now seen corresponding path program 2 times [2018-06-26 18:02:14,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:14,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:14,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:14,492 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:14,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:14,505 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:14,667 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:14,667 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:14,667 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-26 18:02:14,679 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:14,697 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:14,697 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:14,699 INFO ]: Computing forward predicates... [2018-06-26 18:02:14,737 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:14,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:14,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-26 18:02:14,756 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:02:14,757 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:02:14,757 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:02:14,757 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 9 states. [2018-06-26 18:02:14,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:14,831 INFO ]: Finished difference Result 16 states and 23 transitions. [2018-06-26 18:02:14,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:02:14,831 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 18:02:14,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:14,831 INFO ]: With dead ends: 16 [2018-06-26 18:02:14,831 INFO ]: Without dead ends: 16 [2018-06-26 18:02:14,831 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:02:14,831 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 18:02:14,833 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-26 18:02:14,833 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:02:14,833 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-26 18:02:14,833 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 10 [2018-06-26 18:02:14,833 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:14,833 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-26 18:02:14,833 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:02:14,833 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-26 18:02:14,833 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:02:14,833 INFO ]: Found error trace [2018-06-26 18:02:14,833 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:14,833 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:14,833 INFO ]: Analyzing trace with hash -579562287, now seen corresponding path program 1 times [2018-06-26 18:02:14,833 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:14,833 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:14,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:14,834 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:14,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:14,842 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:14,972 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:14,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:14,972 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-26 18:02:14,979 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:14,996 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:14,997 INFO ]: Computing forward predicates... [2018-06-26 18:02:15,360 WARN ]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-26 18:02:15,366 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:15,384 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:15,384 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-26 18:02:15,384 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:02:15,384 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:02:15,385 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:02:15,385 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 10 states. [2018-06-26 18:02:15,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:15,623 INFO ]: Finished difference Result 16 states and 23 transitions. [2018-06-26 18:02:15,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:02:15,623 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-26 18:02:15,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:15,624 INFO ]: With dead ends: 16 [2018-06-26 18:02:15,624 INFO ]: Without dead ends: 13 [2018-06-26 18:02:15,624 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:02:15,624 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:02:15,625 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 18:02:15,625 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:02:15,625 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-26 18:02:15,625 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 [2018-06-26 18:02:15,626 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:15,626 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-26 18:02:15,626 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:02:15,626 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-26 18:02:15,626 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:02:15,626 INFO ]: Found error trace [2018-06-26 18:02:15,626 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:15,626 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:15,626 INFO ]: Analyzing trace with hash -930152242, now seen corresponding path program 5 times [2018-06-26 18:02:15,626 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:15,626 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:15,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:15,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:15,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:15,640 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:15,827 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:15,827 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:15,827 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-26 18:02:15,833 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:02:15,889 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:02:15,889 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:15,891 INFO ]: Computing forward predicates... [2018-06-26 18:02:16,018 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:16,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:16,038 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-26 18:02:16,038 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:02:16,038 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:02:16,038 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:02:16,038 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 11 states. [2018-06-26 18:02:16,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:16,117 INFO ]: Finished difference Result 18 states and 28 transitions. [2018-06-26 18:02:16,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:02:16,117 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-26 18:02:16,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:16,118 INFO ]: With dead ends: 18 [2018-06-26 18:02:16,118 INFO ]: Without dead ends: 14 [2018-06-26 18:02:16,118 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:02:16,118 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:02:16,119 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-26 18:02:16,119 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:02:16,119 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-26 18:02:16,119 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2018-06-26 18:02:16,119 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:16,119 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-26 18:02:16,119 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:02:16,119 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-26 18:02:16,119 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:02:16,119 INFO ]: Found error trace [2018-06-26 18:02:16,119 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:16,120 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:16,120 INFO ]: Analyzing trace with hash -873817461, now seen corresponding path program 3 times [2018-06-26 18:02:16,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:16,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:16,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:16,120 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:16,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:16,128 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:16,165 INFO ]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:16,165 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:16,165 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-26 18:02:16,171 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:02:16,192 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:02:16,192 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:16,193 INFO ]: Computing forward predicates... [2018-06-26 18:02:16,359 INFO ]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:16,378 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:16,378 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-26 18:02:16,378 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:02:16,378 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:02:16,378 INFO ]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:02:16,379 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 10 states. [2018-06-26 18:02:16,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:16,463 INFO ]: Finished difference Result 16 states and 20 transitions. [2018-06-26 18:02:16,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:02:16,465 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-26 18:02:16,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:16,465 INFO ]: With dead ends: 16 [2018-06-26 18:02:16,465 INFO ]: Without dead ends: 16 [2018-06-26 18:02:16,465 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:02:16,465 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 18:02:16,467 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-26 18:02:16,467 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:02:16,467 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-26 18:02:16,467 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2018-06-26 18:02:16,467 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:16,467 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-26 18:02:16,467 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:02:16,467 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-26 18:02:16,467 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:02:16,467 INFO ]: Found error trace [2018-06-26 18:02:16,467 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:16,467 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:16,467 INFO ]: Analyzing trace with hash -871970419, now seen corresponding path program 2 times [2018-06-26 18:02:16,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:16,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:16,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:16,468 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:16,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:16,487 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:16,630 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:16,630 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:16,630 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-26 18:02:16,636 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:16,655 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:16,655 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:16,657 INFO ]: Computing forward predicates... [2018-06-26 18:02:16,698 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:16,717 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:16,717 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-26 18:02:16,717 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:02:16,717 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:02:16,717 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:02:16,717 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 10 states. [2018-06-26 18:02:16,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:16,855 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-26 18:02:16,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:02:16,855 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-26 18:02:16,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:16,855 INFO ]: With dead ends: 17 [2018-06-26 18:02:16,855 INFO ]: Without dead ends: 17 [2018-06-26 18:02:16,855 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:02:16,855 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:02:16,856 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-26 18:02:16,856 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:02:16,856 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2018-06-26 18:02:16,857 INFO ]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 11 [2018-06-26 18:02:16,857 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:16,857 INFO ]: Abstraction has 14 states and 22 transitions. [2018-06-26 18:02:16,857 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:02:16,857 INFO ]: Start isEmpty. Operand 14 states and 22 transitions. [2018-06-26 18:02:16,857 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:02:16,857 INFO ]: Found error trace [2018-06-26 18:02:16,857 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:16,857 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:16,857 INFO ]: Analyzing trace with hash -869199856, now seen corresponding path program 1 times [2018-06-26 18:02:16,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:16,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:16,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:16,858 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:16,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:16,869 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:16,963 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:16,963 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:16,964 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-26 18:02:16,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:16,990 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:16,991 INFO ]: Computing forward predicates... [2018-06-26 18:02:17,528 WARN ]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-26 18:02:17,530 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:17,549 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:17,549 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-26 18:02:17,550 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:02:17,550 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:02:17,550 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:02:17,550 INFO ]: Start difference. First operand 14 states and 22 transitions. Second operand 11 states. [2018-06-26 18:02:17,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:17,673 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-26 18:02:17,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:02:17,673 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-26 18:02:17,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:17,673 INFO ]: With dead ends: 17 [2018-06-26 18:02:17,673 INFO ]: Without dead ends: 14 [2018-06-26 18:02:17,673 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:02:17,673 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:02:17,674 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 18:02:17,674 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:02:17,674 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-26 18:02:17,674 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 11 [2018-06-26 18:02:17,674 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:17,674 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-26 18:02:17,674 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:02:17,675 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-26 18:02:17,675 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:02:17,675 INFO ]: Found error trace [2018-06-26 18:02:17,675 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:17,675 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:17,675 INFO ]: Analyzing trace with hash -1404869742, now seen corresponding path program 6 times [2018-06-26 18:02:17,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:17,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:17,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:17,675 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:17,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:17,684 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:17,748 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:17,749 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:17,749 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-26 18:02:17,755 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:02:17,805 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 18:02:17,805 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:17,807 INFO ]: Computing forward predicates... [2018-06-26 18:02:18,257 WARN ]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-26 18:02:18,259 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:18,279 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:18,279 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-26 18:02:18,279 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:02:18,280 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:02:18,280 INFO ]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:02:18,280 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 12 states. [2018-06-26 18:02:18,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:18,378 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-26 18:02:18,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:02:18,378 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-26 18:02:18,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:18,378 INFO ]: With dead ends: 19 [2018-06-26 18:02:18,378 INFO ]: Without dead ends: 15 [2018-06-26 18:02:18,378 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:02:18,378 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:02:18,379 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-26 18:02:18,379 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:02:18,379 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-26 18:02:18,379 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 12 [2018-06-26 18:02:18,379 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:18,379 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-26 18:02:18,379 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:02:18,380 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-26 18:02:18,380 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:02:18,380 INFO ]: Found error trace [2018-06-26 18:02:18,380 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:18,380 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:18,380 INFO ]: Analyzing trace with hash -1346687919, now seen corresponding path program 3 times [2018-06-26 18:02:18,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:18,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:18,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:18,380 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:18,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:18,388 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:18,438 INFO ]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:18,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:18,438 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-26 18:02:18,444 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:02:18,471 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 18:02:18,472 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:18,473 INFO ]: Computing forward predicates... [2018-06-26 18:02:18,544 INFO ]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:18,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:18,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-26 18:02:18,563 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:02:18,563 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:02:18,563 INFO ]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:02:18,564 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 11 states. [2018-06-26 18:02:18,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:18,662 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-26 18:02:18,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:02:18,663 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-26 18:02:18,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:18,663 INFO ]: With dead ends: 17 [2018-06-26 18:02:18,663 INFO ]: Without dead ends: 17 [2018-06-26 18:02:18,663 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:02:18,663 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:02:18,664 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-26 18:02:18,664 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:02:18,664 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-26 18:02:18,664 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 12 [2018-06-26 18:02:18,664 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:18,664 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-26 18:02:18,664 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:02:18,664 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-26 18:02:18,664 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:02:18,664 INFO ]: Found error trace [2018-06-26 18:02:18,664 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:18,664 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:18,664 INFO ]: Analyzing trace with hash -1343917356, now seen corresponding path program 2 times [2018-06-26 18:02:18,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:18,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:18,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:18,665 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:18,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:18,686 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:18,939 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:18,939 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:18,939 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-26 18:02:19,044 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:19,069 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:19,069 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:19,071 INFO ]: Computing forward predicates... [2018-06-26 18:02:19,108 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:19,126 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:19,126 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-26 18:02:19,126 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:02:19,126 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:02:19,126 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:02:19,127 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 11 states. [2018-06-26 18:02:19,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:19,233 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-26 18:02:19,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:02:19,233 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-26 18:02:19,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:19,233 INFO ]: With dead ends: 17 [2018-06-26 18:02:19,233 INFO ]: Without dead ends: 17 [2018-06-26 18:02:19,233 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:02:19,233 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:02:19,234 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-26 18:02:19,234 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 18:02:19,235 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-26 18:02:19,235 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 12 [2018-06-26 18:02:19,235 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:19,235 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-26 18:02:19,235 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:02:19,235 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-26 18:02:19,235 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:02:19,235 INFO ]: Found error trace [2018-06-26 18:02:19,235 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:19,235 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:19,235 INFO ]: Analyzing trace with hash 1058756942, now seen corresponding path program 7 times [2018-06-26 18:02:19,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:19,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:19,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:19,236 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:19,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:19,262 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:19,371 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:19,371 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:19,371 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-26 18:02:19,377 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:19,399 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:19,401 INFO ]: Computing forward predicates... [2018-06-26 18:02:19,435 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:19,454 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:19,454 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 18:02:19,454 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:02:19,454 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:02:19,454 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:02:19,454 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 11 states. [2018-06-26 18:02:19,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:19,553 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-26 18:02:19,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:02:19,553 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-26 18:02:19,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:19,553 INFO ]: With dead ends: 20 [2018-06-26 18:02:19,553 INFO ]: Without dead ends: 20 [2018-06-26 18:02:19,554 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:02:19,554 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 18:02:19,555 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-26 18:02:19,555 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:02:19,556 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-26 18:02:19,556 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 13 [2018-06-26 18:02:19,556 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:19,556 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-26 18:02:19,556 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:02:19,556 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-26 18:02:19,556 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:02:19,556 INFO ]: Found error trace [2018-06-26 18:02:19,556 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:19,556 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:19,556 INFO ]: Analyzing trace with hash 1119709328, now seen corresponding path program 3 times [2018-06-26 18:02:19,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:19,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:19,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:19,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:19,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:19,566 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:19,630 INFO ]: Checked inductivity of 36 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:19,630 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:19,630 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-26 18:02:19,636 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:02:19,673 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 18:02:19,673 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:19,674 INFO ]: Computing forward predicates... [2018-06-26 18:02:19,791 INFO ]: Checked inductivity of 36 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:19,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:19,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-26 18:02:19,822 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:02:19,822 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:02:19,822 INFO ]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:02:19,823 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 12 states. [2018-06-26 18:02:19,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:19,909 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-26 18:02:19,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:02:19,911 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-26 18:02:19,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:19,911 INFO ]: With dead ends: 22 [2018-06-26 18:02:19,911 INFO ]: Without dead ends: 22 [2018-06-26 18:02:19,912 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:02:19,912 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 18:02:19,913 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-26 18:02:19,913 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:02:19,913 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-26 18:02:19,913 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 13 [2018-06-26 18:02:19,913 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:19,913 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-26 18:02:19,913 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:02:19,913 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-26 18:02:19,913 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:02:19,913 INFO ]: Found error trace [2018-06-26 18:02:19,913 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:19,913 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:19,914 INFO ]: Analyzing trace with hash 1144644395, now seen corresponding path program 4 times [2018-06-26 18:02:19,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:19,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:19,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:19,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:19,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:19,926 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:20,025 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:20,025 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:20,025 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-26 18:02:20,031 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:02:20,054 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:02:20,054 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:20,055 INFO ]: Computing forward predicates... [2018-06-26 18:02:20,751 WARN ]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-26 18:02:21,772 WARN ]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-26 18:02:21,775 INFO ]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:21,793 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:21,793 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-26 18:02:21,793 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:02:21,793 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:02:21,793 INFO ]: CoverageRelationStatistics Valid=46, Invalid=135, Unknown=1, NotChecked=0, Total=182 [2018-06-26 18:02:21,794 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 14 states. [2018-06-26 18:02:22,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:22,138 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-26 18:02:22,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:02:22,141 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-26 18:02:22,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:22,141 INFO ]: With dead ends: 20 [2018-06-26 18:02:22,141 INFO ]: Without dead ends: 16 [2018-06-26 18:02:22,142 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=52, Invalid=157, Unknown=1, NotChecked=0, Total=210 [2018-06-26 18:02:22,142 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 18:02:22,143 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 18:02:22,143 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:02:22,143 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-06-26 18:02:22,143 INFO ]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 13 [2018-06-26 18:02:22,143 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:22,143 INFO ]: Abstraction has 16 states and 21 transitions. [2018-06-26 18:02:22,143 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:02:22,143 INFO ]: Start isEmpty. Operand 16 states and 21 transitions. [2018-06-26 18:02:22,143 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:02:22,143 INFO ]: Found error trace [2018-06-26 18:02:22,143 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:22,143 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:22,143 INFO ]: Analyzing trace with hash -1538717940, now seen corresponding path program 8 times [2018-06-26 18:02:22,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:22,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:22,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:22,144 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:22,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:22,158 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:22,258 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:22,258 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:22,258 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-26 18:02:22,264 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:22,311 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:22,311 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:22,313 INFO ]: Computing forward predicates... [2018-06-26 18:02:23,653 WARN ]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-26 18:02:23,655 INFO ]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:23,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:23,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-26 18:02:23,674 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:02:23,674 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:02:23,674 INFO ]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2018-06-26 18:02:23,674 INFO ]: Start difference. First operand 16 states and 21 transitions. Second operand 15 states. [2018-06-26 18:02:24,569 WARN ]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-26 18:02:25,110 WARN ]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-06-26 18:02:25,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:25,221 INFO ]: Finished difference Result 24 states and 33 transitions. [2018-06-26 18:02:25,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:02:25,222 INFO ]: Start accepts. Automaton has 15 states. Word has length 14 [2018-06-26 18:02:25,222 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:25,222 INFO ]: With dead ends: 24 [2018-06-26 18:02:25,222 INFO ]: Without dead ends: 16 [2018-06-26 18:02:25,223 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=72, Invalid=268, Unknown=2, NotChecked=0, Total=342 [2018-06-26 18:02:25,223 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 18:02:25,224 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 18:02:25,224 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:02:25,224 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-06-26 18:02:25,224 INFO ]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 14 [2018-06-26 18:02:25,224 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:25,224 INFO ]: Abstraction has 16 states and 23 transitions. [2018-06-26 18:02:25,224 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:02:25,224 INFO ]: Start isEmpty. Operand 16 states and 23 transitions. [2018-06-26 18:02:25,224 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:02:25,224 INFO ]: Found error trace [2018-06-26 18:02:25,224 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:25,224 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:25,224 INFO ]: Analyzing trace with hash 121772818, now seen corresponding path program 9 times [2018-06-26 18:02:25,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:25,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:25,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:25,225 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:25,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:25,249 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:25,483 INFO ]: Checked inductivity of 45 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:25,483 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:25,483 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-26 18:02:25,488 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:02:25,515 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:02:25,515 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:25,517 INFO ]: Computing forward predicates... [2018-06-26 18:02:25,853 WARN ]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-26 18:02:25,856 INFO ]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:25,874 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:25,874 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-26 18:02:25,874 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:02:25,874 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:02:25,874 INFO ]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:02:25,874 INFO ]: Start difference. First operand 16 states and 23 transitions. Second operand 14 states. [2018-06-26 18:02:26,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:26,022 INFO ]: Finished difference Result 19 states and 26 transitions. [2018-06-26 18:02:26,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:02:26,023 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-26 18:02:26,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:26,023 INFO ]: With dead ends: 19 [2018-06-26 18:02:26,023 INFO ]: Without dead ends: 19 [2018-06-26 18:02:26,023 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:02:26,023 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 18:02:26,024 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-26 18:02:26,024 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 18:02:26,024 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-26 18:02:26,024 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 14 [2018-06-26 18:02:26,024 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:26,024 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-26 18:02:26,024 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:02:26,024 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-26 18:02:26,025 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:02:26,025 INFO ]: Found error trace [2018-06-26 18:02:26,025 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:26,025 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:26,025 INFO ]: Analyzing trace with hash 207660271, now seen corresponding path program 5 times [2018-06-26 18:02:26,025 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:26,025 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:26,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:26,025 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:26,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:26,053 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:26,222 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:26,222 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:26,222 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-26 18:02:26,228 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:02:26,321 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-26 18:02:26,321 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:26,323 INFO ]: Computing forward predicates... [2018-06-26 18:02:26,505 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:26,524 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:26,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-26 18:02:26,524 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:02:26,524 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:02:26,524 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:02:26,524 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 13 states. [2018-06-26 18:02:26,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:26,658 INFO ]: Finished difference Result 21 states and 28 transitions. [2018-06-26 18:02:26,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:02:26,658 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-26 18:02:26,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:26,658 INFO ]: With dead ends: 21 [2018-06-26 18:02:26,658 INFO ]: Without dead ends: 21 [2018-06-26 18:02:26,659 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:02:26,659 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 18:02:26,660 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-26 18:02:26,660 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 18:02:26,660 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-26 18:02:26,660 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 14 [2018-06-26 18:02:26,660 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:26,660 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-26 18:02:26,660 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:02:26,660 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-26 18:02:26,660 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:02:26,660 INFO ]: Found error trace [2018-06-26 18:02:26,660 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:26,660 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:26,660 INFO ]: Analyzing trace with hash 264918573, now seen corresponding path program 4 times [2018-06-26 18:02:26,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:26,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:26,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:26,661 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:26,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:26,676 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:27,492 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:27,492 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:27,492 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-26 18:02:27,503 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:02:27,530 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:02:27,530 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:27,532 INFO ]: Computing forward predicates... [2018-06-26 18:02:28,112 WARN ]: Spent 482.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-26 18:02:29,005 WARN ]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-26 18:02:29,008 INFO ]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:29,036 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:29,037 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-26 18:02:29,037 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:02:29,037 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:02:29,037 INFO ]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2018-06-26 18:02:29,037 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 15 states. [2018-06-26 18:02:31,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:31,200 INFO ]: Finished difference Result 21 states and 28 transitions. [2018-06-26 18:02:31,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:02:31,201 INFO ]: Start accepts. Automaton has 15 states. Word has length 14 [2018-06-26 18:02:31,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:31,202 INFO ]: With dead ends: 21 [2018-06-26 18:02:31,202 INFO ]: Without dead ends: 17 [2018-06-26 18:02:31,202 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2018-06-26 18:02:31,202 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:02:31,203 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 18:02:31,203 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 18:02:31,203 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-06-26 18:02:31,205 INFO ]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 14 [2018-06-26 18:02:31,205 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:31,205 INFO ]: Abstraction has 17 states and 23 transitions. [2018-06-26 18:02:31,205 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:02:31,205 INFO ]: Start isEmpty. Operand 17 states and 23 transitions. [2018-06-26 18:02:31,205 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:02:31,205 INFO ]: Found error trace [2018-06-26 18:02:31,205 INFO ]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:31,205 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:31,205 INFO ]: Analyzing trace with hash -520454712, now seen corresponding path program 10 times [2018-06-26 18:02:31,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:31,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:31,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:31,206 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:31,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:31,218 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:32,052 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:32,052 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:32,052 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-26 18:02:32,058 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:02:32,115 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:02:32,115 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:32,117 INFO ]: Computing forward predicates... [2018-06-26 18:02:33,370 INFO ]: Checked inductivity of 55 backedges. 0 proven. 54 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:33,388 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:33,388 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-26 18:02:33,388 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:02:33,388 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:02:33,388 INFO ]: CoverageRelationStatistics Valid=63, Invalid=176, Unknown=1, NotChecked=0, Total=240 [2018-06-26 18:02:33,388 INFO ]: Start difference. First operand 17 states and 23 transitions. Second operand 16 states. [2018-06-26 18:02:33,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:33,481 INFO ]: Finished difference Result 23 states and 33 transitions. [2018-06-26 18:02:33,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:02:33,481 INFO ]: Start accepts. Automaton has 16 states. Word has length 15 [2018-06-26 18:02:33,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:33,481 INFO ]: With dead ends: 23 [2018-06-26 18:02:33,481 INFO ]: Without dead ends: 18 [2018-06-26 18:02:33,481 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=69, Invalid=202, Unknown=1, NotChecked=0, Total=272 [2018-06-26 18:02:33,481 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 18:02:33,482 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-06-26 18:02:33,482 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 18:02:33,483 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-06-26 18:02:33,483 INFO ]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 15 [2018-06-26 18:02:33,483 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:33,483 INFO ]: Abstraction has 17 states and 21 transitions. [2018-06-26 18:02:33,483 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:02:33,483 INFO ]: Start isEmpty. Operand 17 states and 21 transitions. [2018-06-26 18:02:33,483 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:02:33,483 INFO ]: Found error trace [2018-06-26 18:02:33,483 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:33,483 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:33,483 INFO ]: Analyzing trace with hash 1225923499, now seen corresponding path program 6 times [2018-06-26 18:02:33,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:33,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:33,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:33,484 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:33,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:33,494 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:33,617 INFO ]: Checked inductivity of 55 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:33,617 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:33,617 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-26 18:02:33,622 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:02:33,650 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 18:02:33,651 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:33,652 INFO ]: Computing forward predicates... [2018-06-26 18:02:33,850 INFO ]: Checked inductivity of 55 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:33,868 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:33,868 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-26 18:02:33,869 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:02:33,869 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:02:33,869 INFO ]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:02:33,869 INFO ]: Start difference. First operand 17 states and 21 transitions. Second operand 15 states. [2018-06-26 18:02:33,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:33,945 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-26 18:02:33,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:02:33,945 INFO ]: Start accepts. Automaton has 15 states. Word has length 15 [2018-06-26 18:02:33,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:33,945 INFO ]: With dead ends: 22 [2018-06-26 18:02:33,945 INFO ]: Without dead ends: 22 [2018-06-26 18:02:33,945 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:02:33,945 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 18:02:33,946 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-06-26 18:02:33,946 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 18:02:33,946 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-06-26 18:02:33,946 INFO ]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 15 [2018-06-26 18:02:33,946 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:33,946 INFO ]: Abstraction has 17 states and 21 transitions. [2018-06-26 18:02:33,946 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:02:33,946 INFO ]: Start isEmpty. Operand 17 states and 21 transitions. [2018-06-26 18:02:33,947 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:02:33,947 INFO ]: Found error trace [2018-06-26 18:02:33,947 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:33,947 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:33,947 INFO ]: Analyzing trace with hash 1283181801, now seen corresponding path program 5 times [2018-06-26 18:02:33,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:33,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:33,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:33,947 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:33,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:33,969 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:34,845 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:34,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:34,845 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-26 18:02:34,850 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:02:34,880 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-26 18:02:34,880 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:34,882 INFO ]: Computing forward predicates... [2018-06-26 18:02:34,940 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:34,968 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:34,968 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-26 18:02:34,968 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:02:34,968 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:02:34,968 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:02:34,968 INFO ]: Start difference. First operand 17 states and 21 transitions. Second operand 14 states. [2018-06-26 18:02:35,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:35,086 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-26 18:02:35,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:02:35,087 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-26 18:02:35,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:35,087 INFO ]: With dead ends: 22 [2018-06-26 18:02:35,087 INFO ]: Without dead ends: 22 [2018-06-26 18:02:35,087 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:02:35,087 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 18:02:35,088 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-06-26 18:02:35,088 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 18:02:35,089 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2018-06-26 18:02:35,089 INFO ]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 15 [2018-06-26 18:02:35,089 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:35,089 INFO ]: Abstraction has 18 states and 26 transitions. [2018-06-26 18:02:35,089 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:02:35,089 INFO ]: Start isEmpty. Operand 18 states and 26 transitions. [2018-06-26 18:02:35,089 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:02:35,089 INFO ]: Found error trace [2018-06-26 18:02:35,089 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:35,089 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:35,089 INFO ]: Analyzing trace with hash 1369069254, now seen corresponding path program 4 times [2018-06-26 18:02:35,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:35,089 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:35,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:35,090 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:35,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:35,111 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:35,274 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:35,274 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:35,274 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:35,281 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:02:35,309 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:02:35,309 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:35,310 INFO ]: Computing forward predicates... [2018-06-26 18:02:35,891 WARN ]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-26 18:02:36,753 WARN ]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-26 18:02:36,755 INFO ]: Checked inductivity of 55 backedges. 0 proven. 54 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:36,774 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:36,774 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-26 18:02:36,774 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:02:36,774 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:02:36,774 INFO ]: CoverageRelationStatistics Valid=63, Invalid=176, Unknown=1, NotChecked=0, Total=240 [2018-06-26 18:02:36,774 INFO ]: Start difference. First operand 18 states and 26 transitions. Second operand 16 states. [2018-06-26 18:02:37,476 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:37,476 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-26 18:02:37,476 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:02:37,476 INFO ]: Start accepts. Automaton has 16 states. Word has length 15 [2018-06-26 18:02:37,476 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:37,476 INFO ]: With dead ends: 22 [2018-06-26 18:02:37,477 INFO ]: Without dead ends: 18 [2018-06-26 18:02:37,477 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=69, Invalid=202, Unknown=1, NotChecked=0, Total=272 [2018-06-26 18:02:37,477 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 18:02:37,478 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 18:02:37,479 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 18:02:37,479 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-06-26 18:02:37,479 INFO ]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-06-26 18:02:37,479 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:37,479 INFO ]: Abstraction has 18 states and 25 transitions. [2018-06-26 18:02:37,479 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:02:37,479 INFO ]: Start isEmpty. Operand 18 states and 25 transitions. [2018-06-26 18:02:37,480 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:02:37,480 INFO ]: Found error trace [2018-06-26 18:02:37,480 INFO ]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:37,480 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:37,480 INFO ]: Analyzing trace with hash 980934284, now seen corresponding path program 11 times [2018-06-26 18:02:37,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:37,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:37,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:37,481 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:37,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:37,494 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:37,700 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:37,700 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:37,700 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:37,705 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:02:37,738 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 18:02:37,738 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:37,740 INFO ]: Computing forward predicates... [2018-06-26 18:02:38,374 WARN ]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-26 18:02:38,404 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:38,422 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:38,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-26 18:02:38,423 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:02:38,423 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:02:38,423 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:02:38,423 INFO ]: Start difference. First operand 18 states and 25 transitions. Second operand 17 states. [2018-06-26 18:02:39,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:39,263 INFO ]: Finished difference Result 24 states and 35 transitions. [2018-06-26 18:02:39,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:02:39,264 INFO ]: Start accepts. Automaton has 17 states. Word has length 16 [2018-06-26 18:02:39,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:39,264 INFO ]: With dead ends: 24 [2018-06-26 18:02:39,264 INFO ]: Without dead ends: 19 [2018-06-26 18:02:39,265 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:02:39,265 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 18:02:39,266 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-06-26 18:02:39,266 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 18:02:39,266 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-26 18:02:39,266 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 16 [2018-06-26 18:02:39,266 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:39,266 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-26 18:02:39,266 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:02:39,266 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-26 18:02:39,266 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:02:39,266 INFO ]: Found error trace [2018-06-26 18:02:39,266 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:39,266 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:39,266 INFO ]: Analyzing trace with hash -1510396499, now seen corresponding path program 6 times [2018-06-26 18:02:39,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:39,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:39,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:39,267 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:39,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:39,276 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:39,723 INFO ]: Checked inductivity of 66 backedges. 39 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:39,723 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:39,723 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:39,731 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:02:39,777 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 18:02:39,777 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:39,779 INFO ]: Computing forward predicates... [2018-06-26 18:02:40,240 WARN ]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-26 18:02:40,242 INFO ]: Checked inductivity of 66 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:40,261 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:40,261 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-26 18:02:40,261 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:02:40,261 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:02:40,261 INFO ]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:02:40,261 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 16 states. [2018-06-26 18:02:40,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:40,347 INFO ]: Finished difference Result 23 states and 27 transitions. [2018-06-26 18:02:40,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:02:40,348 INFO ]: Start accepts. Automaton has 16 states. Word has length 16 [2018-06-26 18:02:40,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:40,348 INFO ]: With dead ends: 23 [2018-06-26 18:02:40,348 INFO ]: Without dead ends: 23 [2018-06-26 18:02:40,348 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:02:40,348 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 18:02:40,349 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-06-26 18:02:40,349 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 18:02:40,349 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-26 18:02:40,349 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 16 [2018-06-26 18:02:40,349 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:40,349 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-26 18:02:40,349 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:02:40,349 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-26 18:02:40,350 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:02:40,350 INFO ]: Found error trace [2018-06-26 18:02:40,350 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:40,350 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:40,350 INFO ]: Analyzing trace with hash -1424509046, now seen corresponding path program 5 times [2018-06-26 18:02:40,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:40,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:40,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:40,350 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:40,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:40,372 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:41,404 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:41,404 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:41,404 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:41,410 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:02:41,441 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 18:02:41,441 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:41,443 INFO ]: Computing forward predicates... [2018-06-26 18:02:41,494 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:41,512 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:41,512 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-26 18:02:41,512 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:02:41,512 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:02:41,512 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:02:41,512 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 15 states. [2018-06-26 18:02:41,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:41,637 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-26 18:02:41,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:02:41,637 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-26 18:02:41,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:41,637 INFO ]: With dead ends: 22 [2018-06-26 18:02:41,637 INFO ]: Without dead ends: 22 [2018-06-26 18:02:41,638 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:02:41,638 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 18:02:41,638 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-06-26 18:02:41,638 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:02:41,638 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-06-26 18:02:41,638 INFO ]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 16 [2018-06-26 18:02:41,638 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:41,638 INFO ]: Abstraction has 19 states and 27 transitions. [2018-06-26 18:02:41,638 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:02:41,638 INFO ]: Start isEmpty. Operand 19 states and 27 transitions. [2018-06-26 18:02:41,639 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:02:41,639 INFO ]: Found error trace [2018-06-26 18:02:41,639 INFO ]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:41,639 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:41,639 INFO ]: Analyzing trace with hash 279352904, now seen corresponding path program 12 times [2018-06-26 18:02:41,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:41,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:41,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:41,639 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:41,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:41,659 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:42,190 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:42,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:42,190 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:42,196 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:02:42,230 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 18:02:42,230 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:42,232 INFO ]: Computing forward predicates... [2018-06-26 18:02:42,308 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:42,340 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:42,340 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 18:02:42,340 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:02:42,340 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:02:42,340 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:02:42,341 INFO ]: Start difference. First operand 19 states and 27 transitions. Second operand 15 states. [2018-06-26 18:02:42,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:42,484 INFO ]: Finished difference Result 26 states and 34 transitions. [2018-06-26 18:02:42,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:02:42,484 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-26 18:02:42,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:42,484 INFO ]: With dead ends: 26 [2018-06-26 18:02:42,484 INFO ]: Without dead ends: 26 [2018-06-26 18:02:42,485 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:02:42,485 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 18:02:42,486 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-06-26 18:02:42,486 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 18:02:42,486 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-06-26 18:02:42,486 INFO ]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-06-26 18:02:42,486 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:42,486 INFO ]: Abstraction has 20 states and 28 transitions. [2018-06-26 18:02:42,486 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:02:42,486 INFO ]: Start isEmpty. Operand 20 states and 28 transitions. [2018-06-26 18:02:42,486 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:02:42,486 INFO ]: Found error trace [2018-06-26 18:02:42,486 INFO ]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:42,486 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:42,486 INFO ]: Analyzing trace with hash -2126090426, now seen corresponding path program 6 times [2018-06-26 18:02:42,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:42,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:42,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:42,487 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:42,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:42,496 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:42,703 INFO ]: Checked inductivity of 78 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:42,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:42,703 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:42,708 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:02:42,741 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 18:02:42,741 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:42,743 INFO ]: Computing forward predicates... [2018-06-26 18:02:43,141 WARN ]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-26 18:02:43,143 INFO ]: Checked inductivity of 78 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:43,161 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:43,161 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-26 18:02:43,162 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:02:43,162 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:02:43,162 INFO ]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:02:43,162 INFO ]: Start difference. First operand 20 states and 28 transitions. Second operand 17 states. [2018-06-26 18:02:43,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:43,348 INFO ]: Finished difference Result 29 states and 37 transitions. [2018-06-26 18:02:43,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:02:43,349 INFO ]: Start accepts. Automaton has 17 states. Word has length 17 [2018-06-26 18:02:43,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:43,349 INFO ]: With dead ends: 29 [2018-06-26 18:02:43,349 INFO ]: Without dead ends: 29 [2018-06-26 18:02:43,349 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:02:43,349 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 18:02:43,350 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-06-26 18:02:43,350 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 18:02:43,351 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-06-26 18:02:43,351 INFO ]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-06-26 18:02:43,351 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:43,351 INFO ]: Abstraction has 20 states and 28 transitions. [2018-06-26 18:02:43,351 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:02:43,351 INFO ]: Start isEmpty. Operand 20 states and 28 transitions. [2018-06-26 18:02:43,351 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 18:02:43,351 INFO ]: Found error trace [2018-06-26 18:02:43,351 INFO ]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:43,351 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:43,351 INFO ]: Analyzing trace with hash -1353103349, now seen corresponding path program 7 times [2018-06-26 18:02:43,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:43,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:43,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:43,352 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:43,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:43,364 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:43,722 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:43,723 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:43,723 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:43,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:43,758 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:43,760 INFO ]: Computing forward predicates... [2018-06-26 18:02:44,256 WARN ]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-26 18:02:44,614 WARN ]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-26 18:02:46,378 WARN ]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-26 18:02:46,381 INFO ]: Checked inductivity of 78 backedges. 0 proven. 76 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:46,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:46,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-26 18:02:46,423 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:02:46,423 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:02:46,424 INFO ]: CoverageRelationStatistics Valid=81, Invalid=259, Unknown=2, NotChecked=0, Total=342 [2018-06-26 18:02:46,424 INFO ]: Start difference. First operand 20 states and 28 transitions. Second operand 19 states. [2018-06-26 18:02:47,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:47,392 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-26 18:02:47,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:02:47,393 INFO ]: Start accepts. Automaton has 19 states. Word has length 17 [2018-06-26 18:02:47,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:47,393 INFO ]: With dead ends: 25 [2018-06-26 18:02:47,393 INFO ]: Without dead ends: 20 [2018-06-26 18:02:47,393 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=88, Invalid=290, Unknown=2, NotChecked=0, Total=380 [2018-06-26 18:02:47,393 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 18:02:47,394 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 18:02:47,394 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 18:02:47,394 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-06-26 18:02:47,394 INFO ]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 17 [2018-06-26 18:02:47,394 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:47,394 INFO ]: Abstraction has 20 states and 25 transitions. [2018-06-26 18:02:47,394 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:02:47,394 INFO ]: Start isEmpty. Operand 20 states and 25 transitions. [2018-06-26 18:02:47,395 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:02:47,395 INFO ]: Found error trace [2018-06-26 18:02:47,395 INFO ]: trace histogram [8, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:47,395 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:47,395 INFO ]: Analyzing trace with hash 69560658, now seen corresponding path program 13 times [2018-06-26 18:02:47,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:47,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:47,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:47,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:47,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:47,408 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:48,120 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:48,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:48,120 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:48,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:48,159 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:48,161 INFO ]: Computing forward predicates... [2018-06-26 18:02:48,582 WARN ]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-26 18:02:49,651 WARN ]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-26 18:02:51,154 WARN ]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-26 18:02:51,156 INFO ]: Checked inductivity of 91 backedges. 0 proven. 89 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:51,175 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:51,175 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2018-06-26 18:02:51,175 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:02:51,175 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:02:51,175 INFO ]: CoverageRelationStatistics Valid=88, Invalid=290, Unknown=2, NotChecked=0, Total=380 [2018-06-26 18:02:51,175 INFO ]: Start difference. First operand 20 states and 25 transitions. Second operand 20 states. [2018-06-26 18:02:51,791 WARN ]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-26 18:02:54,693 WARN ]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-26 18:02:59,709 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:59,710 INFO ]: Finished difference Result 30 states and 39 transitions. [2018-06-26 18:02:59,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 18:02:59,710 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-26 18:02:59,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:59,711 INFO ]: With dead ends: 30 [2018-06-26 18:02:59,711 INFO ]: Without dead ends: 20 [2018-06-26 18:02:59,711 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=117, Invalid=474, Unknown=9, NotChecked=0, Total=600 [2018-06-26 18:02:59,711 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 18:02:59,711 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 18:02:59,711 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 18:02:59,712 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-26 18:02:59,712 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 18 [2018-06-26 18:02:59,712 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:59,712 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-26 18:02:59,712 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:02:59,712 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-26 18:02:59,712 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:02:59,712 INFO ]: Found error trace [2018-06-26 18:02:59,712 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:59,712 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:59,712 INFO ]: Analyzing trace with hash 5166604, now seen corresponding path program 14 times [2018-06-26 18:02:59,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:59,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:59,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:59,713 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:59,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:59,724 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:03:00,041 INFO ]: Checked inductivity of 91 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:03:00,041 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:03:00,041 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:03:00,047 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:03:00,110 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:03:00,110 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:03:00,113 INFO ]: Computing forward predicates... [2018-06-26 18:03:00,736 WARN ]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-26 18:03:00,778 INFO ]: Checked inductivity of 91 backedges. 85 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:03:00,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:03:00,796 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-26 18:03:00,796 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:03:00,796 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:03:00,796 INFO ]: CoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:03:00,796 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 19 states. [2018-06-26 18:03:00,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:03:00,989 INFO ]: Finished difference Result 24 states and 31 transitions. [2018-06-26 18:03:00,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:03:00,989 INFO ]: Start accepts. Automaton has 19 states. Word has length 18 [2018-06-26 18:03:00,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:03:00,989 INFO ]: With dead ends: 24 [2018-06-26 18:03:00,990 INFO ]: Without dead ends: 24 [2018-06-26 18:03:00,990 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:03:00,990 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 18:03:00,990 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-06-26 18:03:00,990 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 18:03:00,990 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-06-26 18:03:00,990 INFO ]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 18 [2018-06-26 18:03:00,990 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:03:00,991 INFO ]: Abstraction has 21 states and 28 transitions. [2018-06-26 18:03:00,991 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:03:00,991 INFO ]: Start isEmpty. Operand 21 states and 28 transitions. [2018-06-26 18:03:00,991 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:03:00,991 INFO ]: Found error trace [2018-06-26 18:03:00,991 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:03:00,991 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:03:00,991 INFO ]: Analyzing trace with hash -1627289649, now seen corresponding path program 8 times [2018-06-26 18:03:00,991 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:03:00,991 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:03:00,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:03:00,991 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:03:00,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:03:01,013 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:03:01,547 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:03:01,547 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:03:01,547 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:03:01,552 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:03:01,584 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:03:01,584 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:03:01,587 INFO ]: Computing forward predicates... [2018-06-26 18:03:01,792 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:03:01,812 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:03:01,812 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-26 18:03:01,813 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:03:01,813 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:03:01,813 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:03:01,813 INFO ]: Start difference. First operand 21 states and 28 transitions. Second operand 17 states. [2018-06-26 18:03:02,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:03:02,044 INFO ]: Finished difference Result 26 states and 33 transitions. [2018-06-26 18:03:02,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:03:02,044 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-26 18:03:02,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:03:02,045 INFO ]: With dead ends: 26 [2018-06-26 18:03:02,045 INFO ]: Without dead ends: 26 [2018-06-26 18:03:02,045 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:03:02,045 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 18:03:02,046 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-06-26 18:03:02,046 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 18:03:02,046 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-06-26 18:03:02,046 INFO ]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 18 [2018-06-26 18:03:02,046 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:03:02,046 INFO ]: Abstraction has 21 states and 28 transitions. [2018-06-26 18:03:02,046 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:03:02,046 INFO ]: Start isEmpty. Operand 21 states and 28 transitions. [2018-06-26 18:03:02,046 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:03:02,046 INFO ]: Found error trace [2018-06-26 18:03:02,046 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:03:02,046 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:03:02,046 INFO ]: Analyzing trace with hash 147717713, now seen corresponding path program 7 times [2018-06-26 18:03:02,046 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:03:02,046 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:03:02,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:03:02,047 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:03:02,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:03:02,056 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:03:02,270 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:03:02,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:03:02,270 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:03:02,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:03:02,309 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:03:02,311 INFO ]: Computing forward predicates... [2018-06-26 18:03:02,673 WARN ]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-26 18:03:03,495 WARN ]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-26 18:03:05,547 WARN ]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-26 18:03:05,549 INFO ]: Checked inductivity of 91 backedges. 0 proven. 88 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:03:05,569 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:03:05,569 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2018-06-26 18:03:05,569 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:03:05,569 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:03:05,569 INFO ]: CoverageRelationStatistics Valid=92, Invalid=285, Unknown=3, NotChecked=0, Total=380 [2018-06-26 18:03:05,569 INFO ]: Start difference. First operand 21 states and 28 transitions. Second operand 20 states. [2018-06-26 18:03:08,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:03:08,963 INFO ]: Finished difference Result 26 states and 33 transitions. [2018-06-26 18:03:08,984 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:03:08,984 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-26 18:03:08,984 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:03:08,984 INFO ]: With dead ends: 26 [2018-06-26 18:03:08,984 INFO ]: Without dead ends: 21 [2018-06-26 18:03:08,985 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=99, Invalid=318, Unknown=3, NotChecked=0, Total=420 [2018-06-26 18:03:08,985 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 18:03:08,985 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 18:03:08,985 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 18:03:08,986 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-26 18:03:08,986 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 18 [2018-06-26 18:03:08,986 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:03:08,986 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-26 18:03:08,986 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:03:08,986 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-26 18:03:08,986 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:03:08,986 INFO ]: Found error trace [2018-06-26 18:03:08,986 INFO ]: trace histogram [9, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:03:08,986 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:03:08,986 INFO ]: Analyzing trace with hash 159719950, now seen corresponding path program 15 times [2018-06-26 18:03:08,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:03:08,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:03:08,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:03:08,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:03:08,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:03:09,001 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:03:09,370 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:03:09,370 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:03:09,370 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:03:09,375 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:03:09,415 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-26 18:03:09,415 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:03:09,417 INFO ]: Computing forward predicates... [2018-06-26 18:03:10,120 WARN ]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 24 Received shutdown request... [2018-06-26 18:03:10,743 WARN ]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-26 18:03:10,744 INFO ]: Timeout while computing interpolants [2018-06-26 18:03:10,944 WARN ]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:03:10,944 WARN ]: Verification canceled [2018-06-26 18:03:10,946 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:03:10,947 WARN ]: Timeout [2018-06-26 18:03:10,947 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:03:10 BasicIcfg [2018-06-26 18:03:10,947 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:03:10,947 INFO ]: Toolchain (without parser) took 65599.75 ms. Allocated memory was 307.8 MB in the beginning and 600.8 MB in the end (delta: 293.1 MB). Free memory was 262.1 MB in the beginning and 464.3 MB in the end (delta: -202.3 MB). Peak memory consumption was 90.8 MB. Max. memory is 3.6 GB. [2018-06-26 18:03:10,948 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:03:10,948 INFO ]: ChcToBoogie took 74.71 ms. Allocated memory is still 307.8 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:03:10,948 INFO ]: Boogie Preprocessor took 38.32 ms. Allocated memory is still 307.8 MB. Free memory was 259.1 MB in the beginning and 258.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 18:03:10,949 INFO ]: RCFGBuilder took 447.08 ms. Allocated memory is still 307.8 MB. Free memory was 258.1 MB in the beginning and 244.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:03:10,949 INFO ]: BlockEncodingV2 took 78.05 ms. Allocated memory is still 307.8 MB. Free memory was 244.1 MB in the beginning and 241.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:03:10,949 INFO ]: TraceAbstraction took 64953.64 ms. Allocated memory was 307.8 MB in the beginning and 600.8 MB in the end (delta: 293.1 MB). Free memory was 241.1 MB in the beginning and 464.3 MB in the end (delta: -223.2 MB). Peak memory consumption was 69.8 MB. Max. memory is 3.6 GB. [2018-06-26 18:03:10,952 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 20 edges - StatisticsResult: Encoded RCFG 6 locations, 16 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 74.71 ms. Allocated memory is still 307.8 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.32 ms. Allocated memory is still 307.8 MB. Free memory was 259.1 MB in the beginning and 258.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 447.08 ms. Allocated memory is still 307.8 MB. Free memory was 258.1 MB in the beginning and 244.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 78.05 ms. Allocated memory is still 307.8 MB. Free memory was 244.1 MB in the beginning and 241.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 64953.64 ms. Allocated memory was 307.8 MB in the beginning and 600.8 MB in the end (delta: 293.1 MB). Free memory was 241.1 MB in the beginning and 464.3 MB in the end (delta: -223.2 MB). Peak memory consumption was 69.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 9, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 3 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 64.8s OverallTime, 49 OverallIterations, 9 TraceHistogramMax, 24.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 296 SDtfs, 68 SDslu, 975 SDs, 0 SdLazy, 4529 SolverSat, 948 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1001 GetRequests, 299 SyntacticMatches, 208 SemanticMatches, 494 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 41.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, 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.0s AutomataMinimizationTime, 48 MinimizatonAttempts, 104 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 34.5s InterpolantComputationTime, 1098 NumberOfCodeBlocks, 1098 NumberOfCodeBlocksAsserted, 179 NumberOfCheckSat, 1006 ConstructedInterpolants, 73 QuantifiedInterpolants, 69640 SizeOfPredicates, 119 NumberOfNonLiveVariables, 9661 ConjunctsInSsa, 1423 ConjunctsInUnsatCore, 92 InterpolantComputations, 7 PerfectInterpolantSequences, 701/3193 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-03-10-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-03-10-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-03-10-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-03-10-961.csv Completed graceful shutdown